java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:40:51,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:40:51,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:40:51,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:40:51,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:40:51,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:40:51,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:40:51,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:40:51,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:40:51,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:40:51,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:40:51,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:40:51,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:40:51,304 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:40:51,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:40:51,306 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:40:51,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:40:51,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:40:51,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:40:51,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:40:51,315 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:40:51,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:40:51,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:40:51,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:40:51,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:40:51,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:40:51,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:40:51,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:40:51,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:40:51,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:40:51,324 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:40:51,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:40:51,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:40:51,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:40:51,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:40:51,327 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:40:51,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:40:51,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:40:51,341 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:40:51,341 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:40:51,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:40:51,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:40:51,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:40:51,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:40:51,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:40:51,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:40:51,344 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:40:51,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:40:51,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:40:51,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:40:51,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:40:51,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:40:51,345 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:40:51,346 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:40:51,347 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:40:51,402 INFO ]: Repository-Root is: /tmp [2018-06-22 01:40:51,419 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:40:51,426 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:40:51,428 INFO ]: Initializing SmtParser... [2018-06-22 01:40:51,428 INFO ]: SmtParser initialized [2018-06-22 01:40:51,429 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 [2018-06-22 01:40:51,430 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:40:51,527 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 unknown [2018-06-22 01:40:51,662 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 [2018-06-22 01:40:51,670 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:40:51,676 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:40:51,676 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:40:51,676 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:40:51,676 INFO ]: ChcToBoogie initialized [2018-06-22 01:40:51,680 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,737 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51 Unit [2018-06-22 01:40:51,738 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:40:51,738 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:40:51,738 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:40:51,738 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:40:51,761 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,761 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,771 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,771 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,774 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,777 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,778 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... [2018-06-22 01:40:51,780 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:40:51,780 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:40:51,780 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:40:51,780 INFO ]: RCFGBuilder initialized [2018-06-22 01:40:51,784 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:40:51,798 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:40:51,798 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:40:51,798 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:40:51,798 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:40:51,798 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:40:51,798 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:40:52,150 INFO ]: Using library mode [2018-06-22 01:40:52,151 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:40:52 BoogieIcfgContainer [2018-06-22 01:40:52,151 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:40:52,152 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:40:52,152 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:40:52,162 INFO ]: TraceAbstraction initialized [2018-06-22 01:40:52,162 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:40:51" (1/3) ... [2018-06-22 01:40:52,163 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d830427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:40:52, skipping insertion in model container [2018-06-22 01:40:52,164 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:40:51" (2/3) ... [2018-06-22 01:40:52,164 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d830427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:40:52, skipping insertion in model container [2018-06-22 01:40:52,164 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:40:52" (3/3) ... [2018-06-22 01:40:52,166 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:40:52,186 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:40:52,202 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:40:52,297 INFO ]: Using default assertion order modulation [2018-06-22 01:40:52,297 INFO ]: Interprodecural is true [2018-06-22 01:40:52,297 INFO ]: Hoare is false [2018-06-22 01:40:52,298 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:40:52,298 INFO ]: Backedges is TWOTRACK [2018-06-22 01:40:52,298 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:40:52,298 INFO ]: Difference is false [2018-06-22 01:40:52,298 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:40:52,298 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:40:52,320 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 01:40:52,338 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:40:52,338 INFO ]: Found error trace [2018-06-22 01:40:52,339 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:52,339 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:52,345 INFO ]: Analyzing trace with hash 81667677, now seen corresponding path program 1 times [2018-06-22 01:40:52,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:52,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:52,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:52,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:52,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:52,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:52,510 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:40:52,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:40:52,512 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:40:52,514 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:40:52,524 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:40:52,525 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:40:52,527 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 01:40:52,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:52,712 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-22 01:40:52,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:40:52,714 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-22 01:40:52,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:52,723 INFO ]: With dead ends: 19 [2018-06-22 01:40:52,723 INFO ]: Without dead ends: 19 [2018-06-22 01:40:52,726 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:40:52,745 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:40:52,775 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:40:52,777 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:40:52,778 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-22 01:40:52,780 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 7 [2018-06-22 01:40:52,781 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:52,781 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-22 01:40:52,781 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:40:52,781 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-22 01:40:52,784 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:40:52,784 INFO ]: Found error trace [2018-06-22 01:40:52,784 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:52,785 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:52,785 INFO ]: Analyzing trace with hash 1858802692, now seen corresponding path program 1 times [2018-06-22 01:40:52,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:52,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:52,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:52,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:52,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:52,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:53,156 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:53,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:53,156 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:53,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:53,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:53,217 INFO ]: Computing forward predicates... [2018-06-22 01:40:53,341 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:53,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:53,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:40:53,377 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:40:53,377 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:40:53,377 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:40:53,377 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 7 states. [2018-06-22 01:40:53,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:53,849 INFO ]: Finished difference Result 27 states and 33 transitions. [2018-06-22 01:40:53,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:40:53,850 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-22 01:40:53,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:53,851 INFO ]: With dead ends: 27 [2018-06-22 01:40:53,851 INFO ]: Without dead ends: 26 [2018-06-22 01:40:53,852 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:40:53,852 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 01:40:53,857 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 01:40:53,857 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:40:53,858 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 01:40:53,858 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2018-06-22 01:40:53,858 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:53,858 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 01:40:53,858 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:40:53,858 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 01:40:53,859 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:40:53,859 INFO ]: Found error trace [2018-06-22 01:40:53,859 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:53,859 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:53,859 INFO ]: Analyzing trace with hash -1187191800, now seen corresponding path program 1 times [2018-06-22 01:40:53,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:53,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:53,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:53,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:53,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:53,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:54,182 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:54,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:54,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:54,192 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:54,205 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:54,207 INFO ]: Computing forward predicates... [2018-06-22 01:40:54,300 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:54,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:54,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:40:54,322 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:40:54,322 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:40:54,322 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:40:54,322 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 12 states. [2018-06-22 01:40:54,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:54,766 INFO ]: Finished difference Result 33 states and 40 transitions. [2018-06-22 01:40:54,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:40:54,767 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 01:40:54,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:54,768 INFO ]: With dead ends: 33 [2018-06-22 01:40:54,768 INFO ]: Without dead ends: 33 [2018-06-22 01:40:54,768 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:40:54,768 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:40:54,772 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-06-22 01:40:54,772 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:40:54,773 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 01:40:54,773 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2018-06-22 01:40:54,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:54,773 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 01:40:54,773 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:40:54,773 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 01:40:54,774 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:40:54,774 INFO ]: Found error trace [2018-06-22 01:40:54,774 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:54,774 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:54,774 INFO ]: Analyzing trace with hash 1786424296, now seen corresponding path program 2 times [2018-06-22 01:40:54,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:54,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:54,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:54,775 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:54,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:54,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:54,840 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:54,840 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:54,840 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:54,852 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:40:54,873 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:40:54,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:54,875 INFO ]: Computing forward predicates... [2018-06-22 01:40:55,022 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:55,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:55,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 01:40:55,044 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:40:55,044 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:40:55,044 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:40:55,044 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 11 states. [2018-06-22 01:40:55,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:55,303 INFO ]: Finished difference Result 33 states and 38 transitions. [2018-06-22 01:40:55,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:40:55,305 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 01:40:55,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:55,306 INFO ]: With dead ends: 33 [2018-06-22 01:40:55,306 INFO ]: Without dead ends: 27 [2018-06-22 01:40:55,306 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:40:55,306 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:40:55,309 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 01:40:55,309 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:40:55,310 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-22 01:40:55,310 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2018-06-22 01:40:55,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:55,311 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-22 01:40:55,311 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:40:55,311 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-22 01:40:55,311 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:40:55,311 INFO ]: Found error trace [2018-06-22 01:40:55,311 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:55,312 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:55,312 INFO ]: Analyzing trace with hash 1849875556, now seen corresponding path program 3 times [2018-06-22 01:40:55,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:55,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:55,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:55,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:55,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:55,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:55,466 INFO ]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:55,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:55,466 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:55,472 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:40:55,505 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:40:55,505 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:55,507 INFO ]: Computing forward predicates... [2018-06-22 01:40:55,584 INFO ]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:55,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:55,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 01:40:55,605 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:40:55,605 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:40:55,605 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:40:55,606 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 10 states. [2018-06-22 01:40:55,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:55,730 INFO ]: Finished difference Result 36 states and 43 transitions. [2018-06-22 01:40:55,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:40:55,731 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 01:40:55,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:55,732 INFO ]: With dead ends: 36 [2018-06-22 01:40:55,732 INFO ]: Without dead ends: 36 [2018-06-22 01:40:55,732 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:40:55,732 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:40:55,736 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 01:40:55,736 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:40:55,737 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-06-22 01:40:55,737 INFO ]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-06-22 01:40:55,737 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:55,737 INFO ]: Abstraction has 34 states and 41 transitions. [2018-06-22 01:40:55,737 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:40:55,737 INFO ]: Start isEmpty. Operand 34 states and 41 transitions. [2018-06-22 01:40:55,738 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:40:55,738 INFO ]: Found error trace [2018-06-22 01:40:55,738 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:55,738 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:55,738 INFO ]: Analyzing trace with hash -478102680, now seen corresponding path program 4 times [2018-06-22 01:40:55,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:55,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:55,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:55,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:55,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:55,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:55,904 INFO ]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:55,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:55,904 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:55,911 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:40:55,938 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:40:55,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:55,940 INFO ]: Computing forward predicates... [2018-06-22 01:40:56,062 INFO ]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:56,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:56,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:40:56,082 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:40:56,082 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:40:56,082 INFO ]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:40:56,083 INFO ]: Start difference. First operand 34 states and 41 transitions. Second operand 13 states. [2018-06-22 01:40:56,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:56,181 INFO ]: Finished difference Result 38 states and 45 transitions. [2018-06-22 01:40:56,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:40:56,184 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:40:56,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:56,184 INFO ]: With dead ends: 38 [2018-06-22 01:40:56,185 INFO ]: Without dead ends: 38 [2018-06-22 01:40:56,185 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:40:56,185 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:40:56,188 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-06-22 01:40:56,188 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:40:56,189 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-06-22 01:40:56,190 INFO ]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2018-06-22 01:40:56,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:56,190 INFO ]: Abstraction has 29 states and 34 transitions. [2018-06-22 01:40:56,190 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:40:56,190 INFO ]: Start isEmpty. Operand 29 states and 34 transitions. [2018-06-22 01:40:56,190 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:40:56,191 INFO ]: Found error trace [2018-06-22 01:40:56,191 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:56,191 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:56,191 INFO ]: Analyzing trace with hash 1509683080, now seen corresponding path program 5 times [2018-06-22 01:40:56,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:56,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:56,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:56,192 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:56,192 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:56,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:56,308 INFO ]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:56,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:56,308 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:56,324 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:40:56,343 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:40:56,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:56,345 INFO ]: Computing forward predicates... [2018-06-22 01:40:56,409 INFO ]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:56,430 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:56,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:40:56,430 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:40:56,431 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:40:56,431 INFO ]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:40:56,431 INFO ]: Start difference. First operand 29 states and 34 transitions. Second operand 13 states. [2018-06-22 01:40:56,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:56,555 INFO ]: Finished difference Result 40 states and 47 transitions. [2018-06-22 01:40:56,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:40:56,556 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:40:56,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:56,557 INFO ]: With dead ends: 40 [2018-06-22 01:40:56,557 INFO ]: Without dead ends: 30 [2018-06-22 01:40:56,557 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:40:56,557 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:40:56,561 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 01:40:56,561 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:40:56,562 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-22 01:40:56,562 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2018-06-22 01:40:56,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:56,562 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-22 01:40:56,562 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:40:56,562 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-22 01:40:56,563 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:40:56,563 INFO ]: Found error trace [2018-06-22 01:40:56,563 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:56,563 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:56,563 INFO ]: Analyzing trace with hash -1938165500, now seen corresponding path program 6 times [2018-06-22 01:40:56,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:56,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:56,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:56,565 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:56,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:56,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:56,725 INFO ]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:56,725 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:56,725 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:56,731 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:40:56,783 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:40:56,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:56,786 INFO ]: Computing forward predicates... [2018-06-22 01:40:56,983 INFO ]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:57,004 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:57,004 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 01:40:57,004 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:40:57,004 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:40:57,004 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:40:57,004 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 13 states. [2018-06-22 01:40:57,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:57,100 INFO ]: Finished difference Result 41 states and 48 transitions. [2018-06-22 01:40:57,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:40:57,101 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:40:57,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:57,102 INFO ]: With dead ends: 41 [2018-06-22 01:40:57,102 INFO ]: Without dead ends: 41 [2018-06-22 01:40:57,102 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:40:57,102 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:40:57,106 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-22 01:40:57,106 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:40:57,107 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-22 01:40:57,107 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2018-06-22 01:40:57,107 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:57,107 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-22 01:40:57,107 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:40:57,108 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-22 01:40:57,108 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:40:57,108 INFO ]: Found error trace [2018-06-22 01:40:57,108 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:57,108 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:57,109 INFO ]: Analyzing trace with hash -1447289080, now seen corresponding path program 7 times [2018-06-22 01:40:57,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:57,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:57,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:57,109 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:57,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:57,120 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:57,196 INFO ]: Checked inductivity of 25 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:57,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:57,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:57,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:57,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:57,220 INFO ]: Computing forward predicates... [2018-06-22 01:40:57,271 INFO ]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:57,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:57,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-22 01:40:57,292 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:40:57,292 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:40:57,293 INFO ]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:40:57,293 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 15 states. [2018-06-22 01:40:57,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:57,537 INFO ]: Finished difference Result 43 states and 50 transitions. [2018-06-22 01:40:57,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:40:57,538 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-22 01:40:57,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:57,538 INFO ]: With dead ends: 43 [2018-06-22 01:40:57,538 INFO ]: Without dead ends: 43 [2018-06-22 01:40:57,539 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:40:57,539 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:40:57,542 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-06-22 01:40:57,542 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:40:57,543 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-06-22 01:40:57,543 INFO ]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2018-06-22 01:40:57,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:57,544 INFO ]: Abstraction has 32 states and 37 transitions. [2018-06-22 01:40:57,544 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:40:57,544 INFO ]: Start isEmpty. Operand 32 states and 37 transitions. [2018-06-22 01:40:57,544 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:40:57,544 INFO ]: Found error trace [2018-06-22 01:40:57,544 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:57,544 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:57,545 INFO ]: Analyzing trace with hash 44527336, now seen corresponding path program 8 times [2018-06-22 01:40:57,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:57,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:57,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:57,545 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:40:57,545 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:57,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:57,702 INFO ]: Checked inductivity of 25 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:57,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:57,702 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:57,708 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:40:57,736 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:40:57,736 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:57,738 INFO ]: Computing forward predicates... [2018-06-22 01:40:57,855 INFO ]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:57,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:57,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-06-22 01:40:57,876 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:40:57,876 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:40:57,877 INFO ]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:40:57,877 INFO ]: Start difference. First operand 32 states and 37 transitions. Second operand 18 states. [2018-06-22 01:40:58,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:58,037 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-22 01:40:58,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:40:58,037 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-22 01:40:58,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:58,037 INFO ]: With dead ends: 43 [2018-06-22 01:40:58,037 INFO ]: Without dead ends: 33 [2018-06-22 01:40:58,038 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:40:58,038 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:40:58,040 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 01:40:58,040 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:40:58,041 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-06-22 01:40:58,041 INFO ]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-06-22 01:40:58,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:58,041 INFO ]: Abstraction has 33 states and 38 transitions. [2018-06-22 01:40:58,041 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:40:58,041 INFO ]: Start isEmpty. Operand 33 states and 38 transitions. [2018-06-22 01:40:58,042 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:40:58,042 INFO ]: Found error trace [2018-06-22 01:40:58,042 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:58,042 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:58,042 INFO ]: Analyzing trace with hash -1918172828, now seen corresponding path program 9 times [2018-06-22 01:40:58,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:58,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:58,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:58,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:58,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:58,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:58,518 INFO ]: Checked inductivity of 32 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:58,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:58,518 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:58,525 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:40:58,541 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:40:58,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:58,543 INFO ]: Computing forward predicates... [2018-06-22 01:40:58,701 INFO ]: Checked inductivity of 32 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:58,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:58,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 01:40:58,735 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:40:58,735 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:40:58,735 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:40:58,735 INFO ]: Start difference. First operand 33 states and 38 transitions. Second operand 16 states. [2018-06-22 01:40:58,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:58,825 INFO ]: Finished difference Result 46 states and 53 transitions. [2018-06-22 01:40:58,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:40:58,828 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 01:40:58,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:58,829 INFO ]: With dead ends: 46 [2018-06-22 01:40:58,829 INFO ]: Without dead ends: 46 [2018-06-22 01:40:58,829 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:40:58,829 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:40:58,833 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-06-22 01:40:58,833 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:40:58,834 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-06-22 01:40:58,834 INFO ]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-06-22 01:40:58,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:58,834 INFO ]: Abstraction has 40 states and 47 transitions. [2018-06-22 01:40:58,834 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:40:58,834 INFO ]: Start isEmpty. Operand 40 states and 47 transitions. [2018-06-22 01:40:58,835 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:40:58,835 INFO ]: Found error trace [2018-06-22 01:40:58,835 INFO ]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:58,835 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:58,835 INFO ]: Analyzing trace with hash 1662631528, now seen corresponding path program 10 times [2018-06-22 01:40:58,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:58,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:58,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:58,837 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:58,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:58,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:58,997 INFO ]: Checked inductivity of 40 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:58,997 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:59,017 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:59,023 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:40:59,044 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:40:59,044 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:59,046 INFO ]: Computing forward predicates... [2018-06-22 01:40:59,104 INFO ]: Checked inductivity of 40 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:59,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:59,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-06-22 01:40:59,125 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:40:59,125 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:40:59,125 INFO ]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:40:59,126 INFO ]: Start difference. First operand 40 states and 47 transitions. Second operand 17 states. [2018-06-22 01:40:59,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:59,240 INFO ]: Finished difference Result 48 states and 55 transitions. [2018-06-22 01:40:59,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:40:59,240 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 01:40:59,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:59,241 INFO ]: With dead ends: 48 [2018-06-22 01:40:59,241 INFO ]: Without dead ends: 48 [2018-06-22 01:40:59,241 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:40:59,241 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:40:59,244 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-06-22 01:40:59,244 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:40:59,245 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-22 01:40:59,245 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 22 [2018-06-22 01:40:59,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:59,245 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-22 01:40:59,245 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:40:59,245 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-22 01:40:59,246 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:40:59,246 INFO ]: Found error trace [2018-06-22 01:40:59,246 INFO ]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:59,247 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:59,247 INFO ]: Analyzing trace with hash 664300168, now seen corresponding path program 11 times [2018-06-22 01:40:59,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:59,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:59,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:59,247 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:59,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:59,256 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:59,412 INFO ]: Checked inductivity of 40 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:59,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:59,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:59,418 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:40:59,437 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:40:59,437 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:59,439 INFO ]: Computing forward predicates... [2018-06-22 01:40:59,503 INFO ]: Checked inductivity of 40 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:59,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:40:59,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-06-22 01:40:59,523 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:40:59,523 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:40:59,523 INFO ]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:40:59,524 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 17 states. [2018-06-22 01:40:59,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:40:59,720 INFO ]: Finished difference Result 50 states and 57 transitions. [2018-06-22 01:40:59,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:40:59,720 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 01:40:59,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:40:59,721 INFO ]: With dead ends: 50 [2018-06-22 01:40:59,721 INFO ]: Without dead ends: 36 [2018-06-22 01:40:59,722 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:40:59,722 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:40:59,724 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 01:40:59,724 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:40:59,725 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-06-22 01:40:59,725 INFO ]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2018-06-22 01:40:59,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:40:59,725 INFO ]: Abstraction has 36 states and 41 transitions. [2018-06-22 01:40:59,725 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:40:59,725 INFO ]: Start isEmpty. Operand 36 states and 41 transitions. [2018-06-22 01:40:59,726 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:40:59,726 INFO ]: Found error trace [2018-06-22 01:40:59,726 INFO ]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:40:59,726 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:40:59,726 INFO ]: Analyzing trace with hash 85508, now seen corresponding path program 12 times [2018-06-22 01:40:59,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:40:59,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:40:59,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:59,727 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:40:59,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:40:59,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:59,960 INFO ]: Checked inductivity of 49 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:40:59,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:40:59,960 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:40:59,967 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:40:59,986 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:40:59,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:40:59,988 INFO ]: Computing forward predicates... [2018-06-22 01:41:00,124 INFO ]: Checked inductivity of 49 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:00,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:00,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-22 01:41:00,151 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:41:00,151 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:41:00,151 INFO ]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:41:00,151 INFO ]: Start difference. First operand 36 states and 41 transitions. Second operand 19 states. [2018-06-22 01:41:00,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:00,306 INFO ]: Finished difference Result 51 states and 58 transitions. [2018-06-22 01:41:00,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:41:00,307 INFO ]: Start accepts. Automaton has 19 states. Word has length 23 [2018-06-22 01:41:00,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:00,307 INFO ]: With dead ends: 51 [2018-06-22 01:41:00,307 INFO ]: Without dead ends: 51 [2018-06-22 01:41:00,308 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:41:00,308 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:41:00,311 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-22 01:41:00,311 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:41:00,312 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-22 01:41:00,312 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 23 [2018-06-22 01:41:00,312 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:00,312 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-22 01:41:00,312 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:41:00,312 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-22 01:41:00,313 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:41:00,313 INFO ]: Found error trace [2018-06-22 01:41:00,313 INFO ]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:00,313 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:00,313 INFO ]: Analyzing trace with hash 884267528, now seen corresponding path program 13 times [2018-06-22 01:41:00,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:00,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:00,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:00,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:00,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:00,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:00,492 INFO ]: Checked inductivity of 59 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:00,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:00,492 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:00,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:00,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:00,527 INFO ]: Computing forward predicates... [2018-06-22 01:41:00,599 INFO ]: Checked inductivity of 59 backedges. 17 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:00,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:00,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-22 01:41:00,619 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:41:00,619 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:41:00,619 INFO ]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:41:00,619 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 19 states. [2018-06-22 01:41:00,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:00,706 INFO ]: Finished difference Result 53 states and 60 transitions. [2018-06-22 01:41:00,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:41:00,707 INFO ]: Start accepts. Automaton has 19 states. Word has length 24 [2018-06-22 01:41:00,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:00,707 INFO ]: With dead ends: 53 [2018-06-22 01:41:00,707 INFO ]: Without dead ends: 53 [2018-06-22 01:41:00,707 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:41:00,707 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:41:00,712 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-06-22 01:41:00,712 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:41:00,713 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-06-22 01:41:00,713 INFO ]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-06-22 01:41:00,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:00,713 INFO ]: Abstraction has 38 states and 43 transitions. [2018-06-22 01:41:00,713 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:41:00,713 INFO ]: Start isEmpty. Operand 38 states and 43 transitions. [2018-06-22 01:41:00,714 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:41:00,714 INFO ]: Found error trace [2018-06-22 01:41:00,714 INFO ]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:00,714 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:00,714 INFO ]: Analyzing trace with hash 766440, now seen corresponding path program 14 times [2018-06-22 01:41:00,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:00,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:00,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:00,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:00,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:00,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:00,893 INFO ]: Checked inductivity of 59 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:00,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:00,893 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:00,899 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:00,917 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:00,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:00,919 INFO ]: Computing forward predicates... [2018-06-22 01:41:01,037 INFO ]: Checked inductivity of 59 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:01,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:01,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-06-22 01:41:01,058 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:41:01,058 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:41:01,058 INFO ]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:41:01,058 INFO ]: Start difference. First operand 38 states and 43 transitions. Second operand 26 states. [2018-06-22 01:41:01,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:01,361 INFO ]: Finished difference Result 53 states and 58 transitions. [2018-06-22 01:41:01,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:41:01,362 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-22 01:41:01,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:01,362 INFO ]: With dead ends: 53 [2018-06-22 01:41:01,362 INFO ]: Without dead ends: 39 [2018-06-22 01:41:01,363 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:41:01,363 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:41:01,365 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 01:41:01,365 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:41:01,366 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-22 01:41:01,366 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2018-06-22 01:41:01,366 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:01,366 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-22 01:41:01,366 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:41:01,366 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-22 01:41:01,367 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:41:01,367 INFO ]: Found error trace [2018-06-22 01:41:01,367 INFO ]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:01,367 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:01,367 INFO ]: Analyzing trace with hash 1640605284, now seen corresponding path program 15 times [2018-06-22 01:41:01,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:01,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:01,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:01,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:01,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:01,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:01,613 INFO ]: Checked inductivity of 70 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:01,613 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:01,613 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:01,619 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:41:01,642 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 01:41:01,642 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:01,644 INFO ]: Computing forward predicates... [2018-06-22 01:41:01,783 INFO ]: Checked inductivity of 70 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:01,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:01,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 22 [2018-06-22 01:41:01,804 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:41:01,804 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:41:01,804 INFO ]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:41:01,804 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 22 states. [2018-06-22 01:41:01,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:01,953 INFO ]: Finished difference Result 56 states and 63 transitions. [2018-06-22 01:41:01,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:41:01,953 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 01:41:01,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:01,954 INFO ]: With dead ends: 56 [2018-06-22 01:41:01,954 INFO ]: Without dead ends: 56 [2018-06-22 01:41:01,954 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:41:01,954 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 01:41:01,958 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-06-22 01:41:01,958 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:41:01,959 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-06-22 01:41:01,959 INFO ]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-06-22 01:41:01,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:01,959 INFO ]: Abstraction has 46 states and 53 transitions. [2018-06-22 01:41:01,959 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:41:01,959 INFO ]: Start isEmpty. Operand 46 states and 53 transitions. [2018-06-22 01:41:01,959 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:41:01,959 INFO ]: Found error trace [2018-06-22 01:41:01,960 INFO ]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:01,960 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:01,960 INFO ]: Analyzing trace with hash 936001896, now seen corresponding path program 16 times [2018-06-22 01:41:01,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:01,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:01,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:01,960 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:01,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:01,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:03,158 INFO ]: Checked inductivity of 82 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:03,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:03,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:03,163 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:41:03,182 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:41:03,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:03,184 INFO ]: Computing forward predicates... [2018-06-22 01:41:03,273 INFO ]: Checked inductivity of 82 backedges. 23 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:03,294 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:03,294 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-06-22 01:41:03,294 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:41:03,294 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:41:03,294 INFO ]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:41:03,294 INFO ]: Start difference. First operand 46 states and 53 transitions. Second operand 21 states. [2018-06-22 01:41:04,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:04,229 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-22 01:41:04,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:41:04,229 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-22 01:41:04,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:04,229 INFO ]: With dead ends: 58 [2018-06-22 01:41:04,229 INFO ]: Without dead ends: 58 [2018-06-22 01:41:04,230 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:41:04,230 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:41:04,232 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-06-22 01:41:04,232 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:41:04,232 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-22 01:41:04,232 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2018-06-22 01:41:04,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:04,232 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-22 01:41:04,232 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:41:04,232 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-22 01:41:04,233 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:41:04,233 INFO ]: Found error trace [2018-06-22 01:41:04,233 INFO ]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:04,233 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:04,233 INFO ]: Analyzing trace with hash -682728056, now seen corresponding path program 17 times [2018-06-22 01:41:04,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:04,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:04,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:04,234 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:04,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:04,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:04,453 INFO ]: Checked inductivity of 82 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:04,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:04,453 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:04,459 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:41:04,482 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:41:04,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:04,483 INFO ]: Computing forward predicates... [2018-06-22 01:41:04,707 INFO ]: Checked inductivity of 82 backedges. 23 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:04,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:04,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-06-22 01:41:04,728 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:41:04,728 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:41:04,728 INFO ]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:41:04,729 INFO ]: Start difference. First operand 41 states and 46 transitions. Second operand 21 states. [2018-06-22 01:41:04,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:04,983 INFO ]: Finished difference Result 60 states and 67 transitions. [2018-06-22 01:41:04,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:41:04,983 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-22 01:41:04,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:04,983 INFO ]: With dead ends: 60 [2018-06-22 01:41:04,983 INFO ]: Without dead ends: 42 [2018-06-22 01:41:04,984 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:41:04,984 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:41:04,986 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 01:41:04,986 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:41:04,986 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-22 01:41:04,986 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2018-06-22 01:41:04,986 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:04,986 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-22 01:41:04,986 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:41:04,986 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-22 01:41:04,987 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:41:04,987 INFO ]: Found error trace [2018-06-22 01:41:04,987 INFO ]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:04,987 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:04,987 INFO ]: Analyzing trace with hash -1050596604, now seen corresponding path program 18 times [2018-06-22 01:41:04,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:04,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:04,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:04,988 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:04,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:05,004 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:05,393 INFO ]: Checked inductivity of 95 backedges. 4 proven. 89 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:05,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:05,393 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:05,399 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:41:05,450 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 01:41:05,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:05,452 INFO ]: Computing forward predicates... [2018-06-22 01:41:05,622 INFO ]: Checked inductivity of 95 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:05,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:05,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 25 [2018-06-22 01:41:05,644 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:41:05,644 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:41:05,644 INFO ]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:41:05,644 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 25 states. [2018-06-22 01:41:05,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:05,890 INFO ]: Finished difference Result 61 states and 68 transitions. [2018-06-22 01:41:05,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:41:05,891 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-22 01:41:05,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:05,891 INFO ]: With dead ends: 61 [2018-06-22 01:41:05,891 INFO ]: Without dead ends: 61 [2018-06-22 01:41:05,892 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:41:05,892 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:41:05,895 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-06-22 01:41:05,895 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:41:05,895 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-06-22 01:41:05,895 INFO ]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-06-22 01:41:05,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:05,895 INFO ]: Abstraction has 49 states and 56 transitions. [2018-06-22 01:41:05,895 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:41:05,895 INFO ]: Start isEmpty. Operand 49 states and 56 transitions. [2018-06-22 01:41:05,896 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:41:05,896 INFO ]: Found error trace [2018-06-22 01:41:05,896 INFO ]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:05,896 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:05,896 INFO ]: Analyzing trace with hash 430380296, now seen corresponding path program 19 times [2018-06-22 01:41:05,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:05,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:05,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:05,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:05,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:05,906 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:06,100 INFO ]: Checked inductivity of 109 backedges. 17 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:06,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:06,100 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:06,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:06,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:06,141 INFO ]: Computing forward predicates... [2018-06-22 01:41:06,482 INFO ]: Checked inductivity of 109 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:06,503 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:06,503 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 23 [2018-06-22 01:41:06,503 INFO ]: Interpolant automaton has 23 states [2018-06-22 01:41:06,504 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 01:41:06,504 INFO ]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:41:06,504 INFO ]: Start difference. First operand 49 states and 56 transitions. Second operand 23 states. [2018-06-22 01:41:06,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:06,599 INFO ]: Finished difference Result 63 states and 70 transitions. [2018-06-22 01:41:06,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:41:06,599 INFO ]: Start accepts. Automaton has 23 states. Word has length 28 [2018-06-22 01:41:06,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:06,600 INFO ]: With dead ends: 63 [2018-06-22 01:41:06,600 INFO ]: Without dead ends: 63 [2018-06-22 01:41:06,600 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:41:06,600 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:41:06,602 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-06-22 01:41:06,602 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:41:06,603 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-06-22 01:41:06,603 INFO ]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2018-06-22 01:41:06,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:06,603 INFO ]: Abstraction has 44 states and 49 transitions. [2018-06-22 01:41:06,603 INFO ]: Interpolant automaton has 23 states. [2018-06-22 01:41:06,603 INFO ]: Start isEmpty. Operand 44 states and 49 transitions. [2018-06-22 01:41:06,603 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:41:06,603 INFO ]: Found error trace [2018-06-22 01:41:06,603 INFO ]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:06,603 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:06,604 INFO ]: Analyzing trace with hash 1789359336, now seen corresponding path program 20 times [2018-06-22 01:41:06,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:06,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:06,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:06,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:06,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:06,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:06,804 INFO ]: Checked inductivity of 109 backedges. 17 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:06,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:06,804 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:06,819 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:06,839 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:06,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:06,842 INFO ]: Computing forward predicates... [2018-06-22 01:41:07,125 INFO ]: Checked inductivity of 109 backedges. 16 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:07,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:07,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-06-22 01:41:07,145 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:41:07,145 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:41:07,146 INFO ]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:41:07,146 INFO ]: Start difference. First operand 44 states and 49 transitions. Second operand 34 states. [2018-06-22 01:41:07,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:07,710 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-22 01:41:07,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:41:07,712 INFO ]: Start accepts. Automaton has 34 states. Word has length 28 [2018-06-22 01:41:07,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:07,713 INFO ]: With dead ends: 63 [2018-06-22 01:41:07,713 INFO ]: Without dead ends: 45 [2018-06-22 01:41:07,713 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:41:07,713 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 01:41:07,714 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-22 01:41:07,715 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:41:07,715 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-06-22 01:41:07,715 INFO ]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 28 [2018-06-22 01:41:07,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:07,715 INFO ]: Abstraction has 45 states and 50 transitions. [2018-06-22 01:41:07,715 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:41:07,715 INFO ]: Start isEmpty. Operand 45 states and 50 transitions. [2018-06-22 01:41:07,716 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:41:07,716 INFO ]: Found error trace [2018-06-22 01:41:07,716 INFO ]: trace histogram [14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:07,716 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:07,716 INFO ]: Analyzing trace with hash 455002980, now seen corresponding path program 21 times [2018-06-22 01:41:07,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:07,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:07,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:07,716 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:07,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:07,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:08,172 INFO ]: Checked inductivity of 124 backedges. 4 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:08,172 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:08,172 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:08,178 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:41:08,204 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 01:41:08,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:08,206 INFO ]: Computing forward predicates... [2018-06-22 01:41:08,385 INFO ]: Checked inductivity of 124 backedges. 2 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:08,404 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:08,404 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2018-06-22 01:41:08,404 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:41:08,404 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:41:08,404 INFO ]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:41:08,404 INFO ]: Start difference. First operand 45 states and 50 transitions. Second operand 28 states. [2018-06-22 01:41:08,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:08,751 INFO ]: Finished difference Result 66 states and 73 transitions. [2018-06-22 01:41:08,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:41:08,752 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-22 01:41:08,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:08,752 INFO ]: With dead ends: 66 [2018-06-22 01:41:08,752 INFO ]: Without dead ends: 66 [2018-06-22 01:41:08,753 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:41:08,753 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:41:08,755 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-06-22 01:41:08,755 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:41:08,756 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-06-22 01:41:08,756 INFO ]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 29 [2018-06-22 01:41:08,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:08,756 INFO ]: Abstraction has 52 states and 59 transitions. [2018-06-22 01:41:08,756 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:41:08,756 INFO ]: Start isEmpty. Operand 52 states and 59 transitions. [2018-06-22 01:41:08,756 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:41:08,756 INFO ]: Found error trace [2018-06-22 01:41:08,756 INFO ]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:08,756 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:08,756 INFO ]: Analyzing trace with hash 2039628904, now seen corresponding path program 22 times [2018-06-22 01:41:08,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:08,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:08,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:08,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:08,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:08,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:08,979 INFO ]: Checked inductivity of 140 backedges. 23 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:08,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:08,979 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:08,984 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:41:09,006 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:41:09,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:09,047 INFO ]: Computing forward predicates... [2018-06-22 01:41:09,132 INFO ]: Checked inductivity of 140 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:09,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:09,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 25 [2018-06-22 01:41:09,153 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:41:09,153 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:41:09,153 INFO ]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:41:09,153 INFO ]: Start difference. First operand 52 states and 59 transitions. Second operand 25 states. [2018-06-22 01:41:09,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:09,236 INFO ]: Finished difference Result 68 states and 75 transitions. [2018-06-22 01:41:09,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:41:09,237 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-22 01:41:09,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:09,237 INFO ]: With dead ends: 68 [2018-06-22 01:41:09,237 INFO ]: Without dead ends: 68 [2018-06-22 01:41:09,237 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:41:09,237 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 01:41:09,240 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-06-22 01:41:09,240 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:41:09,240 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-06-22 01:41:09,240 INFO ]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 30 [2018-06-22 01:41:09,240 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:09,240 INFO ]: Abstraction has 47 states and 52 transitions. [2018-06-22 01:41:09,240 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:41:09,240 INFO ]: Start isEmpty. Operand 47 states and 52 transitions. [2018-06-22 01:41:09,241 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:41:09,241 INFO ]: Found error trace [2018-06-22 01:41:09,241 INFO ]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:09,241 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:09,241 INFO ]: Analyzing trace with hash 1218306184, now seen corresponding path program 23 times [2018-06-22 01:41:09,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:09,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:09,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:09,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:09,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:09,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:09,481 INFO ]: Checked inductivity of 140 backedges. 23 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:09,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:09,482 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:09,487 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:41:09,514 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 01:41:09,514 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:09,515 INFO ]: Computing forward predicates... [2018-06-22 01:41:09,622 INFO ]: Checked inductivity of 140 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:09,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:09,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 25 [2018-06-22 01:41:09,642 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:41:09,642 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:41:09,642 INFO ]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:41:09,642 INFO ]: Start difference. First operand 47 states and 52 transitions. Second operand 25 states. [2018-06-22 01:41:09,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:09,802 INFO ]: Finished difference Result 70 states and 77 transitions. [2018-06-22 01:41:09,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:41:09,802 INFO ]: Start accepts. Automaton has 25 states. Word has length 30 [2018-06-22 01:41:09,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:09,803 INFO ]: With dead ends: 70 [2018-06-22 01:41:09,803 INFO ]: Without dead ends: 48 [2018-06-22 01:41:09,803 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:41:09,803 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:41:09,805 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 01:41:09,805 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:41:09,805 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-06-22 01:41:09,805 INFO ]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2018-06-22 01:41:09,805 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:09,805 INFO ]: Abstraction has 48 states and 53 transitions. [2018-06-22 01:41:09,805 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:41:09,805 INFO ]: Start isEmpty. Operand 48 states and 53 transitions. [2018-06-22 01:41:09,806 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:41:09,806 INFO ]: Found error trace [2018-06-22 01:41:09,806 INFO ]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:09,806 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:09,806 INFO ]: Analyzing trace with hash -1197897724, now seen corresponding path program 24 times [2018-06-22 01:41:09,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:09,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:09,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:09,806 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:09,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:09,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:10,295 INFO ]: Checked inductivity of 157 backedges. 4 proven. 151 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:10,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:10,295 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:10,302 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:41:10,337 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 01:41:10,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:10,340 INFO ]: Computing forward predicates... [2018-06-22 01:41:10,641 INFO ]: Checked inductivity of 157 backedges. 2 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:10,661 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:10,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 31 [2018-06-22 01:41:10,661 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:41:10,661 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:41:10,662 INFO ]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:41:10,662 INFO ]: Start difference. First operand 48 states and 53 transitions. Second operand 31 states. [2018-06-22 01:41:11,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:11,030 INFO ]: Finished difference Result 71 states and 78 transitions. [2018-06-22 01:41:11,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:41:11,035 INFO ]: Start accepts. Automaton has 31 states. Word has length 31 [2018-06-22 01:41:11,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:11,036 INFO ]: With dead ends: 71 [2018-06-22 01:41:11,036 INFO ]: Without dead ends: 71 [2018-06-22 01:41:11,036 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:41:11,036 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 01:41:11,040 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-06-22 01:41:11,040 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:41:11,041 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-06-22 01:41:11,041 INFO ]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 31 [2018-06-22 01:41:11,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:11,041 INFO ]: Abstraction has 55 states and 62 transitions. [2018-06-22 01:41:11,041 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:41:11,041 INFO ]: Start isEmpty. Operand 55 states and 62 transitions. [2018-06-22 01:41:11,042 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:41:11,042 INFO ]: Found error trace [2018-06-22 01:41:11,042 INFO ]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:11,042 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:11,042 INFO ]: Analyzing trace with hash 1209192456, now seen corresponding path program 25 times [2018-06-22 01:41:11,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:11,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:11,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:11,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:11,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:11,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:11,736 INFO ]: Checked inductivity of 175 backedges. 30 proven. 143 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:11,736 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:11,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:11,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:11,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:11,774 INFO ]: Computing forward predicates... [2018-06-22 01:41:11,870 INFO ]: Checked inductivity of 175 backedges. 47 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:11,902 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:11,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 27 [2018-06-22 01:41:11,903 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:41:11,903 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:41:11,903 INFO ]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:41:11,903 INFO ]: Start difference. First operand 55 states and 62 transitions. Second operand 27 states. [2018-06-22 01:41:12,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:12,119 INFO ]: Finished difference Result 73 states and 80 transitions. [2018-06-22 01:41:12,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:41:12,119 INFO ]: Start accepts. Automaton has 27 states. Word has length 32 [2018-06-22 01:41:12,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:12,119 INFO ]: With dead ends: 73 [2018-06-22 01:41:12,119 INFO ]: Without dead ends: 73 [2018-06-22 01:41:12,120 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:41:12,120 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 01:41:12,122 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 50. [2018-06-22 01:41:12,122 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:41:12,123 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-06-22 01:41:12,123 INFO ]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 32 [2018-06-22 01:41:12,123 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:12,123 INFO ]: Abstraction has 50 states and 55 transitions. [2018-06-22 01:41:12,123 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:41:12,123 INFO ]: Start isEmpty. Operand 50 states and 55 transitions. [2018-06-22 01:41:12,123 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:41:12,123 INFO ]: Found error trace [2018-06-22 01:41:12,123 INFO ]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:12,123 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:12,124 INFO ]: Analyzing trace with hash 1517991912, now seen corresponding path program 26 times [2018-06-22 01:41:12,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:12,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:12,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:12,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:12,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:12,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:12,585 INFO ]: Checked inductivity of 175 backedges. 30 proven. 143 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:12,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:12,585 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:12,591 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:12,615 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:12,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:12,618 INFO ]: Computing forward predicates... [2018-06-22 01:41:12,892 INFO ]: Checked inductivity of 175 backedges. 20 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:12,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:12,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-06-22 01:41:12,911 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:41:12,911 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:41:12,912 INFO ]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:41:12,912 INFO ]: Start difference. First operand 50 states and 55 transitions. Second operand 42 states. [2018-06-22 01:41:13,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:13,384 INFO ]: Finished difference Result 73 states and 78 transitions. [2018-06-22 01:41:13,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:41:13,384 INFO ]: Start accepts. Automaton has 42 states. Word has length 32 [2018-06-22 01:41:13,384 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:13,384 INFO ]: With dead ends: 73 [2018-06-22 01:41:13,384 INFO ]: Without dead ends: 51 [2018-06-22 01:41:13,385 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=2383, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:41:13,385 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:41:13,386 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 01:41:13,386 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:41:13,387 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-06-22 01:41:13,387 INFO ]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 32 [2018-06-22 01:41:13,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:13,387 INFO ]: Abstraction has 51 states and 56 transitions. [2018-06-22 01:41:13,387 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:41:13,387 INFO ]: Start isEmpty. Operand 51 states and 56 transitions. [2018-06-22 01:41:13,387 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 01:41:13,387 INFO ]: Found error trace [2018-06-22 01:41:13,387 INFO ]: trace histogram [18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:13,387 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:13,388 INFO ]: Analyzing trace with hash -1171623836, now seen corresponding path program 27 times [2018-06-22 01:41:13,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:13,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:13,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:13,388 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:13,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:13,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:13,790 INFO ]: Checked inductivity of 194 backedges. 4 proven. 188 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:13,790 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:13,790 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:13,795 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:41:13,827 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 01:41:13,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:13,830 INFO ]: Computing forward predicates... [2018-06-22 01:41:14,204 INFO ]: Checked inductivity of 194 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:14,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:14,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 34 [2018-06-22 01:41:14,223 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:41:14,223 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:41:14,224 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:41:14,224 INFO ]: Start difference. First operand 51 states and 56 transitions. Second operand 34 states. [2018-06-22 01:41:14,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:14,885 INFO ]: Finished difference Result 76 states and 83 transitions. [2018-06-22 01:41:14,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:41:14,886 INFO ]: Start accepts. Automaton has 34 states. Word has length 33 [2018-06-22 01:41:14,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:14,887 INFO ]: With dead ends: 76 [2018-06-22 01:41:14,887 INFO ]: Without dead ends: 76 [2018-06-22 01:41:14,887 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:41:14,887 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:41:14,889 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-06-22 01:41:14,889 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 01:41:14,890 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-06-22 01:41:14,890 INFO ]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 33 [2018-06-22 01:41:14,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:14,890 INFO ]: Abstraction has 58 states and 65 transitions. [2018-06-22 01:41:14,890 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:41:14,890 INFO ]: Start isEmpty. Operand 58 states and 65 transitions. [2018-06-22 01:41:14,891 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:41:14,891 INFO ]: Found error trace [2018-06-22 01:41:14,891 INFO ]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:14,891 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:14,891 INFO ]: Analyzing trace with hash 1349633896, now seen corresponding path program 28 times [2018-06-22 01:41:14,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:14,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:14,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:14,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:14,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:14,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:15,466 INFO ]: Checked inductivity of 214 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:15,466 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:15,466 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:15,472 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:41:15,497 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:41:15,497 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:15,499 INFO ]: Computing forward predicates... [2018-06-22 01:41:15,711 INFO ]: Checked inductivity of 214 backedges. 57 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:15,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:15,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 29 [2018-06-22 01:41:15,730 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:41:15,730 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:41:15,730 INFO ]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:41:15,730 INFO ]: Start difference. First operand 58 states and 65 transitions. Second operand 29 states. [2018-06-22 01:41:15,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:15,860 INFO ]: Finished difference Result 78 states and 85 transitions. [2018-06-22 01:41:15,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:41:15,861 INFO ]: Start accepts. Automaton has 29 states. Word has length 34 [2018-06-22 01:41:15,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:15,861 INFO ]: With dead ends: 78 [2018-06-22 01:41:15,861 INFO ]: Without dead ends: 78 [2018-06-22 01:41:15,862 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:41:15,862 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 01:41:15,864 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 53. [2018-06-22 01:41:15,864 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:41:15,864 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-06-22 01:41:15,864 INFO ]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 34 [2018-06-22 01:41:15,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:15,864 INFO ]: Abstraction has 53 states and 58 transitions. [2018-06-22 01:41:15,864 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:41:15,864 INFO ]: Start isEmpty. Operand 53 states and 58 transitions. [2018-06-22 01:41:15,865 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:41:15,865 INFO ]: Found error trace [2018-06-22 01:41:15,865 INFO ]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:15,865 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:15,865 INFO ]: Analyzing trace with hash -1962484856, now seen corresponding path program 29 times [2018-06-22 01:41:15,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:15,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:15,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:15,865 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:15,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:15,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:16,259 INFO ]: Checked inductivity of 214 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:16,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:16,260 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:16,265 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:41:16,301 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 01:41:16,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:16,302 INFO ]: Computing forward predicates... [2018-06-22 01:41:16,364 INFO ]: Checked inductivity of 214 backedges. 57 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:16,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:16,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 29 [2018-06-22 01:41:16,418 INFO ]: Interpolant automaton has 29 states [2018-06-22 01:41:16,418 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 01:41:16,418 INFO ]: CoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:41:16,418 INFO ]: Start difference. First operand 53 states and 58 transitions. Second operand 29 states. [2018-06-22 01:41:16,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:16,740 INFO ]: Finished difference Result 80 states and 87 transitions. [2018-06-22 01:41:16,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:41:16,741 INFO ]: Start accepts. Automaton has 29 states. Word has length 34 [2018-06-22 01:41:16,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:16,741 INFO ]: With dead ends: 80 [2018-06-22 01:41:16,741 INFO ]: Without dead ends: 54 [2018-06-22 01:41:16,742 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=379, Invalid=1343, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:41:16,742 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:41:16,744 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 01:41:16,744 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:41:16,745 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-06-22 01:41:16,745 INFO ]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2018-06-22 01:41:16,745 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:16,745 INFO ]: Abstraction has 54 states and 59 transitions. [2018-06-22 01:41:16,745 INFO ]: Interpolant automaton has 29 states. [2018-06-22 01:41:16,745 INFO ]: Start isEmpty. Operand 54 states and 59 transitions. [2018-06-22 01:41:16,745 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:41:16,745 INFO ]: Found error trace [2018-06-22 01:41:16,745 INFO ]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:16,745 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:16,745 INFO ]: Analyzing trace with hash -1112906492, now seen corresponding path program 30 times [2018-06-22 01:41:16,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:16,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:16,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:16,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:16,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:16,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:17,978 INFO ]: Checked inductivity of 235 backedges. 4 proven. 229 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:17,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:17,979 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:17,984 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:41:18,024 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 01:41:18,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:18,026 INFO ]: Computing forward predicates... [2018-06-22 01:41:18,507 INFO ]: Checked inductivity of 235 backedges. 2 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:18,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:18,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 37 [2018-06-22 01:41:18,527 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:41:18,527 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:41:18,528 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:41:18,528 INFO ]: Start difference. First operand 54 states and 59 transitions. Second operand 37 states. [2018-06-22 01:41:18,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:18,943 INFO ]: Finished difference Result 81 states and 88 transitions. [2018-06-22 01:41:18,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:41:18,943 INFO ]: Start accepts. Automaton has 37 states. Word has length 35 [2018-06-22 01:41:18,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:18,944 INFO ]: With dead ends: 81 [2018-06-22 01:41:18,944 INFO ]: Without dead ends: 81 [2018-06-22 01:41:18,944 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=1441, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:41:18,944 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:41:18,946 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 61. [2018-06-22 01:41:18,947 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 01:41:18,947 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-06-22 01:41:18,947 INFO ]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 35 [2018-06-22 01:41:18,947 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:18,947 INFO ]: Abstraction has 61 states and 68 transitions. [2018-06-22 01:41:18,947 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:41:18,947 INFO ]: Start isEmpty. Operand 61 states and 68 transitions. [2018-06-22 01:41:18,948 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:41:18,948 INFO ]: Found error trace [2018-06-22 01:41:18,948 INFO ]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:18,948 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:18,948 INFO ]: Analyzing trace with hash -545780984, now seen corresponding path program 31 times [2018-06-22 01:41:18,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:18,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:18,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:18,949 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:18,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:18,958 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:19,278 INFO ]: Checked inductivity of 257 backedges. 47 proven. 208 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:19,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:19,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:19,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:19,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:19,313 INFO ]: Computing forward predicates... [2018-06-22 01:41:19,381 INFO ]: Checked inductivity of 257 backedges. 68 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:19,400 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:19,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 31 [2018-06-22 01:41:19,400 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:41:19,400 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:41:19,400 INFO ]: CoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:41:19,400 INFO ]: Start difference. First operand 61 states and 68 transitions. Second operand 31 states. [2018-06-22 01:41:19,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:19,534 INFO ]: Finished difference Result 83 states and 90 transitions. [2018-06-22 01:41:19,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:41:19,534 INFO ]: Start accepts. Automaton has 31 states. Word has length 36 [2018-06-22 01:41:19,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:19,535 INFO ]: With dead ends: 83 [2018-06-22 01:41:19,535 INFO ]: Without dead ends: 83 [2018-06-22 01:41:19,536 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:41:19,536 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 01:41:19,538 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-06-22 01:41:19,538 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:41:19,538 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-06-22 01:41:19,538 INFO ]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 36 [2018-06-22 01:41:19,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:19,538 INFO ]: Abstraction has 56 states and 61 transitions. [2018-06-22 01:41:19,538 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:41:19,538 INFO ]: Start isEmpty. Operand 56 states and 61 transitions. [2018-06-22 01:41:19,539 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:41:19,539 INFO ]: Found error trace [2018-06-22 01:41:19,539 INFO ]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:19,539 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:19,539 INFO ]: Analyzing trace with hash -142247192, now seen corresponding path program 32 times [2018-06-22 01:41:19,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:19,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:19,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:19,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:19,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:19,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:19,813 INFO ]: Checked inductivity of 257 backedges. 47 proven. 208 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:19,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:19,813 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:19,818 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:19,863 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:19,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:19,865 INFO ]: Computing forward predicates... [2018-06-22 01:41:20,338 INFO ]: Checked inductivity of 257 backedges. 24 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:20,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:20,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2018-06-22 01:41:20,360 INFO ]: Interpolant automaton has 50 states [2018-06-22 01:41:20,360 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 01:41:20,361 INFO ]: CoverageRelationStatistics Valid=341, Invalid=2109, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:41:20,361 INFO ]: Start difference. First operand 56 states and 61 transitions. Second operand 50 states. [2018-06-22 01:41:20,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:20,970 INFO ]: Finished difference Result 83 states and 88 transitions. [2018-06-22 01:41:20,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:41:20,970 INFO ]: Start accepts. Automaton has 50 states. Word has length 36 [2018-06-22 01:41:20,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:20,970 INFO ]: With dead ends: 83 [2018-06-22 01:41:20,970 INFO ]: Without dead ends: 57 [2018-06-22 01:41:20,971 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=506, Invalid=3400, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 01:41:20,971 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:41:20,972 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-06-22 01:41:20,972 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:41:20,973 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-22 01:41:20,973 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 36 [2018-06-22 01:41:20,973 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:20,973 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-22 01:41:20,973 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:41:20,973 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-22 01:41:20,973 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:41:20,973 INFO ]: Found error trace [2018-06-22 01:41:20,973 INFO ]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:20,973 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:20,973 INFO ]: Analyzing trace with hash 258774372, now seen corresponding path program 33 times [2018-06-22 01:41:20,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:20,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:20,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:20,974 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:20,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:20,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:21,773 INFO ]: Checked inductivity of 280 backedges. 4 proven. 274 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:21,773 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:21,773 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:21,778 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:41:21,932 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 01:41:21,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:21,935 INFO ]: Computing forward predicates... [2018-06-22 01:41:22,275 INFO ]: Checked inductivity of 280 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:22,294 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:22,294 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 40 [2018-06-22 01:41:22,294 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:41:22,294 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:41:22,294 INFO ]: CoverageRelationStatistics Valid=92, Invalid=1468, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:41:22,294 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 40 states. [2018-06-22 01:41:22,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:22,744 INFO ]: Finished difference Result 86 states and 93 transitions. [2018-06-22 01:41:22,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:41:22,747 INFO ]: Start accepts. Automaton has 40 states. Word has length 37 [2018-06-22 01:41:22,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:22,747 INFO ]: With dead ends: 86 [2018-06-22 01:41:22,747 INFO ]: Without dead ends: 86 [2018-06-22 01:41:22,748 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=1678, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:41:22,748 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 01:41:22,750 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-06-22 01:41:22,750 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:41:22,751 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-06-22 01:41:22,751 INFO ]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 37 [2018-06-22 01:41:22,751 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:22,751 INFO ]: Abstraction has 64 states and 71 transitions. [2018-06-22 01:41:22,751 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:41:22,751 INFO ]: Start isEmpty. Operand 64 states and 71 transitions. [2018-06-22 01:41:22,751 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:41:22,751 INFO ]: Found error trace [2018-06-22 01:41:22,752 INFO ]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:22,752 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:22,752 INFO ]: Analyzing trace with hash -194459032, now seen corresponding path program 34 times [2018-06-22 01:41:22,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:22,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:22,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:22,752 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:22,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:22,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:23,233 INFO ]: Checked inductivity of 304 backedges. 57 proven. 245 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:23,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:23,233 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:23,246 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:41:23,275 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:41:23,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:23,278 INFO ]: Computing forward predicates... [2018-06-22 01:41:23,349 INFO ]: Checked inductivity of 304 backedges. 80 proven. 222 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:23,369 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:23,369 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 33 [2018-06-22 01:41:23,369 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:41:23,369 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:41:23,370 INFO ]: CoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:41:23,370 INFO ]: Start difference. First operand 64 states and 71 transitions. Second operand 33 states. [2018-06-22 01:41:23,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:23,581 INFO ]: Finished difference Result 88 states and 95 transitions. [2018-06-22 01:41:23,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:41:23,586 INFO ]: Start accepts. Automaton has 33 states. Word has length 38 [2018-06-22 01:41:23,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:23,587 INFO ]: With dead ends: 88 [2018-06-22 01:41:23,587 INFO ]: Without dead ends: 88 [2018-06-22 01:41:23,587 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:41:23,587 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:41:23,590 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 59. [2018-06-22 01:41:23,590 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:41:23,590 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-06-22 01:41:23,590 INFO ]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 38 [2018-06-22 01:41:23,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:23,590 INFO ]: Abstraction has 59 states and 64 transitions. [2018-06-22 01:41:23,590 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:41:23,590 INFO ]: Start isEmpty. Operand 59 states and 64 transitions. [2018-06-22 01:41:23,591 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:41:23,591 INFO ]: Found error trace [2018-06-22 01:41:23,591 INFO ]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:23,591 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:23,591 INFO ]: Analyzing trace with hash -569813368, now seen corresponding path program 35 times [2018-06-22 01:41:23,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:23,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:23,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:23,592 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:23,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:23,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:24,215 INFO ]: Checked inductivity of 304 backedges. 57 proven. 245 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:24,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:24,215 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:24,221 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:41:24,269 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-22 01:41:24,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:24,271 INFO ]: Computing forward predicates... [2018-06-22 01:41:24,524 INFO ]: Checked inductivity of 304 backedges. 80 proven. 222 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:24,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:24,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 33 [2018-06-22 01:41:24,545 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:41:24,546 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:41:24,546 INFO ]: CoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:41:24,546 INFO ]: Start difference. First operand 59 states and 64 transitions. Second operand 33 states. [2018-06-22 01:41:24,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:24,867 INFO ]: Finished difference Result 90 states and 97 transitions. [2018-06-22 01:41:24,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 01:41:24,867 INFO ]: Start accepts. Automaton has 33 states. Word has length 38 [2018-06-22 01:41:24,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:24,867 INFO ]: With dead ends: 90 [2018-06-22 01:41:24,867 INFO ]: Without dead ends: 60 [2018-06-22 01:41:24,868 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=495, Invalid=1761, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 01:41:24,868 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:41:24,870 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 01:41:24,870 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:41:24,870 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-06-22 01:41:24,870 INFO ]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 38 [2018-06-22 01:41:24,871 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:24,871 INFO ]: Abstraction has 60 states and 65 transitions. [2018-06-22 01:41:24,871 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:41:24,874 INFO ]: Start isEmpty. Operand 60 states and 65 transitions. [2018-06-22 01:41:24,875 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:41:24,875 INFO ]: Found error trace [2018-06-22 01:41:24,875 INFO ]: trace histogram [24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:24,875 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:24,875 INFO ]: Analyzing trace with hash -1735147004, now seen corresponding path program 36 times [2018-06-22 01:41:24,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:24,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:24,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:24,876 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:24,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:24,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:26,062 INFO ]: Checked inductivity of 329 backedges. 4 proven. 323 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:26,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:26,062 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:26,069 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:41:26,114 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 01:41:26,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:26,117 INFO ]: Computing forward predicates... [2018-06-22 01:41:26,582 INFO ]: Checked inductivity of 329 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:26,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:26,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 43 [2018-06-22 01:41:26,603 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:41:26,603 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:41:26,604 INFO ]: CoverageRelationStatistics Valid=99, Invalid=1707, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:41:26,604 INFO ]: Start difference. First operand 60 states and 65 transitions. Second operand 43 states. [2018-06-22 01:41:27,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:27,180 INFO ]: Finished difference Result 91 states and 98 transitions. [2018-06-22 01:41:27,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:41:27,180 INFO ]: Start accepts. Automaton has 43 states. Word has length 39 [2018-06-22 01:41:27,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:27,181 INFO ]: With dead ends: 91 [2018-06-22 01:41:27,181 INFO ]: Without dead ends: 91 [2018-06-22 01:41:27,181 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:41:27,181 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:41:27,183 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-06-22 01:41:27,183 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:41:27,183 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-06-22 01:41:27,183 INFO ]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 39 [2018-06-22 01:41:27,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:27,183 INFO ]: Abstraction has 67 states and 74 transitions. [2018-06-22 01:41:27,183 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:41:27,183 INFO ]: Start isEmpty. Operand 67 states and 74 transitions. [2018-06-22 01:41:27,184 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:41:27,184 INFO ]: Found error trace [2018-06-22 01:41:27,184 INFO ]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:27,184 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:27,184 INFO ]: Analyzing trace with hash 794215944, now seen corresponding path program 37 times [2018-06-22 01:41:27,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:27,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:27,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:27,185 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:27,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:27,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:27,855 INFO ]: Checked inductivity of 355 backedges. 68 proven. 285 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:27,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:27,855 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:27,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:27,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:27,896 INFO ]: Computing forward predicates... [2018-06-22 01:41:29,200 INFO ]: Checked inductivity of 355 backedges. 93 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:29,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:29,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 35 [2018-06-22 01:41:29,232 INFO ]: Interpolant automaton has 35 states [2018-06-22 01:41:29,232 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 01:41:29,232 INFO ]: CoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:41:29,232 INFO ]: Start difference. First operand 67 states and 74 transitions. Second operand 35 states. [2018-06-22 01:41:29,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:29,585 INFO ]: Finished difference Result 93 states and 100 transitions. [2018-06-22 01:41:29,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 01:41:29,585 INFO ]: Start accepts. Automaton has 35 states. Word has length 40 [2018-06-22 01:41:29,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:29,586 INFO ]: With dead ends: 93 [2018-06-22 01:41:29,586 INFO ]: Without dead ends: 93 [2018-06-22 01:41:29,586 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:41:29,587 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 01:41:29,588 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 62. [2018-06-22 01:41:29,588 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:41:29,589 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-06-22 01:41:29,589 INFO ]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 40 [2018-06-22 01:41:29,589 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:29,589 INFO ]: Abstraction has 62 states and 67 transitions. [2018-06-22 01:41:29,589 INFO ]: Interpolant automaton has 35 states. [2018-06-22 01:41:29,589 INFO ]: Start isEmpty. Operand 62 states and 67 transitions. [2018-06-22 01:41:29,589 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:41:29,589 INFO ]: Found error trace [2018-06-22 01:41:29,589 INFO ]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:29,590 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:29,590 INFO ]: Analyzing trace with hash 2043133416, now seen corresponding path program 38 times [2018-06-22 01:41:29,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:29,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:29,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:29,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:29,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:29,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:30,400 INFO ]: Checked inductivity of 355 backedges. 68 proven. 285 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:30,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:30,400 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:30,405 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:30,439 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:30,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:30,441 INFO ]: Computing forward predicates... [2018-06-22 01:41:30,992 INFO ]: Checked inductivity of 355 backedges. 28 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:31,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:31,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 58 [2018-06-22 01:41:31,012 INFO ]: Interpolant automaton has 58 states [2018-06-22 01:41:31,013 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 01:41:31,013 INFO ]: CoverageRelationStatistics Valid=453, Invalid=2853, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:41:31,013 INFO ]: Start difference. First operand 62 states and 67 transitions. Second operand 58 states. [2018-06-22 01:41:31,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:31,731 INFO ]: Finished difference Result 93 states and 98 transitions. [2018-06-22 01:41:31,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:41:31,731 INFO ]: Start accepts. Automaton has 58 states. Word has length 40 [2018-06-22 01:41:31,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:31,732 INFO ]: With dead ends: 93 [2018-06-22 01:41:31,732 INFO ]: Without dead ends: 63 [2018-06-22 01:41:31,732 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=659, Invalid=4597, Unknown=0, NotChecked=0, Total=5256 [2018-06-22 01:41:31,732 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:41:31,734 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-06-22 01:41:31,734 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:41:31,735 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-06-22 01:41:31,735 INFO ]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2018-06-22 01:41:31,735 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:31,735 INFO ]: Abstraction has 63 states and 68 transitions. [2018-06-22 01:41:31,735 INFO ]: Interpolant automaton has 58 states. [2018-06-22 01:41:31,735 INFO ]: Start isEmpty. Operand 63 states and 68 transitions. [2018-06-22 01:41:31,735 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:41:31,735 INFO ]: Found error trace [2018-06-22 01:41:31,735 INFO ]: trace histogram [26, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:31,735 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:31,735 INFO ]: Analyzing trace with hash -1150993820, now seen corresponding path program 39 times [2018-06-22 01:41:31,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:31,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:31,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:31,736 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:31,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:31,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:32,471 INFO ]: Checked inductivity of 382 backedges. 4 proven. 376 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:32,471 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:32,471 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:32,484 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:41:32,541 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-22 01:41:32,541 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:32,545 INFO ]: Computing forward predicates... [2018-06-22 01:41:33,119 INFO ]: Checked inductivity of 382 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:33,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:33,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 46 [2018-06-22 01:41:33,138 INFO ]: Interpolant automaton has 46 states [2018-06-22 01:41:33,138 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 01:41:33,138 INFO ]: CoverageRelationStatistics Valid=106, Invalid=1964, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:41:33,138 INFO ]: Start difference. First operand 63 states and 68 transitions. Second operand 46 states. [2018-06-22 01:41:33,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:33,671 INFO ]: Finished difference Result 96 states and 103 transitions. [2018-06-22 01:41:33,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:41:33,671 INFO ]: Start accepts. Automaton has 46 states. Word has length 41 [2018-06-22 01:41:33,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:33,672 INFO ]: With dead ends: 96 [2018-06-22 01:41:33,672 INFO ]: Without dead ends: 96 [2018-06-22 01:41:33,672 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=2206, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:41:33,672 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 01:41:33,674 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 70. [2018-06-22 01:41:33,674 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:41:33,676 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-06-22 01:41:33,676 INFO ]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 41 [2018-06-22 01:41:33,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:33,676 INFO ]: Abstraction has 70 states and 77 transitions. [2018-06-22 01:41:33,676 INFO ]: Interpolant automaton has 46 states. [2018-06-22 01:41:33,676 INFO ]: Start isEmpty. Operand 70 states and 77 transitions. [2018-06-22 01:41:33,677 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:41:33,677 INFO ]: Found error trace [2018-06-22 01:41:33,677 INFO ]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:33,677 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:33,677 INFO ]: Analyzing trace with hash -1384690328, now seen corresponding path program 40 times [2018-06-22 01:41:33,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:33,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:33,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:33,677 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:33,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:33,686 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:34,192 INFO ]: Checked inductivity of 410 backedges. 80 proven. 328 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:34,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:34,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:34,197 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:41:34,231 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:41:34,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:34,233 INFO ]: Computing forward predicates... [2018-06-22 01:41:34,309 INFO ]: Checked inductivity of 410 backedges. 107 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:34,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:34,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 37 [2018-06-22 01:41:34,332 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:41:34,332 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:41:34,332 INFO ]: CoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:41:34,333 INFO ]: Start difference. First operand 70 states and 77 transitions. Second operand 37 states. [2018-06-22 01:41:34,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:34,500 INFO ]: Finished difference Result 98 states and 105 transitions. [2018-06-22 01:41:34,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 01:41:34,504 INFO ]: Start accepts. Automaton has 37 states. Word has length 42 [2018-06-22 01:41:34,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:34,505 INFO ]: With dead ends: 98 [2018-06-22 01:41:34,505 INFO ]: Without dead ends: 98 [2018-06-22 01:41:34,505 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:41:34,505 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 01:41:34,507 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 65. [2018-06-22 01:41:34,507 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:41:34,507 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-06-22 01:41:34,508 INFO ]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 42 [2018-06-22 01:41:34,508 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:34,508 INFO ]: Abstraction has 65 states and 70 transitions. [2018-06-22 01:41:34,508 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:41:34,508 INFO ]: Start isEmpty. Operand 65 states and 70 transitions. [2018-06-22 01:41:34,509 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:41:34,509 INFO ]: Found error trace [2018-06-22 01:41:34,509 INFO ]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:34,509 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:34,509 INFO ]: Analyzing trace with hash -1322954360, now seen corresponding path program 41 times [2018-06-22 01:41:34,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:34,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:34,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:34,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:34,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:34,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:34,980 INFO ]: Checked inductivity of 410 backedges. 80 proven. 328 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:34,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:34,980 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:34,987 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:41:35,033 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-06-22 01:41:35,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:35,035 INFO ]: Computing forward predicates... [2018-06-22 01:41:35,176 INFO ]: Checked inductivity of 410 backedges. 107 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:35,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:35,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 37 [2018-06-22 01:41:35,196 INFO ]: Interpolant automaton has 37 states [2018-06-22 01:41:35,196 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 01:41:35,196 INFO ]: CoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:41:35,196 INFO ]: Start difference. First operand 65 states and 70 transitions. Second operand 37 states. [2018-06-22 01:41:35,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:35,484 INFO ]: Finished difference Result 100 states and 107 transitions. [2018-06-22 01:41:35,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 01:41:35,484 INFO ]: Start accepts. Automaton has 37 states. Word has length 42 [2018-06-22 01:41:35,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:35,484 INFO ]: With dead ends: 100 [2018-06-22 01:41:35,484 INFO ]: Without dead ends: 66 [2018-06-22 01:41:35,485 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=627, Invalid=2235, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:41:35,485 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:41:35,486 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 01:41:35,487 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:41:35,487 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-06-22 01:41:35,487 INFO ]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 42 [2018-06-22 01:41:35,487 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:35,487 INFO ]: Abstraction has 66 states and 71 transitions. [2018-06-22 01:41:35,487 INFO ]: Interpolant automaton has 37 states. [2018-06-22 01:41:35,487 INFO ]: Start isEmpty. Operand 66 states and 71 transitions. [2018-06-22 01:41:35,488 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 01:41:35,488 INFO ]: Found error trace [2018-06-22 01:41:35,488 INFO ]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:35,489 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:35,489 INFO ]: Analyzing trace with hash 22388484, now seen corresponding path program 42 times [2018-06-22 01:41:35,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:35,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:35,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:35,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:35,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:35,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:36,193 INFO ]: Checked inductivity of 439 backedges. 4 proven. 433 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:36,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:36,193 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:36,199 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:41:36,260 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-22 01:41:36,260 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:36,263 INFO ]: Computing forward predicates... [2018-06-22 01:41:36,758 INFO ]: Checked inductivity of 439 backedges. 2 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:36,778 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:36,778 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 49 [2018-06-22 01:41:36,778 INFO ]: Interpolant automaton has 49 states [2018-06-22 01:41:36,778 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-22 01:41:36,778 INFO ]: CoverageRelationStatistics Valid=113, Invalid=2239, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 01:41:36,778 INFO ]: Start difference. First operand 66 states and 71 transitions. Second operand 49 states. [2018-06-22 01:41:37,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:37,843 INFO ]: Finished difference Result 101 states and 108 transitions. [2018-06-22 01:41:37,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:41:37,843 INFO ]: Start accepts. Automaton has 49 states. Word has length 43 [2018-06-22 01:41:37,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:37,844 INFO ]: With dead ends: 101 [2018-06-22 01:41:37,844 INFO ]: Without dead ends: 101 [2018-06-22 01:41:37,844 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=2497, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:41:37,844 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 01:41:37,846 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 73. [2018-06-22 01:41:37,846 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 01:41:37,847 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-06-22 01:41:37,847 INFO ]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 43 [2018-06-22 01:41:37,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:37,847 INFO ]: Abstraction has 73 states and 80 transitions. [2018-06-22 01:41:37,847 INFO ]: Interpolant automaton has 49 states. [2018-06-22 01:41:37,847 INFO ]: Start isEmpty. Operand 73 states and 80 transitions. [2018-06-22 01:41:37,847 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:41:37,847 INFO ]: Found error trace [2018-06-22 01:41:37,847 INFO ]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:37,848 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:37,848 INFO ]: Analyzing trace with hash -1221656312, now seen corresponding path program 43 times [2018-06-22 01:41:37,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:37,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:37,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:37,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:37,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:37,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:38,363 INFO ]: Checked inductivity of 469 backedges. 93 proven. 374 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:38,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:38,363 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:38,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:38,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:38,409 INFO ]: Computing forward predicates... [2018-06-22 01:41:38,676 INFO ]: Checked inductivity of 469 backedges. 122 proven. 345 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:38,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:38,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 39 [2018-06-22 01:41:38,695 INFO ]: Interpolant automaton has 39 states [2018-06-22 01:41:38,695 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 01:41:38,695 INFO ]: CoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:41:38,696 INFO ]: Start difference. First operand 73 states and 80 transitions. Second operand 39 states. [2018-06-22 01:41:38,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:38,890 INFO ]: Finished difference Result 103 states and 110 transitions. [2018-06-22 01:41:38,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 01:41:38,891 INFO ]: Start accepts. Automaton has 39 states. Word has length 44 [2018-06-22 01:41:38,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:38,891 INFO ]: With dead ends: 103 [2018-06-22 01:41:38,891 INFO ]: Without dead ends: 103 [2018-06-22 01:41:38,892 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=1268, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:41:38,892 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:41:38,894 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 68. [2018-06-22 01:41:38,894 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 01:41:38,894 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-06-22 01:41:38,894 INFO ]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 44 [2018-06-22 01:41:38,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:38,895 INFO ]: Abstraction has 68 states and 73 transitions. [2018-06-22 01:41:38,895 INFO ]: Interpolant automaton has 39 states. [2018-06-22 01:41:38,895 INFO ]: Start isEmpty. Operand 68 states and 73 transitions. [2018-06-22 01:41:38,895 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:41:38,895 INFO ]: Found error trace [2018-06-22 01:41:38,895 INFO ]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:38,895 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:38,895 INFO ]: Analyzing trace with hash 692158696, now seen corresponding path program 44 times [2018-06-22 01:41:38,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:38,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:38,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:38,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:38,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:38,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:39,242 INFO ]: Checked inductivity of 469 backedges. 93 proven. 374 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:39,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:39,242 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:39,248 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:39,286 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:39,286 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:39,289 INFO ]: Computing forward predicates... [2018-06-22 01:41:39,938 INFO ]: Checked inductivity of 469 backedges. 32 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:39,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:39,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2018-06-22 01:41:39,957 INFO ]: Interpolant automaton has 66 states [2018-06-22 01:41:39,958 INFO ]: Constructing interpolant automaton starting with 66 interpolants. [2018-06-22 01:41:39,958 INFO ]: CoverageRelationStatistics Valid=581, Invalid=3709, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 01:41:39,958 INFO ]: Start difference. First operand 68 states and 73 transitions. Second operand 66 states. [2018-06-22 01:41:40,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:40,666 INFO ]: Finished difference Result 103 states and 108 transitions. [2018-06-22 01:41:40,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:41:40,667 INFO ]: Start accepts. Automaton has 66 states. Word has length 44 [2018-06-22 01:41:40,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:40,667 INFO ]: With dead ends: 103 [2018-06-22 01:41:40,667 INFO ]: Without dead ends: 69 [2018-06-22 01:41:40,667 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=832, Invalid=5974, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 01:41:40,668 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 01:41:40,669 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-22 01:41:40,669 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:41:40,670 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-06-22 01:41:40,670 INFO ]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 44 [2018-06-22 01:41:40,670 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:40,670 INFO ]: Abstraction has 69 states and 74 transitions. [2018-06-22 01:41:40,670 INFO ]: Interpolant automaton has 66 states. [2018-06-22 01:41:40,670 INFO ]: Start isEmpty. Operand 69 states and 74 transitions. [2018-06-22 01:41:40,670 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:41:40,670 INFO ]: Found error trace [2018-06-22 01:41:40,670 INFO ]: trace histogram [30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:40,670 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:40,670 INFO ]: Analyzing trace with hash 781475684, now seen corresponding path program 45 times [2018-06-22 01:41:40,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:40,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:40,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:40,671 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:40,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:40,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:41,368 INFO ]: Checked inductivity of 500 backedges. 4 proven. 494 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:41,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:41,368 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:41,374 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:41:41,427 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-06-22 01:41:41,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:41,431 INFO ]: Computing forward predicates... [2018-06-22 01:41:41,970 INFO ]: Checked inductivity of 500 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:41,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:41,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 52 [2018-06-22 01:41:41,990 INFO ]: Interpolant automaton has 52 states [2018-06-22 01:41:41,990 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 01:41:41,990 INFO ]: CoverageRelationStatistics Valid=120, Invalid=2532, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:41:41,990 INFO ]: Start difference. First operand 69 states and 74 transitions. Second operand 52 states. [2018-06-22 01:41:42,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:42,721 INFO ]: Finished difference Result 106 states and 113 transitions. [2018-06-22 01:41:42,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:41:42,721 INFO ]: Start accepts. Automaton has 52 states. Word has length 45 [2018-06-22 01:41:42,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:42,722 INFO ]: With dead ends: 106 [2018-06-22 01:41:42,722 INFO ]: Without dead ends: 106 [2018-06-22 01:41:42,722 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=164, Invalid=2806, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:41:42,722 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 01:41:42,725 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 76. [2018-06-22 01:41:42,725 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:41:42,725 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-06-22 01:41:42,725 INFO ]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 45 [2018-06-22 01:41:42,726 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:42,726 INFO ]: Abstraction has 76 states and 83 transitions. [2018-06-22 01:41:42,726 INFO ]: Interpolant automaton has 52 states. [2018-06-22 01:41:42,726 INFO ]: Start isEmpty. Operand 76 states and 83 transitions. [2018-06-22 01:41:42,726 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:41:42,726 INFO ]: Found error trace [2018-06-22 01:41:42,726 INFO ]: trace histogram [31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:42,726 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:42,726 INFO ]: Analyzing trace with hash -744664984, now seen corresponding path program 46 times [2018-06-22 01:41:42,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:42,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:42,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:42,727 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:42,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:42,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:43,177 INFO ]: Checked inductivity of 532 backedges. 107 proven. 423 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:43,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:43,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:43,183 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:41:43,224 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:41:43,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:43,226 INFO ]: Computing forward predicates... [2018-06-22 01:41:43,337 INFO ]: Checked inductivity of 532 backedges. 138 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:43,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:43,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 41 [2018-06-22 01:41:43,356 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:41:43,356 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:41:43,356 INFO ]: CoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:41:43,356 INFO ]: Start difference. First operand 76 states and 83 transitions. Second operand 41 states. [2018-06-22 01:41:43,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:43,713 INFO ]: Finished difference Result 108 states and 115 transitions. [2018-06-22 01:41:43,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 01:41:43,713 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-22 01:41:43,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:43,714 INFO ]: With dead ends: 108 [2018-06-22 01:41:43,714 INFO ]: Without dead ends: 108 [2018-06-22 01:41:43,714 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=411, Invalid=1395, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:41:43,714 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 01:41:43,716 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 71. [2018-06-22 01:41:43,716 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 01:41:43,719 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-06-22 01:41:43,719 INFO ]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 46 [2018-06-22 01:41:43,719 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:43,719 INFO ]: Abstraction has 71 states and 76 transitions. [2018-06-22 01:41:43,719 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:41:43,719 INFO ]: Start isEmpty. Operand 71 states and 76 transitions. [2018-06-22 01:41:43,719 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-22 01:41:43,719 INFO ]: Found error trace [2018-06-22 01:41:43,719 INFO ]: trace histogram [31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:43,719 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:43,720 INFO ]: Analyzing trace with hash -1545941880, now seen corresponding path program 47 times [2018-06-22 01:41:43,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:43,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:43,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:43,720 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:43,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:43,731 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:44,403 INFO ]: Checked inductivity of 532 backedges. 107 proven. 423 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:44,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:44,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:44,408 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:41:44,466 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-06-22 01:41:44,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:44,468 INFO ]: Computing forward predicates... [2018-06-22 01:41:44,590 INFO ]: Checked inductivity of 532 backedges. 138 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:44,609 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:44,609 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 41 [2018-06-22 01:41:44,609 INFO ]: Interpolant automaton has 41 states [2018-06-22 01:41:44,609 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 01:41:44,609 INFO ]: CoverageRelationStatistics Valid=372, Invalid=1268, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:41:44,609 INFO ]: Start difference. First operand 71 states and 76 transitions. Second operand 41 states. [2018-06-22 01:41:45,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:45,353 INFO ]: Finished difference Result 110 states and 117 transitions. [2018-06-22 01:41:45,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 01:41:45,358 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-22 01:41:45,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:45,359 INFO ]: With dead ends: 110 [2018-06-22 01:41:45,359 INFO ]: Without dead ends: 72 [2018-06-22 01:41:45,359 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=775, Invalid=2765, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 01:41:45,360 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:41:45,361 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 01:41:45,361 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:41:45,362 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-06-22 01:41:45,362 INFO ]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 46 [2018-06-22 01:41:45,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:45,362 INFO ]: Abstraction has 72 states and 77 transitions. [2018-06-22 01:41:45,362 INFO ]: Interpolant automaton has 41 states. [2018-06-22 01:41:45,362 INFO ]: Start isEmpty. Operand 72 states and 77 transitions. [2018-06-22 01:41:45,362 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:41:45,362 INFO ]: Found error trace [2018-06-22 01:41:45,362 INFO ]: trace histogram [32, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:45,362 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:45,363 INFO ]: Analyzing trace with hash -1611662332, now seen corresponding path program 48 times [2018-06-22 01:41:45,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:45,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:45,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:45,363 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:45,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:45,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:46,621 INFO ]: Checked inductivity of 565 backedges. 4 proven. 559 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:46,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:46,621 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:46,628 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:41:46,684 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-06-22 01:41:46,684 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:46,688 INFO ]: Computing forward predicates... [2018-06-22 01:41:47,308 INFO ]: Checked inductivity of 565 backedges. 2 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:47,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:47,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 55 [2018-06-22 01:41:47,328 INFO ]: Interpolant automaton has 55 states [2018-06-22 01:41:47,328 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-22 01:41:47,328 INFO ]: CoverageRelationStatistics Valid=127, Invalid=2843, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:41:47,328 INFO ]: Start difference. First operand 72 states and 77 transitions. Second operand 55 states. [2018-06-22 01:41:48,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:48,031 INFO ]: Finished difference Result 111 states and 118 transitions. [2018-06-22 01:41:48,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:41:48,036 INFO ]: Start accepts. Automaton has 55 states. Word has length 47 [2018-06-22 01:41:48,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:48,037 INFO ]: With dead ends: 111 [2018-06-22 01:41:48,037 INFO ]: Without dead ends: 111 [2018-06-22 01:41:48,037 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=173, Invalid=3133, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:41:48,037 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 01:41:48,040 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 79. [2018-06-22 01:41:48,040 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:41:48,040 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-06-22 01:41:48,040 INFO ]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 47 [2018-06-22 01:41:48,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:48,040 INFO ]: Abstraction has 79 states and 86 transitions. [2018-06-22 01:41:48,040 INFO ]: Interpolant automaton has 55 states. [2018-06-22 01:41:48,040 INFO ]: Start isEmpty. Operand 79 states and 86 transitions. [2018-06-22 01:41:48,041 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:41:48,041 INFO ]: Found error trace [2018-06-22 01:41:48,041 INFO ]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:48,041 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:48,041 INFO ]: Analyzing trace with hash 645970952, now seen corresponding path program 49 times [2018-06-22 01:41:48,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:48,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:48,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:48,042 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:41:48,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:48,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:49,106 INFO ]: Checked inductivity of 599 backedges. 122 proven. 475 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:49,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:49,106 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:49,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:49,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:49,153 INFO ]: Computing forward predicates... [2018-06-22 01:41:49,240 INFO ]: Checked inductivity of 599 backedges. 155 proven. 442 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:49,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:41:49,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 43 [2018-06-22 01:41:49,260 INFO ]: Interpolant automaton has 43 states [2018-06-22 01:41:49,260 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 01:41:49,260 INFO ]: CoverageRelationStatistics Valid=408, Invalid=1398, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:41:49,260 INFO ]: Start difference. First operand 79 states and 86 transitions. Second operand 43 states. [2018-06-22 01:41:49,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:41:49,491 INFO ]: Finished difference Result 113 states and 120 transitions. [2018-06-22 01:41:49,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:41:49,491 INFO ]: Start accepts. Automaton has 43 states. Word has length 48 [2018-06-22 01:41:49,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:41:49,492 INFO ]: With dead ends: 113 [2018-06-22 01:41:49,492 INFO ]: Without dead ends: 113 [2018-06-22 01:41:49,492 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 01:41:49,492 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 01:41:49,494 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 74. [2018-06-22 01:41:49,494 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:41:49,495 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-06-22 01:41:49,495 INFO ]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 48 [2018-06-22 01:41:49,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:41:49,495 INFO ]: Abstraction has 74 states and 79 transitions. [2018-06-22 01:41:49,495 INFO ]: Interpolant automaton has 43 states. [2018-06-22 01:41:49,495 INFO ]: Start isEmpty. Operand 74 states and 79 transitions. [2018-06-22 01:41:49,495 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 01:41:49,495 INFO ]: Found error trace [2018-06-22 01:41:49,495 INFO ]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:41:49,495 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:41:49,496 INFO ]: Analyzing trace with hash 1576190952, now seen corresponding path program 50 times [2018-06-22 01:41:49,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:41:49,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:41:49,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:49,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:41:49,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:41:49,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:50,372 INFO ]: Checked inductivity of 599 backedges. 122 proven. 475 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:41:50,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:41:50,373 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 01:41:50,380 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:41:50,421 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:41:50,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:41:50,424 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 01:41:50,466 INFO ]: Timeout while computing interpolants [2018-06-22 01:41:50,666 WARN ]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:41:50,666 WARN ]: Verification canceled [2018-06-22 01:41:50,774 WARN ]: Timeout [2018-06-22 01:41:50,774 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:41:50 BoogieIcfgContainer [2018-06-22 01:41:50,774 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:41:50,775 INFO ]: Toolchain (without parser) took 59104.35 ms. Allocated memory was 307.2 MB in the beginning and 790.6 MB in the end (delta: 483.4 MB). Free memory was 263.6 MB in the beginning and 764.3 MB in the end (delta: -500.7 MB). Peak memory consumption was 190.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:41:50,776 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:41:50,777 INFO ]: ChcToBoogie took 61.84 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:41:50,777 INFO ]: Boogie Preprocessor took 41.36 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:41:50,777 INFO ]: RCFGBuilder took 370.79 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 253.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:41:50,778 INFO ]: TraceAbstraction took 58621.87 ms. Allocated memory was 307.2 MB in the beginning and 790.6 MB in the end (delta: 483.4 MB). Free memory was 253.7 MB in the beginning and 764.3 MB in the end (delta: -510.6 MB). Peak memory consumption was 180.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:41:50,781 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.84 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.36 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 370.79 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 253.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58621.87 ms. Allocated memory was 307.2 MB in the beginning and 790.6 MB in the end (delta: 483.4 MB). Free memory was 253.7 MB in the beginning and 764.3 MB in the end (delta: -510.6 MB). Peak memory consumption was 180.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 33, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 3 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 58.4s OverallTime, 52 OverallIterations, 33 TraceHistogramMax, 17.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 497 SDtfs, 1096 SDslu, 5345 SDs, 0 SdLazy, 20179 SolverSat, 982 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2916 GetRequests, 1173 SyntacticMatches, 71 SemanticMatches, 1672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14163 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=50, 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: 0.1s AutomataMinimizationTime, 51 MinimizatonAttempts, 663 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 35.0s InterpolantComputationTime, 3141 NumberOfCodeBlocks, 3141 NumberOfCodeBlocksAsserted, 333 NumberOfCheckSat, 3040 ConstructedInterpolants, 0 QuantifiedInterpolants, 408531 SizeOfPredicates, 168 NumberOfNonLiveVariables, 11437 ConjunctsInSsa, 2842 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 3212/20936 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copy_intro.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-41-50-824.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copy_intro.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-41-50-824.csv Completed graceful shutdown