/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:13:36,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:13:36,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:13:36,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:13:36,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:13:36,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:13:36,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:13:36,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:13:36,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:13:36,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:13:36,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:13:36,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:13:36,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:13:36,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:13:36,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:13:36,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:13:36,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:13:36,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:13:36,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:13:36,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:13:36,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:13:36,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:13:36,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:13:36,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:13:36,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:13:36,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:13:36,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:13:36,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:13:36,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:13:36,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:13:36,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:13:36,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:13:36,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:13:36,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:13:36,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:13:36,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:13:36,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:13:36,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:13:36,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:13:36,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:13:36,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:13:36,647 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:13:36,661 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:13:36,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:13:36,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:13:36,662 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:13:36,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:13:36,663 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:13:36,663 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:13:36,663 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:13:36,663 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:13:36,663 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:13:36,663 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:13:36,664 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:13:36,664 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:13:36,664 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:13:36,664 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:13:36,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:13:36,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:13:36,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:13:36,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:13:36,665 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:13:36,665 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:13:36,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:13:36,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:13:36,666 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:13:36,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:13:36,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:13:36,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:13:36,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:13:36,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:13:36,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:13:36,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:13:36,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:13:36,845 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:13:36,845 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:13:36,846 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:13:36,917 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_wDdhXe/tmp/35c07d4b505c481cbcff490cf2519dc3/FLAG71aec8003 [2020-07-01 13:13:37,257 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:13:37,257 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:13:37,258 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:13:37,265 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_wDdhXe/tmp/35c07d4b505c481cbcff490cf2519dc3/FLAG71aec8003 [2020-07-01 13:13:37,654 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_wDdhXe/tmp/35c07d4b505c481cbcff490cf2519dc3 [2020-07-01 13:13:37,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:13:37,666 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:13:37,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:13:37,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:13:37,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:13:37,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:37,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39583b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37, skipping insertion in model container [2020-07-01 13:13:37,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:37,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:13:37,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:13:37,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:13:37,951 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:13:37,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:13:37,984 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:13:37,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37 WrapperNode [2020-07-01 13:13:37,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:13:37,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:13:37,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:13:37,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:13:37,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:13:38,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:13:38,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:13:38,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:13:38,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... [2020-07-01 13:13:38,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:13:38,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:13:38,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:13:38,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:13:38,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 13:13:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:13:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:13:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:13:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:13:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:13:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:13:38,457 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:13:38,457 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:13:38,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:38 BoogieIcfgContainer [2020-07-01 13:13:38,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:13:38,463 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:13:38,463 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:13:38,465 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:13:38,466 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:38" (1/1) ... [2020-07-01 13:13:38,482 INFO L313 BlockEncoder]: Initial Icfg 63 locations, 67 edges [2020-07-01 13:13:38,484 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:13:38,484 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:13:38,485 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:13:38,485 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:13:38,487 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:13:38,488 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:13:38,488 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:13:38,516 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:13:38,549 INFO L200 BlockEncoder]: SBE split 34 edges [2020-07-01 13:13:38,554 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:13:38,556 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:13:38,597 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:13:38,600 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:13:38,601 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:13:38,602 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:13:38,602 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:13:38,603 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:13:38,603 INFO L313 BlockEncoder]: Encoded RCFG 53 locations, 91 edges [2020-07-01 13:13:38,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:13:38 BasicIcfg [2020-07-01 13:13:38,604 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:13:38,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:13:38,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:13:38,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:13:38,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:13:37" (1/4) ... [2020-07-01 13:13:38,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4483db14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:13:38, skipping insertion in model container [2020-07-01 13:13:38,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (2/4) ... [2020-07-01 13:13:38,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4483db14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:13:38, skipping insertion in model container [2020-07-01 13:13:38,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:38" (3/4) ... [2020-07-01 13:13:38,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4483db14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:38, skipping insertion in model container [2020-07-01 13:13:38,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:13:38" (4/4) ... [2020-07-01 13:13:38,613 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:13:38,624 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:13:38,631 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-07-01 13:13:38,645 INFO L251 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-07-01 13:13:38,669 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:13:38,669 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:13:38,669 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:13:38,669 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:13:38,669 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:13:38,670 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:13:38,670 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:13:38,670 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:13:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-07-01 13:13:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:38,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:38,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:38,693 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash 166667, now seen corresponding path program 1 times [2020-07-01 13:13:38,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:38,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486888887] [2020-07-01 13:13:38,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:38,861 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 13:13:38,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486888887] [2020-07-01 13:13:38,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:38,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:38,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375755270] [2020-07-01 13:13:38,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:38,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:38,887 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-07-01 13:13:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:39,045 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2020-07-01 13:13:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:39,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:39,059 INFO L225 Difference]: With dead ends: 104 [2020-07-01 13:13:39,059 INFO L226 Difference]: Without dead ends: 53 [2020-07-01 13:13:39,063 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 13:13:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-01 13:13:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-01 13:13:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 13:13:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 88 transitions. [2020-07-01 13:13:39,103 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 88 transitions. Word has length 3 [2020-07-01 13:13:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:39,103 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 88 transitions. [2020-07-01 13:13:39,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 88 transitions. [2020-07-01 13:13:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:39,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:39,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:39,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:13:39,106 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 166698, now seen corresponding path program 1 times [2020-07-01 13:13:39,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:39,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632890021] [2020-07-01 13:13:39,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:39,155 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 13:13:39,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632890021] [2020-07-01 13:13:39,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:39,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:39,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248997332] [2020-07-01 13:13:39,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:39,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:39,159 INFO L87 Difference]: Start difference. First operand 53 states and 88 transitions. Second operand 3 states. [2020-07-01 13:13:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:39,314 INFO L93 Difference]: Finished difference Result 53 states and 88 transitions. [2020-07-01 13:13:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:39,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:39,317 INFO L225 Difference]: With dead ends: 53 [2020-07-01 13:13:39,317 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:13:39,318 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 13:13:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:13:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:13:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:13:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2020-07-01 13:13:39,325 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 3 [2020-07-01 13:13:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:39,325 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 84 transitions. [2020-07-01 13:13:39,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2020-07-01 13:13:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:39,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:39,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:39,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:13:39,326 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash 166700, now seen corresponding path program 1 times [2020-07-01 13:13:39,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:39,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421601777] [2020-07-01 13:13:39,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:39,348 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 13:13:39,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421601777] [2020-07-01 13:13:39,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:39,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:39,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421349638] [2020-07-01 13:13:39,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:39,351 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. Second operand 3 states. [2020-07-01 13:13:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:39,444 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2020-07-01 13:13:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:39,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:39,445 INFO L225 Difference]: With dead ends: 53 [2020-07-01 13:13:39,446 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:13:39,446 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 13:13:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:13:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:13:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:13:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2020-07-01 13:13:39,452 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 3 [2020-07-01 13:13:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:39,452 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2020-07-01 13:13:39,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2020-07-01 13:13:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:39,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:39,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:39,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:13:39,454 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:39,454 INFO L82 PathProgramCache]: Analyzing trace with hash 166701, now seen corresponding path program 1 times [2020-07-01 13:13:39,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:39,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293629323] [2020-07-01 13:13:39,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:39,487 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 13:13:39,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293629323] [2020-07-01 13:13:39,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:39,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:39,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254047371] [2020-07-01 13:13:39,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:39,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:39,489 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand 3 states. [2020-07-01 13:13:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:39,623 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2020-07-01 13:13:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:39,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:39,625 INFO L225 Difference]: With dead ends: 51 [2020-07-01 13:13:39,625 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 13:13:39,626 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 13:13:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 13:13:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 13:13:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 13:13:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 80 transitions. [2020-07-01 13:13:39,632 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 80 transitions. Word has length 3 [2020-07-01 13:13:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:39,632 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 80 transitions. [2020-07-01 13:13:39,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 80 transitions. [2020-07-01 13:13:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:13:39,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:39,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:13:39,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:13:39,633 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 5169885, now seen corresponding path program 1 times [2020-07-01 13:13:39,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:39,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589620868] [2020-07-01 13:13:39,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:39,668 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 13:13:39,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589620868] [2020-07-01 13:13:39,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:39,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:39,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409359693] [2020-07-01 13:13:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:39,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:39,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:39,670 INFO L87 Difference]: Start difference. First operand 49 states and 80 transitions. Second operand 3 states. [2020-07-01 13:13:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:39,779 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2020-07-01 13:13:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:39,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:13:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:39,780 INFO L225 Difference]: With dead ends: 49 [2020-07-01 13:13:39,780 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 13:13:39,781 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 13:13:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 13:13:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 13:13:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 13:13:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2020-07-01 13:13:39,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 76 transitions. Word has length 4 [2020-07-01 13:13:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:39,786 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 76 transitions. [2020-07-01 13:13:39,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 76 transitions. [2020-07-01 13:13:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:13:39,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:39,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:13:39,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:13:39,787 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 5169887, now seen corresponding path program 1 times [2020-07-01 13:13:39,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:39,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769411491] [2020-07-01 13:13:39,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:39,813 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 13:13:39,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769411491] [2020-07-01 13:13:39,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:39,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:39,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665043779] [2020-07-01 13:13:39,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:39,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:39,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:39,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:39,815 INFO L87 Difference]: Start difference. First operand 47 states and 76 transitions. Second operand 3 states. [2020-07-01 13:13:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:39,907 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2020-07-01 13:13:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:39,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:13:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:39,909 INFO L225 Difference]: With dead ends: 49 [2020-07-01 13:13:39,909 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 13:13:39,909 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 13:13:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 13:13:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 13:13:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 13:13:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2020-07-01 13:13:39,914 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 4 [2020-07-01 13:13:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:39,914 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2020-07-01 13:13:39,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2020-07-01 13:13:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:13:39,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:39,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:13:39,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:13:39,915 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash 5169888, now seen corresponding path program 1 times [2020-07-01 13:13:39,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:39,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642358398] [2020-07-01 13:13:39,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:39,943 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 13:13:39,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642358398] [2020-07-01 13:13:39,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:39,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:39,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670520785] [2020-07-01 13:13:39,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:39,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:39,945 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2020-07-01 13:13:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,041 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2020-07-01 13:13:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:40,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:13:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,043 INFO L225 Difference]: With dead ends: 47 [2020-07-01 13:13:40,043 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:13:40,043 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 13:13:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:13:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:13:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:13:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-07-01 13:13:40,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 4 [2020-07-01 13:13:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,049 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-07-01 13:13:40,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-07-01 13:13:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:13:40,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:13:40,051 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1804427872, now seen corresponding path program 1 times [2020-07-01 13:13:40,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903461394] [2020-07-01 13:13:40,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,078 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 13:13:40,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903461394] [2020-07-01 13:13:40,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:40,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003332091] [2020-07-01 13:13:40,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:40,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:40,080 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 3 states. [2020-07-01 13:13:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,160 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2020-07-01 13:13:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:40,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 13:13:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,161 INFO L225 Difference]: With dead ends: 85 [2020-07-01 13:13:40,161 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:13:40,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 13:13:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:13:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:13:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:13:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2020-07-01 13:13:40,166 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 9 [2020-07-01 13:13:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,167 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 69 transitions. [2020-07-01 13:13:40,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2020-07-01 13:13:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:13:40,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:13:40,168 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1139518898, now seen corresponding path program 1 times [2020-07-01 13:13:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685326791] [2020-07-01 13:13:40,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,207 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 13:13:40,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685326791] [2020-07-01 13:13:40,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:40,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722129808] [2020-07-01 13:13:40,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:13:40,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:13:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:13:40,210 INFO L87 Difference]: Start difference. First operand 45 states and 69 transitions. Second operand 4 states. [2020-07-01 13:13:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,314 INFO L93 Difference]: Finished difference Result 45 states and 69 transitions. [2020-07-01 13:13:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:13:40,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 13:13:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,315 INFO L225 Difference]: With dead ends: 45 [2020-07-01 13:13:40,315 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 13:13:40,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:13:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 13:13:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 13:13:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:13:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2020-07-01 13:13:40,320 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2020-07-01 13:13:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,320 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2020-07-01 13:13:40,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:13:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2020-07-01 13:13:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:13:40,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:13:40,321 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1139518900, now seen corresponding path program 1 times [2020-07-01 13:13:40,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482595980] [2020-07-01 13:13:40,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,356 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 13:13:40,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482595980] [2020-07-01 13:13:40,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:40,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329442378] [2020-07-01 13:13:40,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:13:40,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:13:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:13:40,358 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand 4 states. [2020-07-01 13:13:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,416 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2020-07-01 13:13:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:13:40,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 13:13:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,418 INFO L225 Difference]: With dead ends: 45 [2020-07-01 13:13:40,418 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 13:13:40,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:13:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 13:13:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 13:13:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:13:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2020-07-01 13:13:40,422 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 11 [2020-07-01 13:13:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,422 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-07-01 13:13:40,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:13:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2020-07-01 13:13:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:13:40,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:13:40,423 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1139518901, now seen corresponding path program 1 times [2020-07-01 13:13:40,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662166319] [2020-07-01 13:13:40,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,492 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 13:13:40,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662166319] [2020-07-01 13:13:40,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:13:40,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104042392] [2020-07-01 13:13:40,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:13:40,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:13:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:13:40,494 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 5 states. [2020-07-01 13:13:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,584 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-07-01 13:13:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:13:40,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 13:13:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,585 INFO L225 Difference]: With dead ends: 39 [2020-07-01 13:13:40,585 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:13:40,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:13:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:13:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:13:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:13:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-07-01 13:13:40,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 11 [2020-07-01 13:13:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,589 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-07-01 13:13:40,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:13:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2020-07-01 13:13:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 13:13:40,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:13:40,591 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash 965344688, now seen corresponding path program 1 times [2020-07-01 13:13:40,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016199112] [2020-07-01 13:13:40,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,629 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 13:13:40,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016199112] [2020-07-01 13:13:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962537842] [2020-07-01 13:13:40,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:13:40,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:13:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:13:40,632 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand 4 states. [2020-07-01 13:13:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,696 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2020-07-01 13:13:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:13:40,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 13:13:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,697 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:13:40,697 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:13:40,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:13:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:13:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:13:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:13:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-01 13:13:40,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 12 [2020-07-01 13:13:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,702 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-01 13:13:40,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:13:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-01 13:13:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 13:13:40,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:13:40,703 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash 965344690, now seen corresponding path program 1 times [2020-07-01 13:13:40,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617753787] [2020-07-01 13:13:40,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,735 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 13:13:40,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617753787] [2020-07-01 13:13:40,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:40,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271955633] [2020-07-01 13:13:40,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:13:40,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:13:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:13:40,737 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 4 states. [2020-07-01 13:13:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,779 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-01 13:13:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:13:40,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 13:13:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,781 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:13:40,781 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:13:40,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:13:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:13:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:13:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:13:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-01 13:13:40,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 12 [2020-07-01 13:13:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,784 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-01 13:13:40,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:13:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-01 13:13:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 13:13:40,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:40,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:40,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:13:40,785 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:40,786 INFO L82 PathProgramCache]: Analyzing trace with hash 965344691, now seen corresponding path program 1 times [2020-07-01 13:13:40,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:40,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217556905] [2020-07-01 13:13:40,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:40,830 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 13:13:40,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217556905] [2020-07-01 13:13:40,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:40,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:40,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990926651] [2020-07-01 13:13:40,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:13:40,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:40,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:13:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:13:40,832 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2020-07-01 13:13:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:40,886 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-01 13:13:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:13:40,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 13:13:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:40,887 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:13:40,887 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:13:40,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:13:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:13:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:13:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:13:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:13:40,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-01 13:13:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:40,889 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:13:40,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:13:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:13:40,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:13:40,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 13:13:40,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:13:40,965 INFO L268 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-07-01 13:13:40,965 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 13:13:40,965 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 13:13:40,965 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2020-07-01 13:13:40,966 INFO L264 CegarLoopResult]: At program point L19-4(lines 18 24) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_gcd_~y1.base) 1) (<= 1 |#StackHeapBarrier|) (= 4 (select |#length| ULTIMATE.start_main_~y2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~y2~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~y1~0.base)) (= 0 ULTIMATE.start_main_~y1~0.offset) (= ULTIMATE.start_gcd_~y2.offset 0) (= 1 (select |#valid| ULTIMATE.start_gcd_~y2.base)) (= 0 ULTIMATE.start_gcd_~y1.offset) (= 0 ULTIMATE.start_main_~y2~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~y1~0.base)) (<= 4 (select |#length| ULTIMATE.start_gcd_~y1.base)) (= 4 (select |#length| ULTIMATE.start_gcd_~y2.base))) [2020-07-01 13:13:40,966 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:13:40,966 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-01 13:13:40,966 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,966 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:13:40,966 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,966 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:40,967 INFO L268 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,968 INFO L268 CegarLoopResult]: For program point L33-1(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point L33-2(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point L33-3(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point L33-4(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point L33-6(lines 33 35) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,969 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:13:40,970 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 24) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 24) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 13:13:40,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 13:13:40,974 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:13:40,984 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:40,985 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:40,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:40,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:40 BasicIcfg [2020-07-01 13:13:40,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:13:40,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:13:40,998 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:13:41,002 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:13:41,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:41,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:13:37" (1/5) ... [2020-07-01 13:13:41,003 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe5390e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:13:41, skipping insertion in model container [2020-07-01 13:13:41,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:41,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:37" (2/5) ... [2020-07-01 13:13:41,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe5390e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:13:41, skipping insertion in model container [2020-07-01 13:13:41,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:41,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:38" (3/5) ... [2020-07-01 13:13:41,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe5390e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:13:41, skipping insertion in model container [2020-07-01 13:13:41,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:41,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:13:38" (4/5) ... [2020-07-01 13:13:41,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fe5390e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:13:41, skipping insertion in model container [2020-07-01 13:13:41,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:41,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:40" (5/5) ... [2020-07-01 13:13:41,007 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:13:41,030 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:13:41,030 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:13:41,030 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:13:41,031 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:13:41,031 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:13:41,031 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:13:41,031 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:13:41,031 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:13:41,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-07-01 13:13:41,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:13:41,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:13:41,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:13:41,048 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:41,048 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:41,048 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:13:41,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-07-01 13:13:41,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:13:41,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:13:41,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:13:41,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:41,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:41,056 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [136] 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] 13#L-1true [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (> |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc10.offset_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 53#L31true [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 15#L32true [264] L32-->L33: Formula: (and (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 34#L33true [141] L33-->L33-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 31#L33-1true [210] L33-1-->L33-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem13_3|) |v_ULTIMATE.start_main_#t~short15_2|) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 28#L33-2true [132] L33-2-->L33-6: Formula: (not |v_ULTIMATE.start_main_#t~short15_5|) InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_5|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_5|} AuxVars[] AssignedVars[] 7#L33-6true [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 21#L19-4true [2020-07-01 13:13:41,057 INFO L796 eck$LassoCheckResult]: Loop: 21#L19-4true [120] L19-4-->L18-1: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 8#L18-1true [95] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 5#L18-2true [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 27#L19true [128] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 25#L19-1true [125] L19-1-->L19-2: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 23#L19-2true [180] L19-2-->L22: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 32#L22true [138] L22-->L22-1: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_gcd_~y2.base_12) 1) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_9) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_gcd_~y2.base_12)) (= (select (select |v_#memory_int_15| v_ULTIMATE.start_gcd_~y2.base_12) v_ULTIMATE.start_gcd_~y2.offset_9) |v_ULTIMATE.start_gcd_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 29#L22-1true [133] L22-1-->L22-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_11) (= 1 (select |v_#valid_30| v_ULTIMATE.start_gcd_~y1.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_gcd_~y1.base_15) v_ULTIMATE.start_gcd_~y1.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_11 4) (select |v_#length_28| v_ULTIMATE.start_gcd_~y1.base_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 12#L22-2true [270] L22-2-->L19-4: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18 (store (select |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18) v_ULTIMATE.start_gcd_~y2.offset_13 (+ |v_ULTIMATE.start_gcd_#t~mem6_6| (* |v_ULTIMATE.start_gcd_#t~mem7_6| (- 1))))) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_13 4) (select |v_#length_39| v_ULTIMATE.start_gcd_~y2.base_18)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_13) (= 1 (select |v_#valid_48| v_ULTIMATE.start_gcd_~y2.base_18))) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, #memory_int] 21#L19-4true [2020-07-01 13:13:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 331327644, now seen corresponding path program 1 times [2020-07-01 13:13:41,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:41,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183994110] [2020-07-01 13:13:41,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:41,074 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 13:13:41,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183994110] [2020-07-01 13:13:41,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:41,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:41,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417726516] [2020-07-01 13:13:41,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:13:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 880923897, now seen corresponding path program 1 times [2020-07-01 13:13:41,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:41,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127592020] [2020-07-01 13:13:41,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:41,124 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 13:13:41,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127592020] [2020-07-01 13:13:41,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:41,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 13:13:41,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701464495] [2020-07-01 13:13:41,126 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:13:41,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:41,128 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-07-01 13:13:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:41,207 INFO L93 Difference]: Finished difference Result 53 states and 88 transitions. [2020-07-01 13:13:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:41,209 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 13:13:41,214 INFO L168 Benchmark]: Toolchain (without parser) took 3547.04 ms. Allocated memory was 649.6 MB in the beginning and 757.1 MB in the end (delta: 107.5 MB). Free memory was 555.9 MB in the beginning and 570.2 MB in the end (delta: -14.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,214 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:13:41,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.41 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 555.9 MB in the beginning and 654.3 MB in the end (delta: -98.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 692.6 MB. Free memory was 654.3 MB in the beginning and 652.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,216 INFO L168 Benchmark]: Boogie Preprocessor took 25.05 ms. Allocated memory is still 692.6 MB. Free memory was 652.1 MB in the beginning and 651.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,217 INFO L168 Benchmark]: RCFGBuilder took 410.40 ms. Allocated memory is still 692.6 MB. Free memory was 651.0 MB in the beginning and 622.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,217 INFO L168 Benchmark]: BlockEncodingV2 took 141.24 ms. Allocated memory is still 692.6 MB. Free memory was 622.1 MB in the beginning and 610.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,218 INFO L168 Benchmark]: TraceAbstraction took 2392.47 ms. Allocated memory was 692.6 MB in the beginning and 757.1 MB in the end (delta: 64.5 MB). Free memory was 610.2 MB in the beginning and 600.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 73.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,218 INFO L168 Benchmark]: BuchiAutomizer took 213.44 ms. Allocated memory is still 757.1 MB. Free memory was 600.9 MB in the beginning and 570.2 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:41,221 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 63 locations, 67 edges - StatisticsResult: Encoded RCFG 53 locations, 91 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 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 317.41 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 555.9 MB in the beginning and 654.3 MB in the end (delta: -98.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 692.6 MB. Free memory was 654.3 MB in the beginning and 652.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.05 ms. Allocated memory is still 692.6 MB. Free memory was 652.1 MB in the beginning and 651.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 410.40 ms. Allocated memory is still 692.6 MB. Free memory was 651.0 MB in the beginning and 622.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 141.24 ms. Allocated memory is still 692.6 MB. Free memory was 622.1 MB in the beginning and 610.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2392.47 ms. Allocated memory was 692.6 MB in the beginning and 757.1 MB in the end (delta: 64.5 MB). Free memory was 610.2 MB in the beginning and 600.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 73.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 213.44 ms. Allocated memory is still 757.1 MB. Free memory was 600.9 MB in the beginning and 570.2 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: 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: 22]: 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: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: 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: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-07-01 13:13:41,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:41,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:41,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:41,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((\valid[y1] == 1 && 1 <= unknown-#StackHeapBarrier-unknown) && 4 == unknown-#length-unknown[y2]) && 1 == \valid[y2]) && 4 == unknown-#length-unknown[y1]) && 0 == y1) && y2 == 0) && 1 == \valid[y2]) && 0 == y1) && 0 == y2) && 1 == \valid[y1]) && 4 <= unknown-#length-unknown[y1]) && 4 == unknown-#length-unknown[y2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 128 SDtfs, 946 SDslu, 100 SDs, 0 SdLazy, 836 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 56 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 3742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 13:13:34.403 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp/BenchExec_run_wDdhXe/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:13:41.459 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check