java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:24:23,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:24:23,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:24:23,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:24:23,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:24:23,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:24:23,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:24:23,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:24:23,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:24:23,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:24:23,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:24:23,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:24:23,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:24:23,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:24:23,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:24:23,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:24:23,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:24:23,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:24:23,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:24:23,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:24:23,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:24:23,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:24:23,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:24:23,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:24:23,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:24:23,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:24:23,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:24:23,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:24:23,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:24:23,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:24:23,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:24:23,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:24:23,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:24:23,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:24:23,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:24:23,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:24:23,385 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:24:23,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:24:23,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:24:23,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:24:23,406 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:24:23,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:24:23,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:24:23,407 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:24:23,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:24:23,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:24:23,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:24:23,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:24:23,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:24:23,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:24:23,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:24:23,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:24:23,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:24:23,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:24:23,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:24:23,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:24:23,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:24:23,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:24:23,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:24:23,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:24:23,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:24:23,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:24:23,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:24:23,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:24:23,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:24:23,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:24:23,412 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:24:23,412 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:24:23,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:24:23,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:24:23,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:24:23,495 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:24:23,496 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:24:23,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-10-04 14:24:23,497 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-10-04 14:24:23,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:24:23,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:24:23,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:23,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:24:23,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:24:23,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:23,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:24:23,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:24:23,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:24:23,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:24:23,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:24:23,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:24:23,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:24:23,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:23,687 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 14:24:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:24:23,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:24:23,927 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:24:23,928 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:23 BoogieIcfgContainer [2018-10-04 14:24:23,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:24:23,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:24:23,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:24:23,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:24:23,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/2) ... [2018-10-04 14:24:23,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2530492a and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:24:23, skipping insertion in model container [2018-10-04 14:24:23,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:23" (2/2) ... [2018-10-04 14:24:23,941 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-10-04 14:24:23,952 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:24:23,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:24:24,020 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:24:24,021 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:24:24,021 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:24:24,022 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:24:24,022 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:24:24,022 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:24:24,022 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:24:24,022 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:24:24,023 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:24:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 14:24:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:24:24,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:24:24,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,053 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-04 14:24:24,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,224 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-04 14:24:24,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:24,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:24:24,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:24:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:24:24,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,253 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 14:24:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,293 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-10-04 14:24:24,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:24:24,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:24:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,309 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:24:24,309 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:24:24,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:24:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:24:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 14:24:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:24:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 14:24:24,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 14:24:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,373 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 14:24:24,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:24:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 14:24:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:24:24,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:24:24,374 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,374 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-10-04 14:24:24,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:24,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:24:24,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:24:24,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:24:24,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,467 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-10-04 14:24:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,497 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 14:24:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:24:24,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 14:24:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,500 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:24:24,500 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:24:24,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:24:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:24:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:24:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:24:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-04 14:24:24,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-10-04 14:24:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,504 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-04 14:24:24,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:24:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-04 14:24:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:24:24,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 14:24:24,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,506 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-10-04 14:24:24,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:24,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:24,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:24:24,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:24:24,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:24:24,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,702 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-10-04 14:24:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,748 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-10-04 14:24:24,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:24:24,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 14:24:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,750 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:24:24,750 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:24:24,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 14:24:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:24:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:24:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:24:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-04 14:24:24,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-10-04 14:24:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,755 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-04 14:24:24,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:24:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 14:24:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:24:24,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,757 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 14:24:24,758 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,758 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-10-04 14:24:24,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:24:24,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:24,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:24,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:24,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:24,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-10-04 14:24:24,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:24:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:24:24,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,975 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 7 states. [2018-10-04 14:24:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:25,458 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-10-04 14:24:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:24:25,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 14:24:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:25,460 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:24:25,460 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:24:25,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 7 [2018-10-04 14:24:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:24:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-04 14:24:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:24:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-04 14:24:25,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-10-04 14:24:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:25,466 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-04 14:24:25,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:24:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-04 14:24:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:24:25,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:25,467 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-10-04 14:24:25,468 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:25,468 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-10-04 14:24:25,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:24:25,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:25,559 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:25,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:25,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:24:25,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:25,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:24:25,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:25,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:24:25,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:24:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:24:25,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:25,653 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-10-04 14:24:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:25,772 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-10-04 14:24:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:24:25,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-04 14:24:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:25,774 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:24:25,774 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:24:25,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:24:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:24:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:24:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:24:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-04 14:24:25,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-10-04 14:24:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:25,781 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-04 14:24:25,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:24:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-04 14:24:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:24:25,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:25,782 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-10-04 14:24:25,782 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:25,783 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-10-04 14:24:25,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:25,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 14:24:25,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:25,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:25,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:25,927 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:25,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:25,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-04 14:24:26,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:26,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2018-10-04 14:24:26,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:24:26,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:24:26,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:26,054 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-10-04 14:24:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:26,851 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-10-04 14:24:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:24:26,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-10-04 14:24:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:26,856 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:24:26,857 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:24:26,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 10 [2018-10-04 14:24:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:24:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-10-04 14:24:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:24:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-10-04 14:24:26,867 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-10-04 14:24:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:26,867 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-04 14:24:26,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:24:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-10-04 14:24:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:24:26,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:26,869 INFO L375 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-10-04 14:24:26,870 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:26,870 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:26,871 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 5 times [2018-10-04 14:24:26,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:26,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:26,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:26,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-04 14:24:27,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:27,004 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:27,077 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:24:27,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:27,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-04 14:24:27,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:27,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-10-04 14:24:27,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:24:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:24:27,285 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:27,285 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-10-04 14:24:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:27,807 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-10-04 14:24:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:24:27,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-10-04 14:24:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:27,809 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:24:27,809 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:24:27,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 12 [2018-10-04 14:24:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:24:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-10-04 14:24:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 14:24:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-04 14:24:27,820 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-10-04 14:24:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:27,821 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-04 14:24:27,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:24:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-04 14:24:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 14:24:27,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:27,822 INFO L375 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-10-04 14:24:27,823 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:27,823 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 6 times [2018-10-04 14:24:27,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:27,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:27,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:27,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:27,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-10-04 14:24:27,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:27,969 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:27,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:28,037 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 14:24:28,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:28,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 251 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-04 14:24:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:24:28,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:24:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:24:28,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:28,116 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-10-04 14:24:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:28,151 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-10-04 14:24:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:24:28,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-04 14:24:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:28,152 INFO L225 Difference]: With dead ends: 67 [2018-10-04 14:24:28,152 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:24:28,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:24:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:24:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:24:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:24:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-04 14:24:28,163 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-10-04 14:24:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:28,163 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-04 14:24:28,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:24:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-10-04 14:24:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:24:28,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:28,165 INFO L375 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-10-04 14:24:28,166 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:28,166 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 7 times [2018-10-04 14:24:28,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:28,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:28,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:28,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-04 14:24:28,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:28,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:28,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-10-04 14:24:28,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:28,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-10-04 14:24:28,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:24:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:24:28,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:28,519 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-10-04 14:24:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:29,694 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-10-04 14:24:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:24:29,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-10-04 14:24:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:29,697 INFO L225 Difference]: With dead ends: 93 [2018-10-04 14:24:29,697 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:24:29,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 15 [2018-10-04 14:24:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:24:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-10-04 14:24:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 14:24:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-10-04 14:24:29,710 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-10-04 14:24:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:29,710 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-10-04 14:24:29,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:24:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-10-04 14:24:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 14:24:29,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:29,712 INFO L375 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-10-04 14:24:29,713 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:29,713 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 8 times [2018-10-04 14:24:29,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:29,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:29,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-04 14:24:29,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:29,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:29,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:29,942 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:29,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:29,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-10-04 14:24:30,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:30,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-10-04 14:24:30,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:24:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:24:30,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:30,267 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-10-04 14:24:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:32,110 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-10-04 14:24:32,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:24:32,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-04 14:24:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:32,111 INFO L225 Difference]: With dead ends: 123 [2018-10-04 14:24:32,111 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:24:32,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 17 [2018-10-04 14:24:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:24:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-10-04 14:24:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 14:24:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-10-04 14:24:32,126 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-10-04 14:24:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:32,126 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-10-04 14:24:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:24:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-10-04 14:24:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 14:24:32,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:32,128 INFO L375 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-10-04 14:24:32,129 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:32,129 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 9 times [2018-10-04 14:24:32,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:32,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:32,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:32,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:32,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-10-04 14:24:32,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:32,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:32,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:32,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:24:32,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:32,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-04 14:24:32,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:32,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2018-10-04 14:24:32,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:24:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:24:32,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:32,630 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-10-04 14:24:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:34,554 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-10-04 14:24:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 14:24:34,555 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-10-04 14:24:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:34,556 INFO L225 Difference]: With dead ends: 157 [2018-10-04 14:24:34,556 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:24:34,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.6s impTime 19 [2018-10-04 14:24:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:24:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-10-04 14:24:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 14:24:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-10-04 14:24:34,574 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-10-04 14:24:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:34,575 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-04 14:24:34,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:24:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-10-04 14:24:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:24:34,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:34,576 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-10-04 14:24:34,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:34,577 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 10 times [2018-10-04 14:24:34,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-04 14:24:34,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:34,932 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:34,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:35,007 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:35,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:35,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-04 14:24:35,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:35,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:24:35,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:24:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:24:35,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:35,435 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-10-04 14:24:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:35,482 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-10-04 14:24:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:24:35,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-10-04 14:24:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:35,484 INFO L225 Difference]: With dead ends: 113 [2018-10-04 14:24:35,484 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:24:35,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 8 [2018-10-04 14:24:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:24:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-10-04 14:24:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:24:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-10-04 14:24:35,506 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-10-04 14:24:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:35,506 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-04 14:24:35,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:24:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-10-04 14:24:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 14:24:35,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:35,508 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-10-04 14:24:35,509 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:35,509 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 11 times [2018-10-04 14:24:35,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:35,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:35,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-04 14:24:35,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:35,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:35,893 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 14:24:35,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:35,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-04 14:24:36,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:36,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:24:36,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:24:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:24:36,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:36,090 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-10-04 14:24:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:36,231 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-10-04 14:24:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:24:36,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-10-04 14:24:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:36,234 INFO L225 Difference]: With dead ends: 125 [2018-10-04 14:24:36,234 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 14:24:36,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:24:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 14:24:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-10-04 14:24:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 14:24:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-10-04 14:24:36,258 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-10-04 14:24:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:36,258 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-10-04 14:24:36,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:24:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-10-04 14:24:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-04 14:24:36,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:36,261 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-10-04 14:24:36,261 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:36,261 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 12 times [2018-10-04 14:24:36,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:36,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:36,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:36,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-04 14:24:36,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:36,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:36,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:36,644 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-04 14:24:36,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:36,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-04 14:24:36,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:36,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:24:36,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:24:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:24:36,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:36,961 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-10-04 14:24:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:37,073 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-10-04 14:24:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:24:37,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-10-04 14:24:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:37,077 INFO L225 Difference]: With dead ends: 137 [2018-10-04 14:24:37,078 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:24:37,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 10 [2018-10-04 14:24:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:24:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-10-04 14:24:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-04 14:24:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-10-04 14:24:37,109 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-10-04 14:24:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:37,109 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-10-04 14:24:37,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:24:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-04 14:24:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 14:24:37,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:37,111 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-10-04 14:24:37,112 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:37,112 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 13 times [2018-10-04 14:24:37,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:37,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-04 14:24:37,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:37,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:37,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:37,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-04 14:24:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:24:37,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:24:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:24:37,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:37,685 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-10-04 14:24:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:37,876 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-10-04 14:24:37,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:24:37,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-10-04 14:24:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:37,878 INFO L225 Difference]: With dead ends: 149 [2018-10-04 14:24:37,878 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 14:24:37,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 11 [2018-10-04 14:24:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 14:24:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-10-04 14:24:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-04 14:24:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-04 14:24:37,901 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-10-04 14:24:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:37,901 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-04 14:24:37,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:24:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-10-04 14:24:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-04 14:24:37,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:37,903 INFO L375 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-10-04 14:24:37,903 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:37,903 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:37,903 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 14 times [2018-10-04 14:24:37,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-04 14:24:38,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:38,716 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:38,807 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:38,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:38,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-04 14:24:39,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:39,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:24:39,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:24:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:24:39,068 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:39,068 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-10-04 14:24:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:39,175 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-10-04 14:24:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:24:39,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-10-04 14:24:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:39,177 INFO L225 Difference]: With dead ends: 161 [2018-10-04 14:24:39,177 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 14:24:39,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 12 [2018-10-04 14:24:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 14:24:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-10-04 14:24:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-04 14:24:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-10-04 14:24:39,203 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-10-04 14:24:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:39,203 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-10-04 14:24:39,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:24:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-10-04 14:24:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 14:24:39,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:39,205 INFO L375 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-10-04 14:24:39,205 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:39,205 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 15 times [2018-10-04 14:24:39,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:39,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:39,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-04 14:24:39,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:39,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:39,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:39,721 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-10-04 14:24:39,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:39,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-04 14:24:40,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:40,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:24:40,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:24:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:24:40,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:40,018 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-10-04 14:24:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:40,143 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-10-04 14:24:40,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:24:40,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-10-04 14:24:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:40,144 INFO L225 Difference]: With dead ends: 173 [2018-10-04 14:24:40,144 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 14:24:40,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 13 [2018-10-04 14:24:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 14:24:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-10-04 14:24:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-04 14:24:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-10-04 14:24:40,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-10-04 14:24:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:40,171 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-10-04 14:24:40,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:24:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-10-04 14:24:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 14:24:40,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:40,173 INFO L375 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-10-04 14:24:40,173 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:40,174 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:40,174 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 16 times [2018-10-04 14:24:40,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:40,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:40,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:40,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:40,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-04 14:24:41,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:41,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:41,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:41,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:41,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:41,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-04 14:24:41,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:41,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:24:41,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:24:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:24:41,626 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:41,626 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-10-04 14:24:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:41,738 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-10-04 14:24:41,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:24:41,738 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-10-04 14:24:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:41,739 INFO L225 Difference]: With dead ends: 185 [2018-10-04 14:24:41,739 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 14:24:41,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 14 [2018-10-04 14:24:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 14:24:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-10-04 14:24:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-04 14:24:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-10-04 14:24:41,769 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-10-04 14:24:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:41,770 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-10-04 14:24:41,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:24:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-10-04 14:24:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-04 14:24:41,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:41,772 INFO L375 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-10-04 14:24:41,772 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:41,772 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 17 times [2018-10-04 14:24:41,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:41,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-04 14:24:42,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:42,139 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:42,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:42,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-10-04 14:24:42,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:42,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-04 14:24:42,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:42,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:24:42,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:24:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:24:42,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:42,724 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-10-04 14:24:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:42,861 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-10-04 14:24:42,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:24:42,862 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-10-04 14:24:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:42,863 INFO L225 Difference]: With dead ends: 197 [2018-10-04 14:24:42,863 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 14:24:42,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 15 [2018-10-04 14:24:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 14:24:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-10-04 14:24:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-04 14:24:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-10-04 14:24:42,897 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-10-04 14:24:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:42,897 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-10-04 14:24:42,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:24:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-10-04 14:24:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-04 14:24:42,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:42,899 INFO L375 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-10-04 14:24:42,899 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:42,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:42,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 18 times [2018-10-04 14:24:42,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:42,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:42,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:42,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:42,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-10-04 14:24:43,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:43,606 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:43,614 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:44,329 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-10-04 14:24:44,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:44,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-10-04 14:24:44,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:44,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:24:44,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:24:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:24:44,668 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:44,668 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-10-04 14:24:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:44,761 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-10-04 14:24:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:24:44,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-10-04 14:24:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:44,763 INFO L225 Difference]: With dead ends: 209 [2018-10-04 14:24:44,763 INFO L226 Difference]: Without dead ends: 207 [2018-10-04 14:24:44,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 16 [2018-10-04 14:24:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-04 14:24:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-10-04 14:24:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 14:24:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-10-04 14:24:44,801 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-10-04 14:24:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:44,801 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-10-04 14:24:44,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:24:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-10-04 14:24:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-04 14:24:44,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:44,803 INFO L375 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-10-04 14:24:44,803 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:44,803 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 19 times [2018-10-04 14:24:44,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:44,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-04 14:24:45,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:45,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:45,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:45,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-04 14:24:46,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:46,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:24:46,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:24:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:24:46,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:46,070 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-10-04 14:24:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:46,208 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-10-04 14:24:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:24:46,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-10-04 14:24:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:46,210 INFO L225 Difference]: With dead ends: 221 [2018-10-04 14:24:46,210 INFO L226 Difference]: Without dead ends: 219 [2018-10-04 14:24:46,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 17 [2018-10-04 14:24:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-04 14:24:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-10-04 14:24:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-04 14:24:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-10-04 14:24:46,248 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-10-04 14:24:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-10-04 14:24:46,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:24:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-10-04 14:24:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-04 14:24:46,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:46,249 INFO L375 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-10-04 14:24:46,249 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:46,249 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 20 times [2018-10-04 14:24:46,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:46,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-10-04 14:24:46,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:46,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:47,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:47,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:47,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-10-04 14:24:47,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:47,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:24:47,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:24:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:24:47,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:47,501 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-10-04 14:24:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:47,663 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-10-04 14:24:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:24:47,666 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-10-04 14:24:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:47,667 INFO L225 Difference]: With dead ends: 233 [2018-10-04 14:24:47,667 INFO L226 Difference]: Without dead ends: 231 [2018-10-04 14:24:47,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 18 [2018-10-04 14:24:47,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-04 14:24:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-10-04 14:24:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-04 14:24:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-10-04 14:24:47,713 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-10-04 14:24:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:47,714 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-10-04 14:24:47,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:24:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-10-04 14:24:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-04 14:24:47,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:47,715 INFO L375 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-10-04 14:24:47,715 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:47,715 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 21 times [2018-10-04 14:24:47,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:47,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:47,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:47,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:47,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-04 14:24:48,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:48,233 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:48,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:48,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 109 check-sat command(s) [2018-10-04 14:24:48,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:48,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-04 14:24:48,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:48,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:24:48,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:24:48,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:24:48,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:48,965 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-10-04 14:24:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:49,104 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-10-04 14:24:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:24:49,104 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-10-04 14:24:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:49,105 INFO L225 Difference]: With dead ends: 245 [2018-10-04 14:24:49,105 INFO L226 Difference]: Without dead ends: 243 [2018-10-04 14:24:49,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 19 [2018-10-04 14:24:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-04 14:24:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-10-04 14:24:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-04 14:24:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-10-04 14:24:49,155 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-10-04 14:24:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:49,156 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-10-04 14:24:49,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:24:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-10-04 14:24:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-04 14:24:49,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:49,157 INFO L375 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-10-04 14:24:49,158 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:49,158 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 22 times [2018-10-04 14:24:49,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:49,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:49,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:49,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:49,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-10-04 14:24:50,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:50,564 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:50,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:50,694 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:50,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:50,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-10-04 14:24:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:24:51,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:24:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:24:51,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:51,101 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-10-04 14:24:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:51,232 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-10-04 14:24:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:24:51,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-10-04 14:24:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:51,243 INFO L225 Difference]: With dead ends: 257 [2018-10-04 14:24:51,243 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 14:24:51,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime 20 [2018-10-04 14:24:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 14:24:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-10-04 14:24:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-04 14:24:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-10-04 14:24:51,307 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-10-04 14:24:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:51,308 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-10-04 14:24:51,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:24:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-10-04 14:24:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-04 14:24:51,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:51,310 INFO L375 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-10-04 14:24:51,310 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:51,310 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 23 times [2018-10-04 14:24:51,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:51,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:51,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-10-04 14:24:51,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:51,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:51,804 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:52,074 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 121 check-sat command(s) [2018-10-04 14:24:52,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:52,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-10-04 14:24:52,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:52,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:24:52,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:24:52,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:24:52,495 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:52,495 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-10-04 14:24:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:52,660 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-10-04 14:24:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:24:52,662 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-10-04 14:24:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:52,664 INFO L225 Difference]: With dead ends: 269 [2018-10-04 14:24:52,664 INFO L226 Difference]: Without dead ends: 267 [2018-10-04 14:24:52,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 21 [2018-10-04 14:24:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-04 14:24:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-10-04 14:24:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-04 14:24:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-10-04 14:24:52,726 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-10-04 14:24:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:52,726 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-10-04 14:24:52,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:24:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-10-04 14:24:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-04 14:24:52,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:52,728 INFO L375 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-10-04 14:24:52,728 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:52,728 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 24 times [2018-10-04 14:24:52,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:52,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:52,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:52,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:52,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-10-04 14:24:53,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:53,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:53,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:53,837 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 123 check-sat command(s) [2018-10-04 14:24:53,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:53,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-10-04 14:24:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:54,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:24:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:24:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:24:54,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:54,362 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-10-04 14:24:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:54,917 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-10-04 14:24:54,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:24:54,917 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-10-04 14:24:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:54,919 INFO L225 Difference]: With dead ends: 281 [2018-10-04 14:24:54,919 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 14:24:54,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.4s impTime 22 [2018-10-04 14:24:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 14:24:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-10-04 14:24:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 14:24:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-10-04 14:24:54,990 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-10-04 14:24:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:54,991 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-10-04 14:24:54,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:24:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-10-04 14:24:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-04 14:24:54,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:54,993 INFO L375 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-10-04 14:24:54,993 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:54,993 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 25 times [2018-10-04 14:24:54,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:54,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:54,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:54,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-10-04 14:24:55,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:55,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:55,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-10-04 14:24:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:57,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:24:57,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:24:57,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:24:57,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:57,308 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-10-04 14:24:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:57,482 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-10-04 14:24:57,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:24:57,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-10-04 14:24:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:57,484 INFO L225 Difference]: With dead ends: 293 [2018-10-04 14:24:57,484 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 14:24:57,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.3s impTime 23 [2018-10-04 14:24:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 14:24:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-10-04 14:24:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-04 14:24:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-10-04 14:24:57,578 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-10-04 14:24:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:57,579 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-10-04 14:24:57,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:24:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-10-04 14:24:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-04 14:24:57,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:57,581 INFO L375 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-10-04 14:24:57,581 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:57,581 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 26 times [2018-10-04 14:24:57,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:57,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-10-04 14:24:58,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:58,358 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:24:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:58,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:58,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:58,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-10-04 14:24:59,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:24:59,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:24:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:24:59,786 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,786 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-10-04 14:25:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:00,102 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-10-04 14:25:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:25:00,104 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-10-04 14:25:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:00,106 INFO L225 Difference]: With dead ends: 305 [2018-10-04 14:25:00,106 INFO L226 Difference]: Without dead ends: 303 [2018-10-04 14:25:00,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.4s impTime 24 [2018-10-04 14:25:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-04 14:25:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-10-04 14:25:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-04 14:25:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-10-04 14:25:00,201 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-10-04 14:25:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:00,201 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-10-04 14:25:00,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:25:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-10-04 14:25:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-04 14:25:00,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:00,203 INFO L375 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-10-04 14:25:00,203 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:00,203 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 27 times [2018-10-04 14:25:00,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-04 14:25:01,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:01,012 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:25:01,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:01,601 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 145 check-sat command(s) [2018-10-04 14:25:01,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:01,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-04 14:25:02,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:25:02,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:25:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:25:02,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:02,269 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-10-04 14:25:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:02,471 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-10-04 14:25:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:25:02,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-10-04 14:25:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:02,473 INFO L225 Difference]: With dead ends: 317 [2018-10-04 14:25:02,473 INFO L226 Difference]: Without dead ends: 315 [2018-10-04 14:25:02,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 25 [2018-10-04 14:25:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-04 14:25:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-10-04 14:25:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-04 14:25:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-10-04 14:25:02,591 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-10-04 14:25:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:02,591 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-10-04 14:25:02,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:25:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-10-04 14:25:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-04 14:25:02,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:02,596 INFO L375 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-10-04 14:25:02,596 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:02,596 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 28 times [2018-10-04 14:25:02,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-10-04 14:25:03,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:03,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:25:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:03,787 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:03,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:03,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-10-04 14:25:04,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:04,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:25:04,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:25:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:25:04,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:04,483 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-10-04 14:25:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:04,699 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-10-04 14:25:04,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:25:04,699 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-10-04 14:25:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:04,700 INFO L225 Difference]: With dead ends: 329 [2018-10-04 14:25:04,701 INFO L226 Difference]: Without dead ends: 327 [2018-10-04 14:25:04,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.5s impTime 26 [2018-10-04 14:25:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-04 14:25:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-10-04 14:25:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-04 14:25:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-10-04 14:25:04,802 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-10-04 14:25:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:04,803 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-10-04 14:25:04,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:25:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-10-04 14:25:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-04 14:25:04,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:04,804 INFO L375 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-10-04 14:25:04,805 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:04,805 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 29 times [2018-10-04 14:25:04,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-04 14:25:06,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:06,541 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:25:06,549 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:06,997 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 157 check-sat command(s) [2018-10-04 14:25:06,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:07,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-04 14:25:07,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:07,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:25:07,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:25:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:25:07,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:07,530 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-10-04 14:25:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:07,761 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-10-04 14:25:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:25:07,761 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-10-04 14:25:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:07,762 INFO L225 Difference]: With dead ends: 341 [2018-10-04 14:25:07,763 INFO L226 Difference]: Without dead ends: 339 [2018-10-04 14:25:07,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.1s impTime 27 [2018-10-04 14:25:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-04 14:25:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-10-04 14:25:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-04 14:25:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-10-04 14:25:07,870 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-10-04 14:25:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:07,870 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-10-04 14:25:07,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:25:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-10-04 14:25:07,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-04 14:25:07,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:07,872 INFO L375 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-10-04 14:25:07,872 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:07,872 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 30 times [2018-10-04 14:25:07,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:07,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-04 14:25:09,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:09,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-04 14:25:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:10,065 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 158 check-sat command(s) [2018-10-04 14:25:10,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:10,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-04 14:25:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:10,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:25:10,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:25:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:25:10,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:10,674 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-10-04 14:25:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:10,984 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-10-04 14:25:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:25:10,984 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-10-04 14:25:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:10,986 INFO L225 Difference]: With dead ends: 353 [2018-10-04 14:25:10,986 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 14:25:10,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.2s impTime 28 [2018-10-04 14:25:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 14:25:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-10-04 14:25:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-04 14:25:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-10-04 14:25:11,089 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-10-04 14:25:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:11,090 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-10-04 14:25:11,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:25:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-10-04 14:25:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-04 14:25:11,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:11,091 INFO L375 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-10-04 14:25:11,092 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:11,092 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 31 times [2018-10-04 14:25:11,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:11,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-04 14:25:13,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:13,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:13,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:13,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-04 14:25:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:25:14,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:25:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:25:14,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:14,105 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-10-04 14:25:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:14,378 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-10-04 14:25:14,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:25:14,378 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-10-04 14:25:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:14,380 INFO L225 Difference]: With dead ends: 365 [2018-10-04 14:25:14,380 INFO L226 Difference]: Without dead ends: 363 [2018-10-04 14:25:14,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.4s impTime 29 [2018-10-04 14:25:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-04 14:25:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-10-04 14:25:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-04 14:25:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-10-04 14:25:14,503 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-10-04 14:25:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:14,504 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-10-04 14:25:14,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:25:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-10-04 14:25:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-04 14:25:14,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:14,506 INFO L375 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-10-04 14:25:14,506 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:14,506 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 32 times [2018-10-04 14:25:14,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:14,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:14,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-04 14:25:15,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:15,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:15,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:15,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:15,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:15,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-04 14:25:16,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:16,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:25:16,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:25:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:25:16,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:16,652 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-10-04 14:25:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:16,910 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-10-04 14:25:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:25:16,911 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-10-04 14:25:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:16,912 INFO L225 Difference]: With dead ends: 377 [2018-10-04 14:25:16,912 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 14:25:16,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.6s impTime 30 [2018-10-04 14:25:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 14:25:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-10-04 14:25:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-04 14:25:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-10-04 14:25:17,031 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-10-04 14:25:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:17,032 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-10-04 14:25:17,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:25:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-10-04 14:25:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-04 14:25:17,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:17,034 INFO L375 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-10-04 14:25:17,034 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:17,034 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 33 times [2018-10-04 14:25:17,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:17,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-04 14:25:17,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:17,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:17,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:18,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 181 check-sat command(s) [2018-10-04 14:25:18,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:18,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-04 14:25:19,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:19,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:25:19,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:25:19,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:25:19,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:19,101 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-10-04 14:25:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:19,361 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-10-04 14:25:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:25:19,362 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-10-04 14:25:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:19,363 INFO L225 Difference]: With dead ends: 389 [2018-10-04 14:25:19,364 INFO L226 Difference]: Without dead ends: 387 [2018-10-04 14:25:19,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 31 [2018-10-04 14:25:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-04 14:25:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-10-04 14:25:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-04 14:25:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-10-04 14:25:19,490 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-10-04 14:25:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:19,490 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-10-04 14:25:19,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:25:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-10-04 14:25:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-04 14:25:19,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:19,492 INFO L375 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-10-04 14:25:19,492 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:19,492 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 34 times [2018-10-04 14:25:19,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-10-04 14:25:20,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:20,300 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:20,513 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:20,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:20,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-10-04 14:25:21,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:21,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:25:21,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:25:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:25:21,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:21,509 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-10-04 14:25:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:21,788 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-10-04 14:25:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:25:21,789 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-10-04 14:25:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:21,791 INFO L225 Difference]: With dead ends: 401 [2018-10-04 14:25:21,791 INFO L226 Difference]: Without dead ends: 399 [2018-10-04 14:25:21,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.4s impTime 32 [2018-10-04 14:25:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-04 14:25:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-10-04 14:25:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-04 14:25:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-10-04 14:25:21,935 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-10-04 14:25:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:21,935 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-10-04 14:25:21,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:25:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-10-04 14:25:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-04 14:25:21,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:21,938 INFO L375 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-10-04 14:25:21,938 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:21,938 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 35 times [2018-10-04 14:25:21,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:21,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:21,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-04 14:25:22,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:22,756 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:22,765 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:23,369 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 193 check-sat command(s) [2018-10-04 14:25:23,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:23,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-04 14:25:24,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:25:24,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:25:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:25:24,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:24,032 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-10-04 14:25:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:24,351 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-10-04 14:25:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:25:24,351 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-10-04 14:25:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:24,352 INFO L225 Difference]: With dead ends: 413 [2018-10-04 14:25:24,353 INFO L226 Difference]: Without dead ends: 411 [2018-10-04 14:25:24,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.4s impTime 33 [2018-10-04 14:25:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-04 14:25:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-10-04 14:25:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-04 14:25:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-10-04 14:25:24,502 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-10-04 14:25:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:24,503 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-10-04 14:25:24,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:25:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-10-04 14:25:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-04 14:25:24,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:24,505 INFO L375 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-10-04 14:25:24,505 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:24,506 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 36 times [2018-10-04 14:25:24,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:24,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:24,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-10-04 14:25:26,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:26,188 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:26,195 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:26,833 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 195 check-sat command(s) [2018-10-04 14:25:26,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:26,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-10-04 14:25:27,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:27,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:25:27,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:25:27,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:25:27,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:27,561 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-10-04 14:25:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:27,906 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-10-04 14:25:27,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:25:27,907 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-10-04 14:25:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:27,909 INFO L225 Difference]: With dead ends: 425 [2018-10-04 14:25:27,909 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 14:25:27,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.1s impTime 34 [2018-10-04 14:25:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 14:25:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-10-04 14:25:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-04 14:25:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-10-04 14:25:28,048 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-10-04 14:25:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:28,049 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-10-04 14:25:28,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:25:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-10-04 14:25:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-04 14:25:28,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:28,051 INFO L375 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-10-04 14:25:28,051 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:28,051 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 37 times [2018-10-04 14:25:28,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:28,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-10-04 14:25:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:28,809 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:28,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:29,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-10-04 14:25:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:29,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:25:29,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:25:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:25:29,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:29,826 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-10-04 14:25:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:30,268 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-10-04 14:25:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:25:30,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-10-04 14:25:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:30,279 INFO L225 Difference]: With dead ends: 437 [2018-10-04 14:25:30,279 INFO L226 Difference]: Without dead ends: 435 [2018-10-04 14:25:30,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.3s impTime 35 [2018-10-04 14:25:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-04 14:25:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-10-04 14:25:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-04 14:25:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-10-04 14:25:30,444 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-10-04 14:25:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:30,444 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-10-04 14:25:30,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:25:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-10-04 14:25:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-04 14:25:30,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:30,447 INFO L375 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-10-04 14:25:30,447 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:30,447 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 38 times [2018-10-04 14:25:30,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:30,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:30,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:30,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:30,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-10-04 14:25:31,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:31,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:32,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:32,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:32,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-10-04 14:25:33,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:33,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:25:33,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:25:33,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:25:33,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:33,792 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-10-04 14:25:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:34,140 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-10-04 14:25:34,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:25:34,140 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-10-04 14:25:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:34,142 INFO L225 Difference]: With dead ends: 449 [2018-10-04 14:25:34,142 INFO L226 Difference]: Without dead ends: 447 [2018-10-04 14:25:34,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 0.8s impTime 36 [2018-10-04 14:25:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-04 14:25:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-10-04 14:25:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-04 14:25:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-10-04 14:25:34,309 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-10-04 14:25:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:34,310 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-10-04 14:25:34,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:25:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-10-04 14:25:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-04 14:25:34,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:34,313 INFO L375 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-10-04 14:25:34,313 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:34,313 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 39 times [2018-10-04 14:25:34,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:34,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:34,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-04 14:25:35,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:35,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:35,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:35,751 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 217 check-sat command(s) [2018-10-04 14:25:35,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:35,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-04 14:25:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:25:36,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:25:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:25:36,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:36,560 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-10-04 14:25:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:36,931 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-10-04 14:25:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:25:36,931 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-10-04 14:25:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:36,933 INFO L225 Difference]: With dead ends: 461 [2018-10-04 14:25:36,933 INFO L226 Difference]: Without dead ends: 459 [2018-10-04 14:25:36,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.3s impTime 37 [2018-10-04 14:25:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-04 14:25:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-10-04 14:25:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-04 14:25:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-10-04 14:25:37,115 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-10-04 14:25:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:37,115 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-10-04 14:25:37,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:25:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-10-04 14:25:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-04 14:25:37,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:37,117 INFO L375 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-10-04 14:25:37,117 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:37,117 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 40 times [2018-10-04 14:25:37,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:37,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:37,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-10-04 14:25:37,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:37,933 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:38,176 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:38,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:38,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-10-04 14:25:38,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:38,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:25:38,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:25:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:25:38,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:38,965 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-10-04 14:25:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:39,368 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-10-04 14:25:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:25:39,368 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-10-04 14:25:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:39,370 INFO L225 Difference]: With dead ends: 473 [2018-10-04 14:25:39,370 INFO L226 Difference]: Without dead ends: 471 [2018-10-04 14:25:39,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.3s impTime 38 [2018-10-04 14:25:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-04 14:25:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-10-04 14:25:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-04 14:25:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-10-04 14:25:39,577 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-10-04 14:25:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:39,577 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-10-04 14:25:39,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:25:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-10-04 14:25:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-04 14:25:39,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:39,580 INFO L375 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-10-04 14:25:39,580 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:39,580 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 41 times [2018-10-04 14:25:39,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:39,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:39,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-04 14:25:40,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:40,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:41,348 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 229 check-sat command(s) [2018-10-04 14:25:41,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:41,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-04 14:25:42,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:42,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:25:42,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:25:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:25:42,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:42,412 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-10-04 14:25:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:42,973 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-10-04 14:25:42,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:25:42,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-10-04 14:25:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:42,975 INFO L225 Difference]: With dead ends: 485 [2018-10-04 14:25:42,975 INFO L226 Difference]: Without dead ends: 483 [2018-10-04 14:25:42,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.4s impTime 39 [2018-10-04 14:25:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-04 14:25:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-10-04 14:25:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-04 14:25:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-10-04 14:25:43,185 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-10-04 14:25:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:43,186 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-10-04 14:25:43,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:25:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-10-04 14:25:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-04 14:25:43,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:43,188 INFO L375 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-10-04 14:25:43,188 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:43,188 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 42 times [2018-10-04 14:25:43,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:43,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:43,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:43,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:43,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-10-04 14:25:44,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:44,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:44,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:45,289 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 230 check-sat command(s) [2018-10-04 14:25:45,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:45,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-10-04 14:25:46,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:46,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:25:46,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:25:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:25:46,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:46,178 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-10-04 14:25:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:46,601 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-10-04 14:25:46,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:25:46,601 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-10-04 14:25:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:46,603 INFO L225 Difference]: With dead ends: 497 [2018-10-04 14:25:46,603 INFO L226 Difference]: Without dead ends: 495 [2018-10-04 14:25:46,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.6s impTime 40 [2018-10-04 14:25:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-04 14:25:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-10-04 14:25:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-04 14:25:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-10-04 14:25:46,824 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-10-04 14:25:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:46,824 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-10-04 14:25:46,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:25:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-10-04 14:25:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-04 14:25:46,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:46,827 INFO L375 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-10-04 14:25:46,827 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:46,827 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 43 times [2018-10-04 14:25:46,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:46,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-10-04 14:25:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:48,723 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:48,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:49,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-10-04 14:25:49,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:49,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:25:49,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:25:49,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:25:49,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:49,874 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-10-04 14:25:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:50,295 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-10-04 14:25:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:25:50,296 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-10-04 14:25:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:50,297 INFO L225 Difference]: With dead ends: 509 [2018-10-04 14:25:50,297 INFO L226 Difference]: Without dead ends: 507 [2018-10-04 14:25:50,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.2s impTime 41 [2018-10-04 14:25:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-04 14:25:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-10-04 14:25:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-10-04 14:25:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-10-04 14:25:50,522 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-10-04 14:25:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:50,523 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-10-04 14:25:50,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:25:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-10-04 14:25:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-04 14:25:50,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:50,525 INFO L375 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-10-04 14:25:50,525 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:50,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 44 times [2018-10-04 14:25:50,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:50,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:50,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-10-04 14:25:51,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:51,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:51,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:51,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:51,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:51,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-10-04 14:25:52,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:52,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:25:52,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:25:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:25:52,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:52,602 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-10-04 14:25:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:53,048 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-10-04 14:25:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:25:53,049 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-10-04 14:25:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:53,051 INFO L225 Difference]: With dead ends: 521 [2018-10-04 14:25:53,051 INFO L226 Difference]: Without dead ends: 519 [2018-10-04 14:25:53,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.3s impTime 42 [2018-10-04 14:25:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-10-04 14:25:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-10-04 14:25:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-04 14:25:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-10-04 14:25:53,340 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-10-04 14:25:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:53,340 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-10-04 14:25:53,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:25:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-10-04 14:25:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-10-04 14:25:53,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:53,342 INFO L375 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-10-04 14:25:53,342 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:53,342 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 45 times [2018-10-04 14:25:53,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:53,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:53,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-04 14:25:54,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:54,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:54,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:55,320 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 253 check-sat command(s) [2018-10-04 14:25:55,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:55,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-04 14:25:56,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:56,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:25:56,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:25:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:25:56,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:56,235 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-10-04 14:25:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:56,906 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-10-04 14:25:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:25:56,908 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-10-04 14:25:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:56,910 INFO L225 Difference]: With dead ends: 533 [2018-10-04 14:25:56,911 INFO L226 Difference]: Without dead ends: 531 [2018-10-04 14:25:56,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 43 [2018-10-04 14:25:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-04 14:25:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-10-04 14:25:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-04 14:25:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-10-04 14:25:57,187 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-10-04 14:25:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:57,188 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-10-04 14:25:57,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:25:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-10-04 14:25:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-04 14:25:57,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:57,190 INFO L375 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-10-04 14:25:57,190 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:57,190 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 46 times [2018-10-04 14:25:57,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:57,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:57,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-10-04 14:25:58,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:58,041 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:58,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:58,339 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:58,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:58,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-10-04 14:25:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:59,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:25:59,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:25:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:25:59,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:59,285 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-10-04 14:25:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:59,860 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-10-04 14:25:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:25:59,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-10-04 14:25:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:59,863 INFO L225 Difference]: With dead ends: 545 [2018-10-04 14:25:59,863 INFO L226 Difference]: Without dead ends: 543 [2018-10-04 14:25:59,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 44 [2018-10-04 14:25:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-04 14:26:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-10-04 14:26:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-10-04 14:26:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-10-04 14:26:00,164 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-10-04 14:26:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:00,165 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-10-04 14:26:00,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:26:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-10-04 14:26:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-04 14:26:00,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:00,167 INFO L375 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-10-04 14:26:00,167 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:00,167 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 47 times [2018-10-04 14:26:00,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:00,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:00,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:00,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:00,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-10-04 14:26:00,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:00,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:00,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:02,055 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 265 check-sat command(s) [2018-10-04 14:26:02,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:02,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-10-04 14:26:03,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:03,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:26:03,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:26:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:26:03,055 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:03,056 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-10-04 14:26:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:03,637 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-10-04 14:26:03,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:26:03,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-10-04 14:26:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:03,639 INFO L225 Difference]: With dead ends: 557 [2018-10-04 14:26:03,639 INFO L226 Difference]: Without dead ends: 555 [2018-10-04 14:26:03,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.3s impTime 45 [2018-10-04 14:26:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-04 14:26:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-10-04 14:26:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-04 14:26:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-10-04 14:26:03,933 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-10-04 14:26:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:03,933 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-10-04 14:26:03,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:26:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-10-04 14:26:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-04 14:26:03,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:03,936 INFO L375 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-10-04 14:26:03,936 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:03,936 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 48 times [2018-10-04 14:26:03,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:03,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:03,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-10-04 14:26:04,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:04,818 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:04,826 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:05,926 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 267 check-sat command(s) [2018-10-04 14:26:05,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:05,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-10-04 14:26:06,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:06,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:26:06,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:26:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:26:06,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:06,940 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-10-04 14:26:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:07,452 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-10-04 14:26:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:26:07,453 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-10-04 14:26:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:07,455 INFO L225 Difference]: With dead ends: 569 [2018-10-04 14:26:07,455 INFO L226 Difference]: Without dead ends: 567 [2018-10-04 14:26:07,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.4s impTime 46 [2018-10-04 14:26:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-04 14:26:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-10-04 14:26:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-10-04 14:26:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-10-04 14:26:07,742 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-10-04 14:26:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:07,743 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-10-04 14:26:07,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:26:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-10-04 14:26:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-10-04 14:26:07,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:07,745 INFO L375 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-10-04 14:26:07,745 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:07,746 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 49 times [2018-10-04 14:26:07,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:07,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:07,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:07,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:07,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-10-04 14:26:08,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:08,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:08,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-10-04 14:26:09,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:09,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:26:09,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:26:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:26:09,921 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:09,921 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-10-04 14:26:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:10,481 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-10-04 14:26:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:26:10,481 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-10-04 14:26:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:10,483 INFO L225 Difference]: With dead ends: 581 [2018-10-04 14:26:10,483 INFO L226 Difference]: Without dead ends: 579 [2018-10-04 14:26:10,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.2s impTime 47 [2018-10-04 14:26:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-04 14:26:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-10-04 14:26:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-10-04 14:26:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-10-04 14:26:10,763 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-10-04 14:26:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:10,763 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-10-04 14:26:10,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:26:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-10-04 14:26:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-04 14:26:10,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:10,767 INFO L375 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-10-04 14:26:10,767 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:10,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 50 times [2018-10-04 14:26:10,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:10,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-10-04 14:26:11,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:11,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:11,847 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:11,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:11,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-10-04 14:26:13,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:13,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:26:13,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:26:13,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:26:13,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:13,187 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-10-04 14:26:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:13,736 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-10-04 14:26:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:26:13,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-10-04 14:26:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:13,738 INFO L225 Difference]: With dead ends: 593 [2018-10-04 14:26:13,738 INFO L226 Difference]: Without dead ends: 591 [2018-10-04 14:26:13,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.3s impTime 48 [2018-10-04 14:26:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-10-04 14:26:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-10-04 14:26:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-04 14:26:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-10-04 14:26:14,057 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-10-04 14:26:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:14,058 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-10-04 14:26:14,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:26:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-10-04 14:26:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-04 14:26:14,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:14,060 INFO L375 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-10-04 14:26:14,061 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:14,061 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 51 times [2018-10-04 14:26:14,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:14,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:14,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:14,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-10-04 14:26:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:15,044 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:15,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:16,369 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 289 check-sat command(s) [2018-10-04 14:26:16,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:16,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-10-04 14:26:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:26:17,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:26:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:26:17,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:17,520 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-10-04 14:26:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:18,151 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-10-04 14:26:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:26:18,151 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-10-04 14:26:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:18,153 INFO L225 Difference]: With dead ends: 605 [2018-10-04 14:26:18,153 INFO L226 Difference]: Without dead ends: 603 [2018-10-04 14:26:18,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.5s impTime 49 [2018-10-04 14:26:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-04 14:26:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-10-04 14:26:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-04 14:26:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-10-04 14:26:18,491 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-10-04 14:26:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:18,491 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-10-04 14:26:18,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:26:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-10-04 14:26:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-10-04 14:26:18,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:18,494 INFO L375 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-10-04 14:26:18,495 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:18,495 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 52 times [2018-10-04 14:26:18,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:18,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-10-04 14:26:19,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:19,543 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:19,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:19,863 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:19,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:19,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-10-04 14:26:21,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:21,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:26:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:26:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:26:21,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:21,036 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-10-04 14:26:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:21,678 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-10-04 14:26:21,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:26:21,678 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-10-04 14:26:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:21,680 INFO L225 Difference]: With dead ends: 617 [2018-10-04 14:26:21,680 INFO L226 Difference]: Without dead ends: 615 [2018-10-04 14:26:21,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.5s impTime 50 [2018-10-04 14:26:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-10-04 14:26:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-10-04 14:26:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-04 14:26:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-10-04 14:26:22,029 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-10-04 14:26:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:22,030 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-10-04 14:26:22,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:26:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-10-04 14:26:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-04 14:26:22,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:22,033 INFO L375 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-10-04 14:26:22,033 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:22,033 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 53 times [2018-10-04 14:26:22,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:22,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:22,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-10-04 14:26:23,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:23,106 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:23,114 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:24,486 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 301 check-sat command(s) [2018-10-04 14:26:24,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:24,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-10-04 14:26:25,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:25,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:26:25,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:26:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:26:25,664 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:25,664 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-10-04 14:26:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:26,301 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-10-04 14:26:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:26:26,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-10-04 14:26:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:26,304 INFO L225 Difference]: With dead ends: 629 [2018-10-04 14:26:26,304 INFO L226 Difference]: Without dead ends: 627 [2018-10-04 14:26:26,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.5s impTime 51 [2018-10-04 14:26:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-04 14:26:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-10-04 14:26:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-04 14:26:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-10-04 14:26:26,673 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-10-04 14:26:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-10-04 14:26:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:26:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-10-04 14:26:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-10-04 14:26:26,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:26,677 INFO L375 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-10-04 14:26:26,677 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:26,677 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 54 times [2018-10-04 14:26:26,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:26,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:26,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-10-04 14:26:27,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:27,906 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:29,364 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 302 check-sat command(s) [2018-10-04 14:26:29,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:29,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-10-04 14:26:30,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:30,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:26:30,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:26:30,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:26:30,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:30,752 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-10-04 14:26:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:31,407 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-10-04 14:26:31,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:26:31,407 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-10-04 14:26:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:31,410 INFO L225 Difference]: With dead ends: 641 [2018-10-04 14:26:31,410 INFO L226 Difference]: Without dead ends: 639 [2018-10-04 14:26:31,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.5s impTime 52 [2018-10-04 14:26:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-04 14:26:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-10-04 14:26:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-04 14:26:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-10-04 14:26:31,792 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-10-04 14:26:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:31,792 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-10-04 14:26:31,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:26:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-10-04 14:26:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-04 14:26:31,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:31,795 INFO L375 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-10-04 14:26:31,796 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:31,796 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 55 times [2018-10-04 14:26:31,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:31,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:31,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-10-04 14:26:32,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:32,777 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:33,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-10-04 14:26:34,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:34,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:26:34,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:26:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:26:34,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:34,377 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-10-04 14:26:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:35,069 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-10-04 14:26:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:26:35,070 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-10-04 14:26:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:35,072 INFO L225 Difference]: With dead ends: 653 [2018-10-04 14:26:35,072 INFO L226 Difference]: Without dead ends: 651 [2018-10-04 14:26:35,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.3s impTime 53 [2018-10-04 14:26:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-10-04 14:26:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-10-04 14:26:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-04 14:26:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-10-04 14:26:35,471 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-10-04 14:26:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:35,471 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-10-04 14:26:35,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:26:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-10-04 14:26:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-04 14:26:35,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:35,475 INFO L375 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-10-04 14:26:35,475 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:35,475 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 56 times [2018-10-04 14:26:35,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:35,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:35,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:35,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-10-04 14:26:36,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:36,509 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:36,848 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:36,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:36,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-10-04 14:26:38,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:38,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:26:38,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:26:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:26:38,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:38,090 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-10-04 14:26:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:38,813 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-10-04 14:26:38,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:26:38,814 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-10-04 14:26:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:38,816 INFO L225 Difference]: With dead ends: 665 [2018-10-04 14:26:38,816 INFO L226 Difference]: Without dead ends: 663 [2018-10-04 14:26:38,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.4s impTime 54 [2018-10-04 14:26:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-04 14:26:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-10-04 14:26:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-04 14:26:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-10-04 14:26:39,230 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-10-04 14:26:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:39,231 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-10-04 14:26:39,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:26:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-10-04 14:26:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-10-04 14:26:39,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:39,234 INFO L375 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-10-04 14:26:39,234 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:39,234 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 57 times [2018-10-04 14:26:39,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:39,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:39,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:39,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:39,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-04 14:26:40,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:40,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:42,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 325 check-sat command(s) [2018-10-04 14:26:42,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:42,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-04 14:26:43,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:43,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:26:43,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:26:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:26:43,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:43,797 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-10-04 14:26:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:44,563 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-10-04 14:26:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:26:44,563 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-10-04 14:26:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:44,565 INFO L225 Difference]: With dead ends: 677 [2018-10-04 14:26:44,565 INFO L226 Difference]: Without dead ends: 675 [2018-10-04 14:26:44,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.6s impTime 55 [2018-10-04 14:26:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-10-04 14:26:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-10-04 14:26:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-04 14:26:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-10-04 14:26:45,003 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-10-04 14:26:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:45,004 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-10-04 14:26:45,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:26:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-10-04 14:26:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-10-04 14:26:45,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:45,007 INFO L375 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-10-04 14:26:45,007 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:45,007 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 58 times [2018-10-04 14:26:45,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:45,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-10-04 14:26:46,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:46,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:46,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:46,391 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:46,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:46,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-10-04 14:26:47,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:47,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:26:47,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:26:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:26:47,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:47,647 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-10-04 14:26:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:48,358 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-10-04 14:26:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:26:48,359 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-10-04 14:26:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:48,361 INFO L225 Difference]: With dead ends: 689 [2018-10-04 14:26:48,361 INFO L226 Difference]: Without dead ends: 687 [2018-10-04 14:26:48,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.3s impTime 56 [2018-10-04 14:26:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-04 14:26:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-10-04 14:26:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-04 14:26:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-10-04 14:26:48,784 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-10-04 14:26:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:48,785 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-10-04 14:26:48,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:26:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-10-04 14:26:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-04 14:26:48,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:48,788 INFO L375 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-10-04 14:26:48,788 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:48,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 59 times [2018-10-04 14:26:48,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:48,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:48,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-04 14:26:50,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:50,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:51,904 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 337 check-sat command(s) [2018-10-04 14:26:51,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:51,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-04 14:26:53,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:53,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:26:53,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:26:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:26:53,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:53,234 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-10-04 14:26:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:54,037 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-10-04 14:26:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:26:54,037 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-10-04 14:26:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:54,040 INFO L225 Difference]: With dead ends: 701 [2018-10-04 14:26:54,040 INFO L226 Difference]: Without dead ends: 699 [2018-10-04 14:26:54,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.7s impTime 57 [2018-10-04 14:26:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-04 14:26:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-10-04 14:26:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-10-04 14:26:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-10-04 14:26:54,479 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-10-04 14:26:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:54,479 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-10-04 14:26:54,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:26:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-10-04 14:26:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-10-04 14:26:54,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:54,482 INFO L375 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-10-04 14:26:54,482 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:54,483 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 60 times [2018-10-04 14:26:54,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:54,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:54,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-10-04 14:26:55,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:55,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:55,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:57,520 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 339 check-sat command(s) [2018-10-04 14:26:57,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:57,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-10-04 14:26:59,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:59,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:26:59,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:26:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:26:59,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:59,136 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-10-04 14:26:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:59,980 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-10-04 14:26:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:26:59,980 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-10-04 14:26:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:59,983 INFO L225 Difference]: With dead ends: 713 [2018-10-04 14:26:59,983 INFO L226 Difference]: Without dead ends: 711 [2018-10-04 14:26:59,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.6s impTime 58 [2018-10-04 14:26:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-10-04 14:27:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-10-04 14:27:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-04 14:27:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-10-04 14:27:00,473 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-10-04 14:27:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:00,473 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-10-04 14:27:00,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:27:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-10-04 14:27:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-04 14:27:00,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:00,477 INFO L375 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-10-04 14:27:00,477 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:00,477 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 61 times [2018-10-04 14:27:00,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:00,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-10-04 14:27:01,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:01,758 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:02,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-10-04 14:27:03,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:03,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 14:27:03,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 14:27:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 14:27:03,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:03,585 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-10-04 14:27:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:04,469 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-10-04 14:27:04,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 14:27:04,469 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-10-04 14:27:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:04,471 INFO L225 Difference]: With dead ends: 725 [2018-10-04 14:27:04,471 INFO L226 Difference]: Without dead ends: 723 [2018-10-04 14:27:04,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.6s impTime 59 [2018-10-04 14:27:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-10-04 14:27:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-10-04 14:27:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-10-04 14:27:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-10-04 14:27:04,980 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-10-04 14:27:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:04,981 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-10-04 14:27:04,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 14:27:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-10-04 14:27:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-10-04 14:27:04,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:04,985 INFO L375 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-10-04 14:27:04,985 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:04,985 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 62 times [2018-10-04 14:27:04,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:04,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-10-04 14:27:06,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:06,096 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:06,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:27:06,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:27:06,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:06,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-10-04 14:27:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:27:07,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:27:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:27:07,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:07,949 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-10-04 14:27:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:08,776 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-10-04 14:27:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:27:08,776 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-10-04 14:27:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:08,778 INFO L225 Difference]: With dead ends: 737 [2018-10-04 14:27:08,778 INFO L226 Difference]: Without dead ends: 735 [2018-10-04 14:27:08,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.4s impTime 60 [2018-10-04 14:27:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-10-04 14:27:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-10-04 14:27:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-04 14:27:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-10-04 14:27:09,308 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-10-04 14:27:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:09,308 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-10-04 14:27:09,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:27:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-10-04 14:27:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-10-04 14:27:09,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:09,312 INFO L375 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-10-04 14:27:09,313 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:09,313 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 63 times [2018-10-04 14:27:09,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:09,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:09,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-10-04 14:27:10,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:10,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:27:12,497 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 361 check-sat command(s) [2018-10-04 14:27:12,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:12,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-10-04 14:27:13,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:13,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 14:27:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 14:27:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 14:27:13,946 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:13,947 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-10-04 14:27:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:14,800 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-10-04 14:27:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:27:14,801 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-10-04 14:27:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:14,803 INFO L225 Difference]: With dead ends: 749 [2018-10-04 14:27:14,803 INFO L226 Difference]: Without dead ends: 747 [2018-10-04 14:27:14,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.4s impTime 61 [2018-10-04 14:27:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-10-04 14:27:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-10-04 14:27:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-10-04 14:27:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-10-04 14:27:15,379 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-10-04 14:27:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:15,380 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-10-04 14:27:15,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 14:27:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-10-04 14:27:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-10-04 14:27:15,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:15,384 INFO L375 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-10-04 14:27:15,384 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:15,384 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 64 times [2018-10-04 14:27:15,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:15,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-10-04 14:27:16,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:16,747 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:16,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:27:17,139 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:27:17,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:17,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-10-04 14:27:18,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:18,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:27:18,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:27:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:27:18,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:18,651 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-10-04 14:27:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:20,037 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-10-04 14:27:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:27:20,038 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-10-04 14:27:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:20,040 INFO L225 Difference]: With dead ends: 761 [2018-10-04 14:27:20,040 INFO L226 Difference]: Without dead ends: 759 [2018-10-04 14:27:20,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.6s impTime 62 [2018-10-04 14:27:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-04 14:27:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-10-04 14:27:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-10-04 14:27:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-10-04 14:27:20,610 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-10-04 14:27:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:20,611 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-10-04 14:27:20,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:27:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-10-04 14:27:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-10-04 14:27:20,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:20,615 INFO L375 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-10-04 14:27:20,615 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:20,615 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 65 times [2018-10-04 14:27:20,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:20,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:20,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-10-04 14:27:21,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:21,873 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:27:23,957 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 373 check-sat command(s) [2018-10-04 14:27:23,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:23,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-10-04 14:27:25,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:25,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 14:27:25,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 14:27:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 14:27:25,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:25,616 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-10-04 14:27:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:26,579 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-10-04 14:27:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:27:26,580 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-10-04 14:27:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:26,582 INFO L225 Difference]: With dead ends: 773 [2018-10-04 14:27:26,582 INFO L226 Difference]: Without dead ends: 771 [2018-10-04 14:27:26,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.5s impTime 63 [2018-10-04 14:27:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-10-04 14:27:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-10-04 14:27:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-10-04 14:27:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-10-04 14:27:27,176 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-10-04 14:27:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:27,176 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-10-04 14:27:27,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 14:27:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-10-04 14:27:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-04 14:27:27,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:27,180 INFO L375 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-10-04 14:27:27,180 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:27,180 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:27,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 66 times [2018-10-04 14:27:27,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:27,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:27,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-10-04 14:27:28,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:28,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:27:30,641 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 374 check-sat command(s) [2018-10-04 14:27:30,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:30,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-10-04 14:27:32,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:32,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:27:32,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:27:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:27:32,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:32,209 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-10-04 14:27:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:33,191 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-10-04 14:27:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:27:33,192 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-10-04 14:27:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:33,194 INFO L225 Difference]: With dead ends: 785 [2018-10-04 14:27:33,194 INFO L226 Difference]: Without dead ends: 783 [2018-10-04 14:27:33,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.4s impTime 64 [2018-10-04 14:27:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-04 14:27:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-10-04 14:27:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-10-04 14:27:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-10-04 14:27:33,872 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-10-04 14:27:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:33,873 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-10-04 14:27:33,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:27:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-10-04 14:27:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-10-04 14:27:33,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:33,877 INFO L375 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-10-04 14:27:33,877 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:33,877 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 67 times [2018-10-04 14:27:33,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:33,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:33,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-10-04 14:27:35,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:35,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:35,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:35,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-10-04 14:27:37,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:37,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 14:27:37,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 14:27:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 14:27:37,522 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:37,522 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-10-04 14:27:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:38,551 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-10-04 14:27:38,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:27:38,551 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-10-04 14:27:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:38,554 INFO L225 Difference]: With dead ends: 797 [2018-10-04 14:27:38,554 INFO L226 Difference]: Without dead ends: 795 [2018-10-04 14:27:38,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.7s impTime 65 [2018-10-04 14:27:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-04 14:27:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-10-04 14:27:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-04 14:27:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-10-04 14:27:39,192 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-10-04 14:27:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:39,192 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-10-04 14:27:39,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 14:27:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-10-04 14:27:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-10-04 14:27:39,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:39,196 INFO L375 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-10-04 14:27:39,197 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:39,197 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 68 times [2018-10-04 14:27:39,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:39,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:39,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:27:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-10-04 14:27:40,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:40,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:40,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:27:40,858 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:27:40,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:40,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-10-04 14:27:42,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:42,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:27:42,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:27:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:27:42,587 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:42,587 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-10-04 14:27:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:43,606 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-10-04 14:27:43,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:27:43,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-10-04 14:27:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:43,609 INFO L225 Difference]: With dead ends: 809 [2018-10-04 14:27:43,609 INFO L226 Difference]: Without dead ends: 807 [2018-10-04 14:27:43,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.4s impTime 66 [2018-10-04 14:27:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-10-04 14:27:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-10-04 14:27:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-10-04 14:27:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-10-04 14:27:44,209 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-10-04 14:27:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:44,209 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-10-04 14:27:44,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:27:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-10-04 14:27:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-10-04 14:27:44,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:44,214 INFO L375 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-10-04 14:27:44,214 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:44,214 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 69 times [2018-10-04 14:27:44,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:44,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-10-04 14:27:45,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:45,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:45,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:27:48,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 397 check-sat command(s) [2018-10-04 14:27:48,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:48,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-10-04 14:27:49,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:49,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 14:27:49,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 14:27:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 14:27:49,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:49,708 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-10-04 14:27:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:50,769 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-10-04 14:27:50,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:27:50,770 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-10-04 14:27:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:50,772 INFO L225 Difference]: With dead ends: 821 [2018-10-04 14:27:50,772 INFO L226 Difference]: Without dead ends: 819 [2018-10-04 14:27:50,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.5s impTime 67 [2018-10-04 14:27:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-04 14:27:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-10-04 14:27:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-04 14:27:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-10-04 14:27:51,458 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-10-04 14:27:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:51,458 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-10-04 14:27:51,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 14:27:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-10-04 14:27:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-10-04 14:27:51,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:51,463 INFO L375 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-10-04 14:27:51,463 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:51,463 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 70 times [2018-10-04 14:27:51,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:51,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-10-04 14:27:52,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:52,663 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:52,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:27:53,107 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:27:53,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:53,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-10-04 14:27:54,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:54,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:27:54,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:27:54,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:27:54,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:54,868 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-10-04 14:27:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:55,978 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-10-04 14:27:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:27:55,978 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-10-04 14:27:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:55,981 INFO L225 Difference]: With dead ends: 833 [2018-10-04 14:27:55,981 INFO L226 Difference]: Without dead ends: 831 [2018-10-04 14:27:55,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.3s impTime 68 [2018-10-04 14:27:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-10-04 14:27:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-10-04 14:27:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-04 14:27:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-10-04 14:27:56,692 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-10-04 14:27:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:56,693 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-10-04 14:27:56,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:27:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-10-04 14:27:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-10-04 14:27:56,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:56,698 INFO L375 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-10-04 14:27:56,698 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:56,698 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 71 times [2018-10-04 14:27:56,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:56,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:56,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:56,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-10-04 14:27:57,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:57,903 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:28:00,448 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 409 check-sat command(s) [2018-10-04 14:28:00,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:00,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-10-04 14:28:02,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:02,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 14:28:02,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 14:28:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 14:28:02,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:02,454 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-10-04 14:28:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:03,584 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-10-04 14:28:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 14:28:03,585 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-10-04 14:28:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:03,588 INFO L225 Difference]: With dead ends: 845 [2018-10-04 14:28:03,588 INFO L226 Difference]: Without dead ends: 843 [2018-10-04 14:28:03,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.3s impTime 69 [2018-10-04 14:28:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-10-04 14:28:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-10-04 14:28:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-10-04 14:28:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-10-04 14:28:04,325 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-10-04 14:28:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:04,326 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-10-04 14:28:04,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 14:28:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-10-04 14:28:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-04 14:28:04,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:04,330 INFO L375 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-10-04 14:28:04,331 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:04,331 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 72 times [2018-10-04 14:28:04,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:04,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:04,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:04,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:04,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-10-04 14:28:05,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:05,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:05,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:08,564 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 411 check-sat command(s) [2018-10-04 14:28:08,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:08,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-10-04 14:28:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:10,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:28:10,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:28:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:28:10,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:10,353 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-10-04 14:28:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:11,501 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-10-04 14:28:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:28:11,501 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-10-04 14:28:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:11,504 INFO L225 Difference]: With dead ends: 857 [2018-10-04 14:28:11,504 INFO L226 Difference]: Without dead ends: 855 [2018-10-04 14:28:11,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.7s impTime 70 [2018-10-04 14:28:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-10-04 14:28:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-10-04 14:28:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-04 14:28:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-10-04 14:28:12,274 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-10-04 14:28:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:12,275 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-10-04 14:28:12,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:28:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-10-04 14:28:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-04 14:28:12,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:12,280 INFO L375 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-10-04 14:28:12,280 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:12,280 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 73 times [2018-10-04 14:28:12,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:12,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:12,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-10-04 14:28:13,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:13,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:14,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-10-04 14:28:16,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 14:28:16,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 14:28:16,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 14:28:16,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:16,346 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-10-04 14:28:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:17,572 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-10-04 14:28:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 14:28:17,572 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-10-04 14:28:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:17,574 INFO L225 Difference]: With dead ends: 869 [2018-10-04 14:28:17,574 INFO L226 Difference]: Without dead ends: 867 [2018-10-04 14:28:17,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.5s impTime 71 [2018-10-04 14:28:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-04 14:28:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-10-04 14:28:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-04 14:28:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-10-04 14:28:18,356 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-10-04 14:28:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:18,356 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-10-04 14:28:18,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 14:28:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-10-04 14:28:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-10-04 14:28:18,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:18,361 INFO L375 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-10-04 14:28:18,362 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:18,362 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 74 times [2018-10-04 14:28:18,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:18,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:18,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:18,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:18,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-10-04 14:28:19,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:19,923 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:20,376 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:20,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:20,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-10-04 14:28:22,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:22,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:28:22,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:28:22,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:28:22,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:22,297 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-10-04 14:28:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:23,566 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-10-04 14:28:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:28:23,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-10-04 14:28:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:23,568 INFO L225 Difference]: With dead ends: 881 [2018-10-04 14:28:23,569 INFO L226 Difference]: Without dead ends: 879 [2018-10-04 14:28:23,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.5s impTime 72 [2018-10-04 14:28:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-10-04 14:28:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-10-04 14:28:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-10-04 14:28:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-10-04 14:28:24,417 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-10-04 14:28:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:24,417 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-10-04 14:28:24,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:28:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-10-04 14:28:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-10-04 14:28:24,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:24,422 INFO L375 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-10-04 14:28:24,423 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:24,423 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 75 times [2018-10-04 14:28:24,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:24,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:24,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-10-04 14:28:25,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:25,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:25,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Received shutdown request... [2018-10-04 14:28:28,912 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 433 check-sat command(s) [2018-10-04 14:28:28,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:28,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:28,959 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 14:28:29,160 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:29,161 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:28:29,166 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:28:29,167 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:28:29 BoogieIcfgContainer [2018-10-04 14:28:29,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:28:29,167 INFO L168 Benchmark]: Toolchain (without parser) took 245610.88 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 114.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:28:29,170 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:28:29,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:28:29,171 INFO L168 Benchmark]: Boogie Preprocessor took 18.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:28:29,171 INFO L168 Benchmark]: RCFGBuilder took 307.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:28:29,172 INFO L168 Benchmark]: TraceAbstraction took 245236.40 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 93.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:28:29,175 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 307.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245236.40 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 93.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 868 with TraceHistMax 720, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 245.1s OverallTime, 77 OverallIterations, 720 TraceHistogramMax, 41.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 302 SDtfs, 5250 SDslu, 3766 SDs, 0 SdLazy, 6620 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33733 GetRequests, 30841 SyntacticMatches, 0 SemanticMatches, 2892 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 97.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.7s AutomataMinimizationTime, 76 MinimizatonAttempts, 763 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.7s SsaConstructionTime, 41.6s SatisfiabilityAnalysisTime, 116.3s InterpolantComputationTime, 61760 NumberOfCodeBlocks, 61599 NumberOfCodeBlocksAsserted, 7582 NumberOfCheckSat, 61610 ConstructedInterpolants, 0 QuantifiedInterpolants, 105842072 SizeOfPredicates, 74 NumberOfNonLiveVariables, 123446 ConjunctsInSsa, 2728 ConjunctsInUnsatCore, 150 InterpolantComputations, 2 PerfectInterpolantSequences, 283643/14835409 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-28-29-192.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-28-29-192.csv Completed graceful shutdown