/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:58:22,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:58:22,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:58:22,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:58:22,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:58:22,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:58:22,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:58:22,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:58:22,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:58:22,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:58:22,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:58:22,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:58:22,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:58:22,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:58:22,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:58:22,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:58:22,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:58:22,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:58:22,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:58:22,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:58:22,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:58:22,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:58:22,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:58:22,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:58:22,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:58:22,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:58:22,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:58:22,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:58:22,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:58:22,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:58:22,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:58:22,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:58:22,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:58:22,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:58:22,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:58:22,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:58:22,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:58:22,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:58:22,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:58:22,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:58:22,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:58:22,375 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:58:22,389 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:58:22,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:58:22,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:58:22,391 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:58:22,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:58:22,391 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:58:22,392 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:58:22,392 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:58:22,392 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:58:22,392 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:58:22,392 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:58:22,392 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:58:22,393 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:58:22,393 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:58:22,393 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:58:22,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:58:22,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:58:22,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:58:22,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:58:22,394 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:58:22,394 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:58:22,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:58:22,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:58:22,395 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:58:22,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:58:22,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:58:22,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:58:22,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:58:22,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:58:22,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:58:22,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:58:22,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:58:22,575 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:58:22,575 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:58:22,576 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:58:22,645 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_9ri5x8/tmp/6501c41e73d14b22b5e6b8474fd3dc23/FLAG18ed98e22 [2020-07-01 12:58:22,977 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:58:22,977 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:58:22,978 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:58:22,984 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_9ri5x8/tmp/6501c41e73d14b22b5e6b8474fd3dc23/FLAG18ed98e22 [2020-07-01 12:58:23,407 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_9ri5x8/tmp/6501c41e73d14b22b5e6b8474fd3dc23 [2020-07-01 12:58:23,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:58:23,420 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:58:23,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:58:23,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:58:23,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:58:23,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679d5542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23, skipping insertion in model container [2020-07-01 12:58:23,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:58:23,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:58:23,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:58:23,692 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:58:23,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:58:23,724 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:58:23,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23 WrapperNode [2020-07-01 12:58:23,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:58:23,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:58:23,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:58:23,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:58:23,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:58:23,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:58:23,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:58:23,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:58:23,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... [2020-07-01 12:58:23,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:58:23,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:58:23,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:58:23,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:58:23,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:58:23,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:58:23,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:58:23,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:58:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:58:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:58:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:58:24,142 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:58:24,143 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:58:24,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24 BoogieIcfgContainer [2020-07-01 12:58:24,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:58:24,148 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:58:24,148 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:58:24,150 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:58:24,152 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24" (1/1) ... [2020-07-01 12:58:24,169 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 46 edges [2020-07-01 12:58:24,171 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:58:24,174 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:58:24,175 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:58:24,175 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:58:24,177 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:58:24,178 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:58:24,178 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:58:24,206 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:58:24,243 INFO L200 BlockEncoder]: SBE split 24 edges [2020-07-01 12:58:24,248 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:58:24,250 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:58:24,290 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:58:24,293 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:58:24,295 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:58:24,296 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:58:24,302 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 12:58:24,303 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:58:24,303 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:58:24,304 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:58:24,304 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:58:24,305 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:58:24,305 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 77 edges [2020-07-01 12:58:24,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:58:24 BasicIcfg [2020-07-01 12:58:24,306 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:58:24,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:58:24,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:58:24,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:58:24,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:58:23" (1/4) ... [2020-07-01 12:58:24,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6663e617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:58:24, skipping insertion in model container [2020-07-01 12:58:24,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (2/4) ... [2020-07-01 12:58:24,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6663e617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:58:24, skipping insertion in model container [2020-07-01 12:58:24,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24" (3/4) ... [2020-07-01 12:58:24,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6663e617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:58:24, skipping insertion in model container [2020-07-01 12:58:24,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:58:24" (4/4) ... [2020-07-01 12:58:24,316 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:58:24,327 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:58:24,335 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-07-01 12:58:24,351 INFO L251 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-07-01 12:58:24,377 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:58:24,377 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:58:24,377 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:58:24,377 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:58:24,378 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:58:24,378 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:58:24,378 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:58:24,378 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:58:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-01 12:58:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:58:24,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:24,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:58:24,403 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:58:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 127364, now seen corresponding path program 1 times [2020-07-01 12:58:24,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:24,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665536273] [2020-07-01 12:58:24,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:24,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665536273] [2020-07-01 12:58:24,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:24,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:24,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653371667] [2020-07-01 12:58:24,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:24,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:24,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:24,703 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-01 12:58:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:24,891 INFO L93 Difference]: Finished difference Result 53 states and 139 transitions. [2020-07-01 12:58:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:24,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:58:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:24,906 INFO L225 Difference]: With dead ends: 53 [2020-07-01 12:58:24,906 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:58:24,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:58:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:58:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:58:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. [2020-07-01 12:58:24,949 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 3 [2020-07-01 12:58:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:24,950 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. [2020-07-01 12:58:24,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. [2020-07-01 12:58:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:58:24,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:24,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:58:24,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:58:24,953 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:58:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 127366, now seen corresponding path program 1 times [2020-07-01 12:58:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:24,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372677697] [2020-07-01 12:58:24,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:24,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372677697] [2020-07-01 12:58:24,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:24,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:24,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050496377] [2020-07-01 12:58:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:24,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:24,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:24,983 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 3 states. [2020-07-01 12:58:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,051 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-07-01 12:58:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:58:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,052 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:58:25,052 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:58:25,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:58:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:58:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:58:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2020-07-01 12:58:25,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 3 [2020-07-01 12:58:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,058 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-07-01 12:58:25,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2020-07-01 12:58:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:58:25,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:58:25,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:58:25,059 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 127367, now seen corresponding path program 1 times [2020-07-01 12:58:25,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732702717] [2020-07-01 12:58:25,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732702717] [2020-07-01 12:58:25,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127557139] [2020-07-01 12:58:25,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,109 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2020-07-01 12:58:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,182 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-07-01 12:58:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:58:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,184 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:58:25,184 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:58:25,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:58:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:58:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:58:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2020-07-01 12:58:25,188 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 3 [2020-07-01 12:58:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,188 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. [2020-07-01 12:58:25,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2020-07-01 12:58:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:58:25,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:58:25,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:58:25,189 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash 3950319, now seen corresponding path program 1 times [2020-07-01 12:58:25,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199745561] [2020-07-01 12:58:25,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199745561] [2020-07-01 12:58:25,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862698330] [2020-07-01 12:58:25,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,226 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 3 states. [2020-07-01 12:58:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,272 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. [2020-07-01 12:58:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:58:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,273 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:58:25,273 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:58:25,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:58:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:58:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:58:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-01 12:58:25,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 4 [2020-07-01 12:58:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,277 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-01 12:58:25,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-01 12:58:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:58:25,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:58:25,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:58:25,278 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 3950321, now seen corresponding path program 1 times [2020-07-01 12:58:25,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106916278] [2020-07-01 12:58:25,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106916278] [2020-07-01 12:58:25,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041991576] [2020-07-01 12:58:25,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,306 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2020-07-01 12:58:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,341 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-01 12:58:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:58:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,342 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:58:25,342 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:58:25,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:58:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:58:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:58:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2020-07-01 12:58:25,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 4 [2020-07-01 12:58:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,346 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-07-01 12:58:25,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2020-07-01 12:58:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:58:25,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:58:25,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:58:25,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:58:25,347 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:58:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash 3950322, now seen corresponding path program 1 times [2020-07-01 12:58:25,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820099361] [2020-07-01 12:58:25,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820099361] [2020-07-01 12:58:25,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217271757] [2020-07-01 12:58:25,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:58:25,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,386 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand 3 states. [2020-07-01 12:58:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,439 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2020-07-01 12:58:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:58:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:58:25,440 INFO L225 Difference]: With dead ends: 16 [2020-07-01 12:58:25,440 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:58:25,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:58:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:58:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:58:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:58:25,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 12:58:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:58:25,442 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:58:25,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:58:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:58:25,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:58:25,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:58:25,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:58:25,478 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-01 12:58:25,478 INFO L264 CegarLoopResult]: At program point L17-1(lines 9 20) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~debug~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~debug~0.base)) (= 0 ULTIMATE.start_main_~debug~0.offset) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 12:58:25,478 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:58:25,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:58:25,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:58:25,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:58:25,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:58:25,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:58:25,480 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:58:25,481 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point L12-1(lines 12 16) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point L12-3(lines 12 16) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:58:25,482 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:58:25,483 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:58:25,485 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:58:25,494 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,495 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:58:25 BasicIcfg [2020-07-01 12:58:25,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:58:25,504 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:58:25,505 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:58:25,508 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:58:25,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:25,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:58:23" (1/5) ... [2020-07-01 12:58:25,509 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dea0d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:58:25, skipping insertion in model container [2020-07-01 12:58:25,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:25,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:58:23" (2/5) ... [2020-07-01 12:58:25,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dea0d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:58:25, skipping insertion in model container [2020-07-01 12:58:25,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:25,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:58:24" (3/5) ... [2020-07-01 12:58:25,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dea0d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:58:25, skipping insertion in model container [2020-07-01 12:58:25,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:25,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:58:24" (4/5) ... [2020-07-01 12:58:25,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dea0d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:58:25, skipping insertion in model container [2020-07-01 12:58:25,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:58:25,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:58:25" (5/5) ... [2020-07-01 12:58:25,513 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:58:25,535 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:58:25,535 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:58:25,535 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:58:25,535 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:58:25,536 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:58:25,536 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:58:25,536 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:58:25,536 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:58:25,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-07-01 12:58:25,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:58:25,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:58:25,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:58:25,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:58:25,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,552 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:58:25,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-07-01 12:58:25,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:58:25,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:58:25,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:58:25,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:58:25,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:58:25,560 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [97] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 25#L8true [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 8#L9true [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4)) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0)) |v_#memory_int_3|) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 20#L17-1true [2020-07-01 12:58:25,561 INFO L796 eck$LassoCheckResult]: Loop: 20#L17-1true [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 15#L12true [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 13#L12-1true [160] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (> 0 (+ .cse0 (- 2))) (< 0 .cse0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 33#L13true [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 31#L13-2true [207] L13-2-->L12-3: Formula: (and (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post6] 28#L12-3true [93] L12-3-->L17: Formula: (and (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 22#L17true [88] L17-->L17-1: Formula: (= 0 |v_ULTIMATE.start_main_#t~mem8_6|) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 20#L17-1true [2020-07-01 12:58:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash 3953126, now seen corresponding path program 1 times [2020-07-01 12:58:25,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540261261] [2020-07-01 12:58:25,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:58:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:58:25,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540261261] [2020-07-01 12:58:25,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:58:25,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:58:25,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057538687] [2020-07-01 12:58:25,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:58:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:58:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -305097152, now seen corresponding path program 1 times [2020-07-01 12:58:25,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:58:25,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321463831] [2020-07-01 12:58:25,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:58:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:58:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:58:25,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:58:25,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:58:25,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:58:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:58:25,752 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-01 12:58:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:58:25,847 INFO L93 Difference]: Finished difference Result 34 states and 59 transitions. [2020-07-01 12:58:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:58:25,851 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:58:25,855 INFO L168 Benchmark]: Toolchain (without parser) took 2434.61 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 556.3 MB in the beginning and 454.5 MB in the end (delta: 101.9 MB). Peak memory consumption was 134.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,855 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 578.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:58:25,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.83 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 556.3 MB in the beginning and 645.4 MB in the end (delta: -89.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 682.6 MB. Free memory was 645.4 MB in the beginning and 643.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,857 INFO L168 Benchmark]: Boogie Preprocessor took 23.87 ms. Allocated memory is still 682.6 MB. Free memory was 643.2 MB in the beginning and 642.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,858 INFO L168 Benchmark]: RCFGBuilder took 358.42 ms. Allocated memory is still 682.6 MB. Free memory was 642.1 MB in the beginning and 617.8 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,859 INFO L168 Benchmark]: BlockEncodingV2 took 158.41 ms. Allocated memory is still 682.6 MB. Free memory was 617.8 MB in the beginning and 607.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,859 INFO L168 Benchmark]: TraceAbstraction took 1196.93 ms. Allocated memory is still 682.6 MB. Free memory was 605.9 MB in the beginning and 498.9 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,860 INFO L168 Benchmark]: BuchiAutomizer took 348.02 ms. Allocated memory is still 682.6 MB. Free memory was 498.9 MB in the beginning and 454.5 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:58:25,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 46 edges - StatisticsResult: Encoded RCFG 34 locations, 77 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 578.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.83 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 556.3 MB in the beginning and 645.4 MB in the end (delta: -89.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 682.6 MB. Free memory was 645.4 MB in the beginning and 643.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.87 ms. Allocated memory is still 682.6 MB. Free memory was 643.2 MB in the beginning and 642.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 358.42 ms. Allocated memory is still 682.6 MB. Free memory was 642.1 MB in the beginning and 617.8 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 158.41 ms. Allocated memory is still 682.6 MB. Free memory was 617.8 MB in the beginning and 607.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1196.93 ms. Allocated memory is still 682.6 MB. Free memory was 605.9 MB in the beginning and 498.9 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 348.02 ms. Allocated memory is still 682.6 MB. Free memory was 498.9 MB in the beginning and 454.5 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:58:25,872 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,873 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:58:25,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[debug] && 1 == \valid[debug]) && 0 == debug) && \valid[x] == 1) && unknown-#length-unknown[x] == 4) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 SDtfs, 153 SDslu, 4 SDs, 0 SdLazy, 166 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:58:20.087 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_9ri5x8/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:58:26.100 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check