java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 11:45:02,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 11:45:02,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 11:45:02,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 11:45:02,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 11:45:02,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 11:45:02,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 11:45:02,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 11:45:02,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 11:45:02,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 11:45:02,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 11:45:02,489 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 11:45:02,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 11:45:02,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 11:45:02,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 11:45:02,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 11:45:02,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 11:45:02,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 11:45:02,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 11:45:02,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 11:45:02,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 11:45:02,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 11:45:02,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 11:45:02,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 11:45:02,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 11:45:02,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 11:45:02,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 11:45:02,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 11:45:02,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 11:45:02,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 11:45:02,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 11:45:02,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 11:45:02,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 11:45:02,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 11:45:02,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 11:45:02,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 11:45:02,530 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 11:45:02,558 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 11:45:02,558 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 11:45:02,559 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 11:45:02,559 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 11:45:02,560 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 11:45:02,560 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 11:45:02,560 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 11:45:02,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 11:45:02,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 11:45:02,561 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 11:45:02,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 11:45:02,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 11:45:02,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 11:45:02,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 11:45:02,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 11:45:02,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 11:45:02,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 11:45:02,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 11:45:02,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 11:45:02,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 11:45:02,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 11:45:02,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 11:45:02,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 11:45:02,563 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 11:45:02,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 11:45:02,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 11:45:02,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 11:45:02,564 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 11:45:02,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 11:45:02,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 11:45:02,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 11:45:02,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 11:45:02,631 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 11:45:02,632 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-24 11:45:02,700 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6fa0ec434/d76194231f06478b951a0d1caf2fb598/FLAGde24c5cd3 [2018-10-24 11:45:03,126 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 11:45:03,127 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-24 11:45:03,133 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6fa0ec434/d76194231f06478b951a0d1caf2fb598/FLAGde24c5cd3 [2018-10-24 11:45:03,153 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6fa0ec434/d76194231f06478b951a0d1caf2fb598 [2018-10-24 11:45:03,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 11:45:03,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 11:45:03,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 11:45:03,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 11:45:03,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 11:45:03,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6895558e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03, skipping insertion in model container [2018-10-24 11:45:03,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 11:45:03,220 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 11:45:03,452 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:45:03,456 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 11:45:03,482 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:45:03,503 INFO L193 MainTranslator]: Completed translation [2018-10-24 11:45:03,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03 WrapperNode [2018-10-24 11:45:03,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 11:45:03,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 11:45:03,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 11:45:03,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 11:45:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 11:45:03,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 11:45:03,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 11:45:03,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 11:45:03,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... [2018-10-24 11:45:03,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 11:45:03,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 11:45:03,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 11:45:03,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 11:45:03,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 11:45:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-24 11:45:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 11:45:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 11:45:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-24 11:45:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-24 11:45:04,175 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 11:45:04,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:04 BoogieIcfgContainer [2018-10-24 11:45:04,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 11:45:04,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 11:45:04,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 11:45:04,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 11:45:04,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:03" (1/3) ... [2018-10-24 11:45:04,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12042527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:04, skipping insertion in model container [2018-10-24 11:45:04,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:03" (2/3) ... [2018-10-24 11:45:04,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12042527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:04, skipping insertion in model container [2018-10-24 11:45:04,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:04" (3/3) ... [2018-10-24 11:45:04,186 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-24 11:45:04,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 11:45:04,209 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 11:45:04,233 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 11:45:04,273 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 11:45:04,274 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 11:45:04,274 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 11:45:04,274 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 11:45:04,274 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 11:45:04,275 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 11:45:04,276 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 11:45:04,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 11:45:04,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 11:45:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-24 11:45:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-24 11:45:04,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:04,304 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:04,307 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:04,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash -44354441, now seen corresponding path program 1 times [2018-10-24 11:45:04,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:04,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:04,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:04,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:04,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 11:45:04,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 11:45:04,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 11:45:04,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 11:45:04,469 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-10-24 11:45:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:04,489 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-10-24 11:45:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 11:45:04,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-24 11:45:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:04,502 INFO L225 Difference]: With dead ends: 70 [2018-10-24 11:45:04,502 INFO L226 Difference]: Without dead ends: 30 [2018-10-24 11:45:04,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 11:45:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-24 11:45:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-24 11:45:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-24 11:45:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-24 11:45:04,539 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2018-10-24 11:45:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:04,539 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-24 11:45:04,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 11:45:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-24 11:45:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-24 11:45:04,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:04,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:04,541 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:04,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash 539359342, now seen corresponding path program 1 times [2018-10-24 11:45:04,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:04,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:04,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:04,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:04,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:45:04,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:45:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:45:04,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:45:04,757 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-10-24 11:45:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:05,007 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-24 11:45:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 11:45:05,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-24 11:45:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:05,009 INFO L225 Difference]: With dead ends: 60 [2018-10-24 11:45:05,010 INFO L226 Difference]: Without dead ends: 47 [2018-10-24 11:45:05,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-24 11:45:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-24 11:45:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-24 11:45:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-10-24 11:45:05,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2018-10-24 11:45:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:05,017 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-10-24 11:45:05,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:45:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-10-24 11:45:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 11:45:05,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:05,019 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:05,019 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:05,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash -713539364, now seen corresponding path program 1 times [2018-10-24 11:45:05,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:05,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:05,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:45:05,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:45:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:45:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:45:05,109 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2018-10-24 11:45:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:05,514 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-10-24 11:45:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 11:45:05,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-24 11:45:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:05,517 INFO L225 Difference]: With dead ends: 88 [2018-10-24 11:45:05,517 INFO L226 Difference]: Without dead ends: 60 [2018-10-24 11:45:05,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 11:45:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-24 11:45:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-10-24 11:45:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 11:45:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-24 11:45:05,525 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-10-24 11:45:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:05,526 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-24 11:45:05,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:45:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-24 11:45:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 11:45:05,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:05,527 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:05,527 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:05,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 199031775, now seen corresponding path program 1 times [2018-10-24 11:45:05,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:05,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:05,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:05,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:05,898 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-10-24 11:45:06,423 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-10-24 11:45:06,680 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-24 11:45:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:06,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:06,834 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:06,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:07,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:45:07,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:07,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:45:07,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:07,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:07,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:07,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 11:45:07,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 11:45:07,837 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:07,839 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:07,839 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:07,841 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:07,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 11:45:07,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:07,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:07,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:07,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 11:45:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:07,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:07,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-10-24 11:45:07,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 11:45:07,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 11:45:07,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-24 11:45:07,936 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-10-24 11:45:08,439 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-24 11:45:09,061 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-10-24 11:45:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:09,647 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-10-24 11:45:09,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 11:45:09,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-10-24 11:45:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:09,652 INFO L225 Difference]: With dead ends: 144 [2018-10-24 11:45:09,652 INFO L226 Difference]: Without dead ends: 113 [2018-10-24 11:45:09,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 11:45:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-24 11:45:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2018-10-24 11:45:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-24 11:45:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-10-24 11:45:09,665 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 24 [2018-10-24 11:45:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:09,665 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-10-24 11:45:09,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 11:45:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-10-24 11:45:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-24 11:45:09,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:09,667 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:09,667 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:09,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash 739171567, now seen corresponding path program 1 times [2018-10-24 11:45:09,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:09,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:09,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:09,911 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:09,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:09,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:10,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-24 11:45:10,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 11:45:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 11:45:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-24 11:45:10,035 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 8 states. [2018-10-24 11:45:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:10,243 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-10-24 11:45:10,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 11:45:10,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-24 11:45:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:10,245 INFO L225 Difference]: With dead ends: 108 [2018-10-24 11:45:10,245 INFO L226 Difference]: Without dead ends: 87 [2018-10-24 11:45:10,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-24 11:45:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-24 11:45:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2018-10-24 11:45:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-24 11:45:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-10-24 11:45:10,258 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2018-10-24 11:45:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:10,258 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-10-24 11:45:10,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 11:45:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-10-24 11:45:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 11:45:10,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:10,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:10,262 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:10,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 20598919, now seen corresponding path program 1 times [2018-10-24 11:45:10,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:10,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:10,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:11,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:11,146 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:11,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:11,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:11,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:45:11,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:11,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:45:11,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:11,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:11,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:11,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:45:12,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:12,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 11:45:12,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:12,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:12,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:12,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-10-24 11:45:12,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:12,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:12,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:12,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-24 11:45:12,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-24 11:45:12,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:12,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:12,333 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:12,333 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:12,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:12,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-10-24 11:45:12,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:12,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:12,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:12,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:45:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:12,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-10-24 11:45:12,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:45:12,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:45:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:45:12,407 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 33 states. [2018-10-24 11:45:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:14,498 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2018-10-24 11:45:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 11:45:14,499 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-10-24 11:45:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:14,501 INFO L225 Difference]: With dead ends: 143 [2018-10-24 11:45:14,501 INFO L226 Difference]: Without dead ends: 78 [2018-10-24 11:45:14,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=334, Invalid=2018, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 11:45:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-24 11:45:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2018-10-24 11:45:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-24 11:45:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-24 11:45:14,518 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 33 [2018-10-24 11:45:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:14,520 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-24 11:45:14,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:45:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-10-24 11:45:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 11:45:14,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:14,521 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:14,522 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:14,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash -302162480, now seen corresponding path program 2 times [2018-10-24 11:45:14,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:14,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:14,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:14,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:15,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:15,196 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:15,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:15,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:15,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:15,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:15,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:45:15,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:15,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:45:15,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-24 11:45:15,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 11:45:15,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:15,645 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:15,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:15,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 11:45:15,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:15,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-24 11:45:15,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:45:15,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:45:15,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:15,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:15,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:15,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 21 [2018-10-24 11:45:15,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 11:45:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 11:45:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-24 11:45:15,912 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2018-10-24 11:45:17,266 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-10-24 11:45:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:17,425 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-10-24 11:45:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-24 11:45:17,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-10-24 11:45:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:17,428 INFO L225 Difference]: With dead ends: 196 [2018-10-24 11:45:17,428 INFO L226 Difference]: Without dead ends: 165 [2018-10-24 11:45:17,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 11:45:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-24 11:45:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 88. [2018-10-24 11:45:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-24 11:45:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-10-24 11:45:17,441 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 36 [2018-10-24 11:45:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:17,441 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-10-24 11:45:17,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 11:45:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-10-24 11:45:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-24 11:45:17,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:17,443 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:17,443 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:17,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1890237920, now seen corresponding path program 2 times [2018-10-24 11:45:17,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:17,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:17,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:17,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:17,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:17,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:17,926 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:17,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:17,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:17,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:18,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-24 11:45:18,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:18,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-24 11:45:18,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:18,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:18,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:18,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-24 11:45:18,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:45:18,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:45:18,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:18,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:18,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:18,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-24 11:45:18,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 11:45:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 11:45:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-10-24 11:45:18,625 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 29 states. [2018-10-24 11:45:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:20,211 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2018-10-24 11:45:20,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 11:45:20,211 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-24 11:45:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:20,213 INFO L225 Difference]: With dead ends: 224 [2018-10-24 11:45:20,213 INFO L226 Difference]: Without dead ends: 193 [2018-10-24 11:45:20,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-10-24 11:45:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-24 11:45:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 120. [2018-10-24 11:45:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-24 11:45:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-10-24 11:45:20,231 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 44 [2018-10-24 11:45:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:20,232 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-10-24 11:45:20,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 11:45:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-10-24 11:45:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 11:45:20,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:20,238 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:20,238 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:20,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1140389496, now seen corresponding path program 2 times [2018-10-24 11:45:20,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:20,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:20,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:21,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:21,539 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:21,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:21,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:21,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:21,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:21,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:45:21,824 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:21,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:21,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-24 11:45:21,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:21,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:21,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:21,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:49 [2018-10-24 11:45:22,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-24 11:45:22,029 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:22,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-24 11:45:22,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2018-10-24 11:45:22,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-24 11:45:22,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-24 11:45:22,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:22,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-10-24 11:45:22,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 11:45:22,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:22,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 11:45:22,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:22,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:45:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:22,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 31 [2018-10-24 11:45:22,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 11:45:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 11:45:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-10-24 11:45:22,321 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 31 states. [2018-10-24 11:45:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:24,281 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-10-24 11:45:24,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-24 11:45:24,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-24 11:45:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:24,283 INFO L225 Difference]: With dead ends: 209 [2018-10-24 11:45:24,283 INFO L226 Difference]: Without dead ends: 207 [2018-10-24 11:45:24,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=412, Invalid=2780, Unknown=0, NotChecked=0, Total=3192 [2018-10-24 11:45:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-24 11:45:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 97. [2018-10-24 11:45:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-24 11:45:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-10-24 11:45:24,296 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 45 [2018-10-24 11:45:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:24,297 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-10-24 11:45:24,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 11:45:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-10-24 11:45:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 11:45:24,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:24,299 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:24,299 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:24,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1343917494, now seen corresponding path program 3 times [2018-10-24 11:45:24,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:24,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:24,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:24,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:24,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:24,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:24,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:45:24,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 11:45:24,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:24,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:24,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:24,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-24 11:45:24,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 11:45:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 11:45:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:24,731 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 7 states. [2018-10-24 11:45:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:24,943 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2018-10-24 11:45:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 11:45:24,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-24 11:45:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:24,946 INFO L225 Difference]: With dead ends: 187 [2018-10-24 11:45:24,947 INFO L226 Difference]: Without dead ends: 156 [2018-10-24 11:45:24,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-24 11:45:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-24 11:45:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 108. [2018-10-24 11:45:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-24 11:45:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-10-24 11:45:24,960 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 45 [2018-10-24 11:45:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:24,960 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-10-24 11:45:24,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 11:45:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-10-24 11:45:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-24 11:45:24,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:24,962 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:24,962 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:24,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1730116153, now seen corresponding path program 1 times [2018-10-24 11:45:24,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:24,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:24,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:25,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:25,529 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:25,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:25,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:45:25,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:25,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:45:25,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:26,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:26,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:26,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 11:45:26,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 11:45:26,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:26,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:26,147 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:26,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:26,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 11:45:26,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:26,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:26,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:26,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 11:45:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-10-24 11:45:26,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-24 11:45:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-24 11:45:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-10-24 11:45:26,218 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 28 states. [2018-10-24 11:45:27,109 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-10-24 11:45:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:27,984 INFO L93 Difference]: Finished difference Result 287 states and 319 transitions. [2018-10-24 11:45:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 11:45:27,984 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-10-24 11:45:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:27,985 INFO L225 Difference]: With dead ends: 287 [2018-10-24 11:45:27,985 INFO L226 Difference]: Without dead ends: 245 [2018-10-24 11:45:27,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=684, Invalid=2622, Unknown=0, NotChecked=0, Total=3306 [2018-10-24 11:45:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-24 11:45:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 121. [2018-10-24 11:45:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-24 11:45:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-10-24 11:45:28,000 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 47 [2018-10-24 11:45:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:28,000 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-10-24 11:45:28,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-24 11:45:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-10-24 11:45:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 11:45:28,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:28,002 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:28,002 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:28,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash -465629712, now seen corresponding path program 3 times [2018-10-24 11:45:28,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:28,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:28,715 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:45:28,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 11:45:28,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:28,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:28,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:28,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-10-24 11:45:28,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 11:45:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 11:45:28,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-24 11:45:28,867 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 11 states. [2018-10-24 11:45:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:29,457 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-10-24 11:45:29,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 11:45:29,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-24 11:45:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:29,459 INFO L225 Difference]: With dead ends: 244 [2018-10-24 11:45:29,459 INFO L226 Difference]: Without dead ends: 215 [2018-10-24 11:45:29,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-24 11:45:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-24 11:45:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 161. [2018-10-24 11:45:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-24 11:45:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2018-10-24 11:45:29,476 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 52 [2018-10-24 11:45:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:29,476 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2018-10-24 11:45:29,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 11:45:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-10-24 11:45:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 11:45:29,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:29,478 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:29,478 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:29,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash -201170615, now seen corresponding path program 1 times [2018-10-24 11:45:29,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:29,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:29,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:30,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:30,464 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:30,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:30,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:30,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:45:30,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:30,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:45:30,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:30,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:30,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:30,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:45:31,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:31,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 11:45:31,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:31,194 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:31,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:31,249 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-10-24 11:45:31,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-10-24 11:45:31,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:31,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:31,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:31,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-24 11:45:31,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-24 11:45:31,461 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:31,463 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:31,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-24 11:45:31,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:31,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:31,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:31,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-24 11:45:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:31,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:31,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-24 11:45:31,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:45:31,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:45:31,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:45:31,529 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand 33 states. [2018-10-24 11:45:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:32,756 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2018-10-24 11:45:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 11:45:32,756 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-10-24 11:45:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:32,758 INFO L225 Difference]: With dead ends: 207 [2018-10-24 11:45:32,758 INFO L226 Difference]: Without dead ends: 190 [2018-10-24 11:45:32,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2018-10-24 11:45:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-24 11:45:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2018-10-24 11:45:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-24 11:45:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2018-10-24 11:45:32,774 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 55 [2018-10-24 11:45:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:32,774 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2018-10-24 11:45:32,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:45:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2018-10-24 11:45:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 11:45:32,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:32,775 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:32,776 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:32,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 934762349, now seen corresponding path program 4 times [2018-10-24 11:45:32,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:32,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:32,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:32,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:32,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:33,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:33,310 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:33,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:45:33,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:45:33,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:33,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:33,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:45:33,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:33,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:45:33,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:33,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:33,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:33,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 11:45:33,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:33,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 11:45:33,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:33,948 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:33,949 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:33,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:33,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-24 11:45:33,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:33,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:33,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:33,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-24 11:45:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-24 11:45:34,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:34,110 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:34,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:34,111 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:34,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:34,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-10-24 11:45:34,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:34,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:34,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:34,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:45:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 11:45:34,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:34,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-10-24 11:45:34,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-24 11:45:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-24 11:45:34,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 11:45:34,191 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 35 states. [2018-10-24 11:45:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:36,018 INFO L93 Difference]: Finished difference Result 366 states and 408 transitions. [2018-10-24 11:45:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-24 11:45:36,018 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2018-10-24 11:45:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:36,020 INFO L225 Difference]: With dead ends: 366 [2018-10-24 11:45:36,020 INFO L226 Difference]: Without dead ends: 269 [2018-10-24 11:45:36,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=614, Invalid=3292, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 11:45:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-24 11:45:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 163. [2018-10-24 11:45:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-24 11:45:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2018-10-24 11:45:36,042 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 56 [2018-10-24 11:45:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:36,042 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2018-10-24 11:45:36,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-24 11:45:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2018-10-24 11:45:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 11:45:36,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:36,043 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:36,044 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:36,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1582841106, now seen corresponding path program 1 times [2018-10-24 11:45:36,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:36,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:36,407 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 11:45:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:37,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:37,322 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:37,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:37,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:37,594 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:37,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-10-24 11:45:37,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:37,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-10-24 11:45:37,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:37,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:38 [2018-10-24 11:45:37,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-24 11:45:37,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 43 [2018-10-24 11:45:37,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-10-24 11:45:37,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 11:45:37,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,769 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 11:45:37,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-24 11:45:37,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:45:37,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:45:37,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 11:45:37,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:37,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 29 [2018-10-24 11:45:37,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 11:45:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 11:45:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-10-24 11:45:37,994 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 29 states. [2018-10-24 11:45:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:39,324 INFO L93 Difference]: Finished difference Result 380 states and 419 transitions. [2018-10-24 11:45:39,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 11:45:39,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-24 11:45:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:39,326 INFO L225 Difference]: With dead ends: 380 [2018-10-24 11:45:39,327 INFO L226 Difference]: Without dead ends: 309 [2018-10-24 11:45:39,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-10-24 11:45:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-24 11:45:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 200. [2018-10-24 11:45:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-24 11:45:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-10-24 11:45:39,349 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 56 [2018-10-24 11:45:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:39,350 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-10-24 11:45:39,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 11:45:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-10-24 11:45:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 11:45:39,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:39,351 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:39,351 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:39,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -741360303, now seen corresponding path program 4 times [2018-10-24 11:45:39,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:39,928 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 5 [2018-10-24 11:45:40,308 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 10 [2018-10-24 11:45:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:40,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:40,733 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:45:40,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:45:40,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:40,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:40,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-24 11:45:40,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 11:45:40,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:40,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:45:41,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:45:41,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:41,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:45:41,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:45:41,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 11:45:41,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:41,384 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:41,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:41,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 11:45:41,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-24 11:45:41,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:45:41,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:45:41,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:41,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:41,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:41,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-10-24 11:45:41,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-24 11:45:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-24 11:45:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 11:45:41,668 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 36 states. [2018-10-24 11:45:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:42,867 INFO L93 Difference]: Finished difference Result 348 states and 385 transitions. [2018-10-24 11:45:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 11:45:42,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-24 11:45:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:42,868 INFO L225 Difference]: With dead ends: 348 [2018-10-24 11:45:42,869 INFO L226 Difference]: Without dead ends: 277 [2018-10-24 11:45:42,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 11:45:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-24 11:45:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 222. [2018-10-24 11:45:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-24 11:45:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-10-24 11:45:42,894 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 56 [2018-10-24 11:45:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:42,895 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-10-24 11:45:42,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-24 11:45:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-10-24 11:45:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-24 11:45:42,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:42,896 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:42,896 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:42,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash -847043286, now seen corresponding path program 2 times [2018-10-24 11:45:42,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:42,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:42,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:42,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:43,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:43,557 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:43,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:43,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:43,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:43,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:43,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-24 11:45:43,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:43,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-10-24 11:45:43,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:43,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:43,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:43,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-24 11:45:44,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 11:45:44,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:44,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 11:45:44,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-10-24 11:45:44,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:45:44,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:45:44,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:44,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:45:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:44,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:44,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-10-24 11:45:44,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 11:45:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 11:45:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-10-24 11:45:44,161 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 29 states. [2018-10-24 11:45:46,982 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-24 11:45:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:48,789 INFO L93 Difference]: Finished difference Result 450 states and 494 transitions. [2018-10-24 11:45:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-24 11:45:48,789 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2018-10-24 11:45:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:48,790 INFO L225 Difference]: With dead ends: 450 [2018-10-24 11:45:48,791 INFO L226 Difference]: Without dead ends: 379 [2018-10-24 11:45:48,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=766, Invalid=3926, Unknown=0, NotChecked=0, Total=4692 [2018-10-24 11:45:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-24 11:45:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 222. [2018-10-24 11:45:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-24 11:45:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-10-24 11:45:48,821 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 59 [2018-10-24 11:45:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:48,822 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-10-24 11:45:48,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 11:45:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-10-24 11:45:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 11:45:48,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:48,824 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:48,824 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:48,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1867762301, now seen corresponding path program 1 times [2018-10-24 11:45:48,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:48,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:48,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:49,382 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-10-24 11:45:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:51,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:51,245 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:51,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:51,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:51,788 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 11:45:51,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:45:51,838 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:51,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:45:51,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:51,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:52,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-24 11:45:52,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-24 11:45:52,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:52,920 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:52,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:52,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:52,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 97 [2018-10-24 11:45:52,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:52,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:52,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:51 [2018-10-24 11:45:53,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-10-24 11:45:53,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,388 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:53,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:53,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 115 [2018-10-24 11:45:53,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:53,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:53,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:45:53,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:44 [2018-10-24 11:45:53,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-10-24 11:45:53,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,712 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:53,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-10-24 11:45:53,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:45:53,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:45:53,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-24 11:45:53,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-10-24 11:45:54,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 11:45:54,163 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:54,164 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:54,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-24 11:45:54,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-10-24 11:45:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 56 [2018-10-24 11:45:54,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-24 11:45:54,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-24 11:45:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2840, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 11:45:54,271 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 56 states. [2018-10-24 11:45:55,182 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 11 [2018-10-24 11:45:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:58,072 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2018-10-24 11:45:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-24 11:45:58,072 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 64 [2018-10-24 11:45:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:58,073 INFO L225 Difference]: With dead ends: 303 [2018-10-24 11:45:58,074 INFO L226 Difference]: Without dead ends: 286 [2018-10-24 11:45:58,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=718, Invalid=6764, Unknown=0, NotChecked=0, Total=7482 [2018-10-24 11:45:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-24 11:45:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 246. [2018-10-24 11:45:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-24 11:45:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2018-10-24 11:45:58,105 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 64 [2018-10-24 11:45:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:58,105 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2018-10-24 11:45:58,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-24 11:45:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2018-10-24 11:45:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 11:45:58,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:58,107 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:45:58,107 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:58,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash 975512830, now seen corresponding path program 1 times [2018-10-24 11:45:58,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:58,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:58,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:59,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:59,245 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:45:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:59,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:59,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-24 11:45:59,402 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:59,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-24 11:45:59,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:59,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:59,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:59,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-24 11:45:59,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-24 11:45:59,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:59,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:59,512 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:59,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-24 11:45:59,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:59,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:59,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:59,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-24 11:45:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 24 [2018-10-24 11:45:59,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-24 11:45:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-24 11:45:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-10-24 11:45:59,567 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand 24 states. [2018-10-24 11:46:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:01,331 INFO L93 Difference]: Finished difference Result 671 states and 740 transitions. [2018-10-24 11:46:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-24 11:46:01,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-10-24 11:46:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:01,335 INFO L225 Difference]: With dead ends: 671 [2018-10-24 11:46:01,335 INFO L226 Difference]: Without dead ends: 579 [2018-10-24 11:46:01,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=529, Invalid=3503, Unknown=0, NotChecked=0, Total=4032 [2018-10-24 11:46:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-24 11:46:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 309. [2018-10-24 11:46:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-24 11:46:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 341 transitions. [2018-10-24 11:46:01,373 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 341 transitions. Word has length 64 [2018-10-24 11:46:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:01,373 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 341 transitions. [2018-10-24 11:46:01,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-24 11:46:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 341 transitions. [2018-10-24 11:46:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 11:46:01,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:01,374 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:01,374 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:01,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2144727967, now seen corresponding path program 5 times [2018-10-24 11:46:01,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:01,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:01,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:01,933 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-24 11:46:02,278 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-10-24 11:46:02,705 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-10-24 11:46:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:03,001 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:03,009 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:46:03,046 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-24 11:46:03,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:03,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:03,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-24 11:46:03,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 11:46:03,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-10-24 11:46:03,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:46:03,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:03,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:46:03,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:03,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-24 11:46:03,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-24 11:46:03,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:03,737 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:03,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:03,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-10-24 11:46:03,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-24 11:46:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:03,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:03,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-24 11:46:03,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 11:46:03,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 11:46:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 11:46:03,821 INFO L87 Difference]: Start difference. First operand 309 states and 341 transitions. Second operand 37 states. [2018-10-24 11:46:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:06,194 INFO L93 Difference]: Finished difference Result 491 states and 538 transitions. [2018-10-24 11:46:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 11:46:06,194 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-24 11:46:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:06,196 INFO L225 Difference]: With dead ends: 491 [2018-10-24 11:46:06,196 INFO L226 Difference]: Without dead ends: 489 [2018-10-24 11:46:06,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=408, Invalid=3498, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 11:46:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-24 11:46:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 350. [2018-10-24 11:46:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-24 11:46:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 387 transitions. [2018-10-24 11:46:06,256 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 387 transitions. Word has length 64 [2018-10-24 11:46:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:06,256 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 387 transitions. [2018-10-24 11:46:06,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 11:46:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 387 transitions. [2018-10-24 11:46:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-24 11:46:06,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:06,257 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:06,258 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:06,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:06,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1112045462, now seen corresponding path program 1 times [2018-10-24 11:46:06,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:06,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:06,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:06,733 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-24 11:46:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:07,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:07,479 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:07,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:07,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:07,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:46:07,747 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:07,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:46:07,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:07,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:07,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:07,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:46:07,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:07,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 11:46:07,972 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:07,974 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:07,975 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:07,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:07,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-24 11:46:07,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:08,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-10-24 11:46:08,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-24 11:46:08,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 87 [2018-10-24 11:46:08,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:08,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-10-24 11:46:08,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-24 11:46:08,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-24 11:46:08,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:08,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-10-24 11:46:08,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-24 11:46:08,507 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:08,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,570 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:08,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:08,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-10-24 11:46:08,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:08,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-24 11:46:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 11:46:08,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:08,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2018-10-24 11:46:08,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-24 11:46:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-24 11:46:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 11:46:08,690 INFO L87 Difference]: Start difference. First operand 350 states and 387 transitions. Second operand 43 states. [2018-10-24 11:46:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:11,575 INFO L93 Difference]: Finished difference Result 603 states and 667 transitions. [2018-10-24 11:46:11,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 11:46:11,575 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 65 [2018-10-24 11:46:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:11,577 INFO L225 Difference]: With dead ends: 603 [2018-10-24 11:46:11,577 INFO L226 Difference]: Without dead ends: 511 [2018-10-24 11:46:11,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=625, Invalid=4925, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 11:46:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-24 11:46:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 321. [2018-10-24 11:46:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-24 11:46:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 354 transitions. [2018-10-24 11:46:11,632 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 354 transitions. Word has length 65 [2018-10-24 11:46:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:11,632 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 354 transitions. [2018-10-24 11:46:11,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-24 11:46:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 354 transitions. [2018-10-24 11:46:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-24 11:46:11,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:11,633 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:11,633 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:11,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1242756520, now seen corresponding path program 2 times [2018-10-24 11:46:11,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:11,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:11,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 11:46:11,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:11,821 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:11,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:11,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:11,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:11,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 11:46:11,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:11,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-24 11:46:11,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 11:46:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 11:46:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 11:46:11,876 INFO L87 Difference]: Start difference. First operand 321 states and 354 transitions. Second operand 6 states. [2018-10-24 11:46:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:12,078 INFO L93 Difference]: Finished difference Result 488 states and 538 transitions. [2018-10-24 11:46:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 11:46:12,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-24 11:46:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:12,082 INFO L225 Difference]: With dead ends: 488 [2018-10-24 11:46:12,082 INFO L226 Difference]: Without dead ends: 396 [2018-10-24 11:46:12,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 11:46:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-24 11:46:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 306. [2018-10-24 11:46:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-24 11:46:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 335 transitions. [2018-10-24 11:46:12,135 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 335 transitions. Word has length 65 [2018-10-24 11:46:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:12,135 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 335 transitions. [2018-10-24 11:46:12,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 11:46:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 335 transitions. [2018-10-24 11:46:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 11:46:12,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:12,137 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:12,137 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:12,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1300794170, now seen corresponding path program 2 times [2018-10-24 11:46:12,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:12,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:12,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:12,803 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 11:46:13,035 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-24 11:46:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:13,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:13,641 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:13,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:13,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:13,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:13,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:13,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:46:13,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:13,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:46:13,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:13,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:46:14,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-24 11:46:14,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,281 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:14,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-24 11:46:14,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-24 11:46:14,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-24 11:46:14,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-10-24 11:46:14,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-24 11:46:14,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 11:46:14,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:14,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 11:46:14,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:14,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:46:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:14,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:14,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-10-24 11:46:14,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-24 11:46:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-24 11:46:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 11:46:14,765 INFO L87 Difference]: Start difference. First operand 306 states and 335 transitions. Second operand 44 states. [2018-10-24 11:46:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:16,323 INFO L93 Difference]: Finished difference Result 386 states and 419 transitions. [2018-10-24 11:46:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-24 11:46:16,324 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 67 [2018-10-24 11:46:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:16,326 INFO L225 Difference]: With dead ends: 386 [2018-10-24 11:46:16,326 INFO L226 Difference]: Without dead ends: 384 [2018-10-24 11:46:16,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=401, Invalid=3505, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 11:46:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-24 11:46:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2018-10-24 11:46:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-24 11:46:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 328 transitions. [2018-10-24 11:46:16,377 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 328 transitions. Word has length 67 [2018-10-24 11:46:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:16,377 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 328 transitions. [2018-10-24 11:46:16,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-24 11:46:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 328 transitions. [2018-10-24 11:46:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-24 11:46:16,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:16,379 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:16,379 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:16,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 47502430, now seen corresponding path program 5 times [2018-10-24 11:46:16,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:16,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:16,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:16,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:16,572 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 11:46:16,796 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2018-10-24 11:46:17,074 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2018-10-24 11:46:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:17,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:17,816 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:46:17,867 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-24 11:46:17,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:17,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:18,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:46:18,091 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:18,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-24 11:46:18,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-24 11:46:18,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-24 11:46:18,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,209 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-24 11:46:18,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:18,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2018-10-24 11:46:18,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-24 11:46:18,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,297 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-24 11:46:18,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-10-24 11:46:18,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 11:46:18,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:18,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 11:46:18,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:18,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:46:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 11:46:18,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:18,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-10-24 11:46:18,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 11:46:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 11:46:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:46:18,440 INFO L87 Difference]: Start difference. First operand 299 states and 328 transitions. Second operand 33 states. [2018-10-24 11:46:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:21,488 INFO L93 Difference]: Finished difference Result 521 states and 567 transitions. [2018-10-24 11:46:21,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-24 11:46:21,488 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2018-10-24 11:46:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:21,490 INFO L225 Difference]: With dead ends: 521 [2018-10-24 11:46:21,490 INFO L226 Difference]: Without dead ends: 445 [2018-10-24 11:46:21,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=994, Invalid=4706, Unknown=0, NotChecked=0, Total=5700 [2018-10-24 11:46:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-24 11:46:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 267. [2018-10-24 11:46:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-24 11:46:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 289 transitions. [2018-10-24 11:46:21,537 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 289 transitions. Word has length 68 [2018-10-24 11:46:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:21,537 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 289 transitions. [2018-10-24 11:46:21,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 11:46:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 289 transitions. [2018-10-24 11:46:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 11:46:21,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:21,538 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:21,538 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:21,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2087155470, now seen corresponding path program 2 times [2018-10-24 11:46:21,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:21,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:21,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:21,990 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 11:46:22,272 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-24 11:46:22,604 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-10-24 11:46:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:22,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:22,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:22,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:22,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:22,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:22,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:22,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-24 11:46:22,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:22,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-10-24 11:46:22,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:23,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-10-24 11:46:23,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-24 11:46:23,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:23,379 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:23,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-24 11:46:23,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:23,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-24 11:46:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:23,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:23,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-10-24 11:46:23,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 11:46:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 11:46:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2018-10-24 11:46:23,463 INFO L87 Difference]: Start difference. First operand 267 states and 289 transitions. Second operand 31 states. [2018-10-24 11:46:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:25,027 INFO L93 Difference]: Finished difference Result 408 states and 434 transitions. [2018-10-24 11:46:25,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-24 11:46:25,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-10-24 11:46:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:25,029 INFO L225 Difference]: With dead ends: 408 [2018-10-24 11:46:25,029 INFO L226 Difference]: Without dead ends: 406 [2018-10-24 11:46:25,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=2324, Unknown=0, NotChecked=0, Total=2652 [2018-10-24 11:46:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-24 11:46:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 263. [2018-10-24 11:46:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-24 11:46:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 284 transitions. [2018-10-24 11:46:25,066 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 284 transitions. Word has length 72 [2018-10-24 11:46:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:25,066 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 284 transitions. [2018-10-24 11:46:25,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 11:46:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 284 transitions. [2018-10-24 11:46:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 11:46:25,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:25,067 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:25,067 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:25,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1794356367, now seen corresponding path program 6 times [2018-10-24 11:46:25,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:25,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:25,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:25,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:25,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:26,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:26,136 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:26,143 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-24 11:46:26,183 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-24 11:46:26,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:26,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-24 11:46:26,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 11:46:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 11:46:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-24 11:46:26,289 INFO L87 Difference]: Start difference. First operand 263 states and 284 transitions. Second operand 14 states. [2018-10-24 11:46:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:26,715 INFO L93 Difference]: Finished difference Result 391 states and 418 transitions. [2018-10-24 11:46:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 11:46:26,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-24 11:46:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:26,717 INFO L225 Difference]: With dead ends: 391 [2018-10-24 11:46:26,717 INFO L226 Difference]: Without dead ends: 354 [2018-10-24 11:46:26,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-10-24 11:46:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-24 11:46:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 277. [2018-10-24 11:46:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-24 11:46:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 298 transitions. [2018-10-24 11:46:26,774 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 298 transitions. Word has length 72 [2018-10-24 11:46:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:26,774 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 298 transitions. [2018-10-24 11:46:26,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 11:46:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 298 transitions. [2018-10-24 11:46:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-24 11:46:26,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:26,776 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:26,776 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:26,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -622242011, now seen corresponding path program 2 times [2018-10-24 11:46:26,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:26,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:26,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:28,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:28,989 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:28,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:29,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:29,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:29,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:29,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:46:29,259 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:29,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-24 11:46:29,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-24 11:46:29,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-24 11:46:29,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,533 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:29,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-24 11:46:29,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-24 11:46:29,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-24 11:46:29,677 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:29,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:29,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 106 [2018-10-24 11:46:29,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:29,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-24 11:46:30,119 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-10-24 11:46:30,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,132 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:30,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:30,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 191 [2018-10-24 11:46:30,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:46:30,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:30,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:30,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-10-24 11:46:30,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-10-24 11:46:30,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,474 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 161 [2018-10-24 11:46:30,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 11:46:30,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:46:30,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-24 11:46:30,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-10-24 11:46:30,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 11:46:30,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:30,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 11:46:30,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:30,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:30,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:30,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:46:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:30,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 57 [2018-10-24 11:46:30,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-24 11:46:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-24 11:46:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2840, Unknown=0, NotChecked=0, Total=3192 [2018-10-24 11:46:30,914 INFO L87 Difference]: Start difference. First operand 277 states and 298 transitions. Second operand 57 states. [2018-10-24 11:46:31,523 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-10-24 11:46:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:34,931 INFO L93 Difference]: Finished difference Result 342 states and 365 transitions. [2018-10-24 11:46:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-24 11:46:34,931 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 73 [2018-10-24 11:46:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:34,933 INFO L225 Difference]: With dead ends: 342 [2018-10-24 11:46:34,933 INFO L226 Difference]: Without dead ends: 325 [2018-10-24 11:46:34,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 44 SyntacticMatches, 17 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=931, Invalid=7811, Unknown=0, NotChecked=0, Total=8742 [2018-10-24 11:46:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-24 11:46:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 241. [2018-10-24 11:46:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-24 11:46:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 259 transitions. [2018-10-24 11:46:34,975 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 259 transitions. Word has length 73 [2018-10-24 11:46:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:34,975 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 259 transitions. [2018-10-24 11:46:34,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-24 11:46:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 259 transitions. [2018-10-24 11:46:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-24 11:46:34,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:34,976 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:34,976 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:34,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1163723925, now seen corresponding path program 1 times [2018-10-24 11:46:34,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:34,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:34,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:34,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:35,279 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 11:46:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:35,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:35,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:35,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:35,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:46:35,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:35,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:46:35,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:35,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:35,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:35,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-24 11:46:35,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:35,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-24 11:46:35,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:36,002 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:36,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-24 11:46:36,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:36,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:36,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:36,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2018-10-24 11:46:36,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-24 11:46:36,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:36,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:36,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:36,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:36,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:36,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-24 11:46:36,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:36,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:36,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:36,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-24 11:46:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:36,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:36,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 35 [2018-10-24 11:46:36,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-24 11:46:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-24 11:46:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 11:46:36,194 INFO L87 Difference]: Start difference. First operand 241 states and 259 transitions. Second operand 35 states. [2018-10-24 11:46:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:40,519 INFO L93 Difference]: Finished difference Result 356 states and 378 transitions. [2018-10-24 11:46:40,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-24 11:46:40,519 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-10-24 11:46:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:40,520 INFO L225 Difference]: With dead ends: 356 [2018-10-24 11:46:40,520 INFO L226 Difference]: Without dead ends: 354 [2018-10-24 11:46:40,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1035, Invalid=10307, Unknown=0, NotChecked=0, Total=11342 [2018-10-24 11:46:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-24 11:46:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 254. [2018-10-24 11:46:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-24 11:46:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 273 transitions. [2018-10-24 11:46:40,579 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 273 transitions. Word has length 75 [2018-10-24 11:46:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:40,579 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 273 transitions. [2018-10-24 11:46:40,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-24 11:46:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 273 transitions. [2018-10-24 11:46:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 11:46:40,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:40,580 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:40,580 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:40,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2019441042, now seen corresponding path program 3 times [2018-10-24 11:46:40,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:40,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:40,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:40,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:41,140 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-10-24 11:46:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:43,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:43,312 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:43,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:46:43,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-24 11:46:43,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:43,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:43,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:46:43,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:46:43,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:43,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:43,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:43,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-24 11:46:43,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-24 11:46:43,555 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-10-24 11:46:43,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:43,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:43,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:43,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-10-24 11:46:43,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-10-24 11:46:43,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,884 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,890 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:43,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 148 [2018-10-24 11:46:43,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-24 11:46:44,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:46:44,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:46:44,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:116 [2018-10-24 11:46:44,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-10-24 11:46:44,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,534 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:44,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-10-24 11:46:44,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:44,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2018-10-24 11:46:44,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-24 11:46:44,654 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:44,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-10-24 11:46:44,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-24 11:46:44,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:46:44,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:46:44,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:44,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:44,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:44,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 48 [2018-10-24 11:46:44,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-24 11:46:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-24 11:46:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2018-10-24 11:46:44,955 INFO L87 Difference]: Start difference. First operand 254 states and 273 transitions. Second operand 48 states. [2018-10-24 11:46:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:49,010 INFO L93 Difference]: Finished difference Result 369 states and 395 transitions. [2018-10-24 11:46:49,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-24 11:46:49,010 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 76 [2018-10-24 11:46:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:49,011 INFO L225 Difference]: With dead ends: 369 [2018-10-24 11:46:49,011 INFO L226 Difference]: Without dead ends: 352 [2018-10-24 11:46:49,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 24 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=623, Invalid=6019, Unknown=0, NotChecked=0, Total=6642 [2018-10-24 11:46:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-24 11:46:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-10-24 11:46:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-24 11:46:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 307 transitions. [2018-10-24 11:46:49,060 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 307 transitions. Word has length 76 [2018-10-24 11:46:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:49,060 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 307 transitions. [2018-10-24 11:46:49,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-24 11:46:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 307 transitions. [2018-10-24 11:46:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 11:46:49,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:49,061 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:49,061 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:49,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash -515741841, now seen corresponding path program 3 times [2018-10-24 11:46:49,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:49,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:50,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:50,114 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:46:50,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-24 11:46:50,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:50,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:50,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:46:50,490 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:50,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:46:50,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:50,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-10-24 11:46:50,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-24 11:46:50,646 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:50,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:50,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:50,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-10-24 11:46:50,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:50,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:30 [2018-10-24 11:46:50,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-24 11:46:50,879 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:50,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:50,880 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:50,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-10-24 11:46:50,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:50,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-24 11:46:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-10-24 11:46:50,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 11:46:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 11:46:50,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 11:46:50,966 INFO L87 Difference]: Start difference. First operand 286 states and 307 transitions. Second operand 37 states. [2018-10-24 11:46:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:53,736 INFO L93 Difference]: Finished difference Result 434 states and 463 transitions. [2018-10-24 11:46:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 11:46:53,736 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2018-10-24 11:46:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:53,738 INFO L225 Difference]: With dead ends: 434 [2018-10-24 11:46:53,738 INFO L226 Difference]: Without dead ends: 432 [2018-10-24 11:46:53,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=501, Invalid=3405, Unknown=0, NotChecked=0, Total=3906 [2018-10-24 11:46:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-24 11:46:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 310. [2018-10-24 11:46:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-24 11:46:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 334 transitions. [2018-10-24 11:46:53,806 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 334 transitions. Word has length 76 [2018-10-24 11:46:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:53,806 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 334 transitions. [2018-10-24 11:46:53,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 11:46:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 334 transitions. [2018-10-24 11:46:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 11:46:53,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:53,807 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:53,807 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:53,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1889992209, now seen corresponding path program 4 times [2018-10-24 11:46:53,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:53,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:54,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:54,712 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:54,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:46:54,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:46:54,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:54,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:54,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-24 11:46:54,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 11:46:54,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:54,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:54,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:54,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:46:55,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:46:55,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 11:46:55,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:46:55,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 11:46:55,212 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 11:46:55,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-10-24 11:46:55,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 11:46:55,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:55,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 11:46:55,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-24 11:46:55,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:46:55,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 11:46:55,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:55,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 11:46:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:55,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:55,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-10-24 11:46:55,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-24 11:46:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-24 11:46:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 11:46:55,673 INFO L87 Difference]: Start difference. First operand 310 states and 334 transitions. Second operand 43 states. [2018-10-24 11:46:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:58,792 INFO L93 Difference]: Finished difference Result 611 states and 658 transitions. [2018-10-24 11:46:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-24 11:46:58,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 76 [2018-10-24 11:46:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:58,794 INFO L225 Difference]: With dead ends: 611 [2018-10-24 11:46:58,794 INFO L226 Difference]: Without dead ends: 554 [2018-10-24 11:46:58,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=935, Invalid=7075, Unknown=0, NotChecked=0, Total=8010 [2018-10-24 11:46:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-24 11:46:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 318. [2018-10-24 11:46:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-24 11:46:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 343 transitions. [2018-10-24 11:46:58,849 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 343 transitions. Word has length 76 [2018-10-24 11:46:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:58,850 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 343 transitions. [2018-10-24 11:46:58,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-24 11:46:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 343 transitions. [2018-10-24 11:46:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 11:46:58,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:58,851 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:58,851 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:58,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -715265710, now seen corresponding path program 7 times [2018-10-24 11:46:58,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:58,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:58,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:46:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:46:59,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:59,637 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:59,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:59,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:59,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-24 11:46:59,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 11:46:59,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-24 11:46:59,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-24 11:46:59,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-10-24 11:46:59,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-24 11:46:59,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-24 11:46:59,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,867 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-10-24 11:46:59,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:59,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-24 11:46:59,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-24 11:46:59,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,996 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:59,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:59,997 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:00,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2018-10-24 11:47:00,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:00,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:00,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:00,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-24 11:47:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:47:00,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:00,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2018-10-24 11:47:00,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 11:47:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 11:47:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-24 11:47:00,072 INFO L87 Difference]: Start difference. First operand 318 states and 343 transitions. Second operand 27 states. [2018-10-24 11:47:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:01,664 INFO L93 Difference]: Finished difference Result 449 states and 480 transitions. [2018-10-24 11:47:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 11:47:01,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-10-24 11:47:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:01,666 INFO L225 Difference]: With dead ends: 449 [2018-10-24 11:47:01,667 INFO L226 Difference]: Without dead ends: 447 [2018-10-24 11:47:01,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 11:47:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-24 11:47:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 366. [2018-10-24 11:47:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-24 11:47:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 396 transitions. [2018-10-24 11:47:01,761 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 396 transitions. Word has length 76 [2018-10-24 11:47:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:01,762 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 396 transitions. [2018-10-24 11:47:01,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 11:47:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 396 transitions. [2018-10-24 11:47:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 11:47:01,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:01,764 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:47:01,764 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:01,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 326259627, now seen corresponding path program 3 times [2018-10-24 11:47:01,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:01,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:01,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:47:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:47:02,431 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 11:47:02,726 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-24 11:47:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:47:03,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:47:03,698 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:47:03,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:47:03,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-24 11:47:03,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:47:03,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:47:04,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 11:47:04,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 11:47:04,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-24 11:47:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 11:47:04,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,276 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:04,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2018-10-24 11:47:04,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 11:47:04,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:40 [2018-10-24 11:47:04,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-24 11:47:04,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 89 [2018-10-24 11:47:04,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2018-10-24 11:47:04,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-24 11:47:04,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 92 [2018-10-24 11:47:04,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:21 [2018-10-24 11:47:04,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-24 11:47:04,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,831 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:47:04,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:47:04,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-10-24 11:47:04,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:47:04,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-10-24 11:47:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 52 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:47:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:47:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 47 [2018-10-24 11:47:04,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-24 11:47:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-24 11:47:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1950, Unknown=0, NotChecked=0, Total=2162 [2018-10-24 11:47:04,931 INFO L87 Difference]: Start difference. First operand 366 states and 396 transitions. Second operand 47 states. [2018-10-24 11:47:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:47:13,069 INFO L93 Difference]: Finished difference Result 707 states and 762 transitions. [2018-10-24 11:47:13,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-24 11:47:13,070 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-10-24 11:47:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:47:13,072 INFO L225 Difference]: With dead ends: 707 [2018-10-24 11:47:13,072 INFO L226 Difference]: Without dead ends: 650 [2018-10-24 11:47:13,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9728 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2018, Invalid=23742, Unknown=0, NotChecked=0, Total=25760 [2018-10-24 11:47:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-24 11:47:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 372. [2018-10-24 11:47:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-24 11:47:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 403 transitions. [2018-10-24 11:47:13,155 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 403 transitions. Word has length 79 [2018-10-24 11:47:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:47:13,155 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 403 transitions. [2018-10-24 11:47:13,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-24 11:47:13,155 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 403 transitions. [2018-10-24 11:47:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-24 11:47:13,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:47:13,156 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:47:13,156 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:47:13,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:47:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2049798021, now seen corresponding path program 2 times [2018-10-24 11:47:13,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:47:13,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:47:13,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:13,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:47:13,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:47:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 11:47:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 11:47:13,216 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 11:47:13,234 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,235 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,237 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,237 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,238 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,238 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,238 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,238 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,239 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,239 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,239 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,239 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,240 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,241 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,241 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,241 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,241 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,242 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,242 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,242 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,242 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,243 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,244 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,244 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,244 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,244 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,245 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,246 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,247 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,248 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,248 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,248 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,249 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,249 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,249 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,249 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,250 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,252 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,252 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,253 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,254 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,258 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,258 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,259 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,260 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,261 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,263 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,264 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,264 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,264 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,264 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,264 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,265 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,265 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,265 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,265 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,265 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,266 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,266 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,266 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,266 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,266 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,266 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,267 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,267 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,267 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,267 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,267 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,268 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,268 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,268 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,268 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,268 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,269 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,269 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,269 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,269 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,269 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,269 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,270 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,271 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,275 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,275 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,275 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,276 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,276 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,276 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,276 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,276 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,277 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,277 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,277 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,277 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,277 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,278 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,278 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,278 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,278 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,279 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,279 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,280 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,281 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,282 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,283 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,285 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,286 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,287 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,288 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,288 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,288 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,288 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,288 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-24 11:47:13,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:47:13 BoogieIcfgContainer [2018-10-24 11:47:13,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 11:47:13,318 INFO L168 Benchmark]: Toolchain (without parser) took 130150.06 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -613.2 MB). Peak memory consumption was 484.1 MB. Max. memory is 7.1 GB. [2018-10-24 11:47:13,319 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:47:13,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 11:47:13,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:47:13,320 INFO L168 Benchmark]: Boogie Preprocessor took 28.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:47:13,320 INFO L168 Benchmark]: RCFGBuilder took 597.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-10-24 11:47:13,320 INFO L168 Benchmark]: TraceAbstraction took 129139.57 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 142.7 MB). Peak memory consumption was 514.5 MB. Max. memory is 7.1 GB. [2018-10-24 11:47:13,322 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 597.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129139.57 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 142.7 MB). Peak memory consumption was 514.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] CALL int v[SIZE]; [L13] RET int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR, FCALL v[i] [L19] FCALL v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND FALSE !(j