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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:02:52,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:02:52,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:02:52,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:02:52,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:02:52,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:02:52,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:02:52,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:02:52,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:02:52,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:02:52,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:02:52,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:02:52,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:02:52,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:02:52,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:02:52,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:02:52,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:02:52,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:02:52,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:02:52,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:02:52,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:02:52,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:02:52,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:02:52,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:02:52,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:02:52,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:02:52,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:02:52,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:02:52,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:02:52,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:02:52,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:02:52,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:02:52,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:02:52,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:02:52,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:02:52,394 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:02:52,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:02:52,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:02:52,408 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:02:52,408 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:02:52,409 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:02:52,409 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:02:52,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:02:52,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:02:52,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:02:52,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:02:52,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:02:52,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:02:52,411 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:02:52,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:02:52,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:02:52,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:02:52,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:02:52,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:02:52,412 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:02:52,413 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:02:52,413 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:02:52,458 INFO ]: Repository-Root is: /tmp [2018-06-22 11:02:52,478 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:02:52,483 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:02:52,484 INFO ]: Initializing SmtParser... [2018-06-22 11:02:52,485 INFO ]: SmtParser initialized [2018-06-22 11:02:52,485 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-22 11:02:52,487 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 11:02:52,578 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 unknown [2018-06-22 11:02:52,850 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-22 11:02:52,862 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:02:52,867 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:02:52,867 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:02:52,867 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:02:52,867 INFO ]: ChcToBoogie initialized [2018-06-22 11:02:52,870 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,914 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52 Unit [2018-06-22 11:02:52,914 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:02:52,916 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:02:52,916 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:02:52,916 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:02:52,938 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,938 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,949 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,949 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,955 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,957 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,960 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (1/1) ... [2018-06-22 11:02:52,962 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:02:52,963 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:02:52,963 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:02:52,963 INFO ]: RCFGBuilder initialized [2018-06-22 11:02:52,968 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (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 11:02:52,981 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:02:52,981 INFO ]: Found specification of procedure False [2018-06-22 11:02:52,981 INFO ]: Found implementation of procedure False [2018-06-22 11:02:52,981 INFO ]: Specification and implementation of procedure inv_main22 given in one single declaration [2018-06-22 11:02:52,981 INFO ]: Found specification of procedure inv_main22 [2018-06-22 11:02:52,981 INFO ]: Found implementation of procedure inv_main22 [2018-06-22 11:02:52,981 INFO ]: Specification and implementation of procedure inv_main10 given in one single declaration [2018-06-22 11:02:52,981 INFO ]: Found specification of procedure inv_main10 [2018-06-22 11:02:52,981 INFO ]: Found implementation of procedure inv_main10 [2018-06-22 11:02:52,981 INFO ]: Specification and implementation of procedure inv_main11 given in one single declaration [2018-06-22 11:02:52,981 INFO ]: Found specification of procedure inv_main11 [2018-06-22 11:02:52,981 INFO ]: Found implementation of procedure inv_main11 [2018-06-22 11:02:52,981 INFO ]: Specification and implementation of procedure inv_main2 given in one single declaration [2018-06-22 11:02:52,981 INFO ]: Found specification of procedure inv_main2 [2018-06-22 11:02:52,981 INFO ]: Found implementation of procedure inv_main2 [2018-06-22 11:02:52,982 INFO ]: Specification and implementation of procedure inv_main6 given in one single declaration [2018-06-22 11:02:52,982 INFO ]: Found specification of procedure inv_main6 [2018-06-22 11:02:52,982 INFO ]: Found implementation of procedure inv_main6 [2018-06-22 11:02:52,982 INFO ]: Specification and implementation of procedure inv_main16 given in one single declaration [2018-06-22 11:02:52,982 INFO ]: Found specification of procedure inv_main16 [2018-06-22 11:02:52,982 INFO ]: Found implementation of procedure inv_main16 [2018-06-22 11:02:52,982 INFO ]: Specification and implementation of procedure inv_main19 given in one single declaration [2018-06-22 11:02:52,982 INFO ]: Found specification of procedure inv_main19 [2018-06-22 11:02:52,982 INFO ]: Found implementation of procedure inv_main19 [2018-06-22 11:02:52,982 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:02:52,982 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:02:52,982 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 11:02:53,393 INFO ]: Using library mode [2018-06-22 11:02:53,393 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:02:53 BoogieIcfgContainer [2018-06-22 11:02:53,393 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:02:53,395 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:02:53,395 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:02:53,398 INFO ]: TraceAbstraction initialized [2018-06-22 11:02:53,398 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:02:52" (1/3) ... [2018-06-22 11:02:53,399 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ce124f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:02:53, skipping insertion in model container [2018-06-22 11:02:53,399 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:02:52" (2/3) ... [2018-06-22 11:02:53,399 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ce124f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:02:53, skipping insertion in model container [2018-06-22 11:02:53,399 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:02:53" (3/3) ... [2018-06-22 11:02:53,401 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:02:53,409 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:02:53,416 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:02:53,449 INFO ]: Using default assertion order modulation [2018-06-22 11:02:53,449 INFO ]: Interprodecural is true [2018-06-22 11:02:53,449 INFO ]: Hoare is false [2018-06-22 11:02:53,449 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:02:53,449 INFO ]: Backedges is TWOTRACK [2018-06-22 11:02:53,449 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:02:53,449 INFO ]: Difference is false [2018-06-22 11:02:53,449 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:02:53,449 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:02:53,463 INFO ]: Start isEmpty. Operand 45 states. [2018-06-22 11:02:53,476 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:02:53,476 INFO ]: Found error trace [2018-06-22 11:02:53,477 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:53,477 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:53,483 INFO ]: Analyzing trace with hash -1934678967, now seen corresponding path program 1 times [2018-06-22 11:02:53,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:53,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:53,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:53,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:53,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:53,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:53,649 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:53,651 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:53,651 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:02:53,653 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:02:53,664 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:02:53,665 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:02:53,666 INFO ]: Start difference. First operand 45 states. Second operand 4 states. [2018-06-22 11:02:53,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:53,804 INFO ]: Finished difference Result 47 states and 65 transitions. [2018-06-22 11:02:53,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:02:53,807 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:02:53,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:53,817 INFO ]: With dead ends: 47 [2018-06-22 11:02:53,817 INFO ]: Without dead ends: 47 [2018-06-22 11:02:53,819 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:02:53,831 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:02:53,858 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:02:53,859 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:02:53,861 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2018-06-22 11:02:53,863 INFO ]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 13 [2018-06-22 11:02:53,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:53,864 INFO ]: Abstraction has 45 states and 63 transitions. [2018-06-22 11:02:53,864 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:02:53,864 INFO ]: Start isEmpty. Operand 45 states and 63 transitions. [2018-06-22 11:02:53,866 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:02:53,866 INFO ]: Found error trace [2018-06-22 11:02:53,866 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:53,866 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:53,867 INFO ]: Analyzing trace with hash -1287078450, now seen corresponding path program 1 times [2018-06-22 11:02:53,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:53,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:53,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:53,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:53,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:53,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:53,930 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:53,930 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:53,930 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:02:53,931 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:02:53,932 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:02:53,932 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:02:53,932 INFO ]: Start difference. First operand 45 states and 63 transitions. Second operand 4 states. [2018-06-22 11:02:54,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:54,013 INFO ]: Finished difference Result 45 states and 62 transitions. [2018-06-22 11:02:54,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:02:54,015 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:02:54,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:54,017 INFO ]: With dead ends: 45 [2018-06-22 11:02:54,017 INFO ]: Without dead ends: 44 [2018-06-22 11:02:54,018 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:02:54,018 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:02:54,031 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:02:54,031 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:02:54,037 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-06-22 11:02:54,037 INFO ]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 13 [2018-06-22 11:02:54,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:54,037 INFO ]: Abstraction has 44 states and 60 transitions. [2018-06-22 11:02:54,037 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:02:54,037 INFO ]: Start isEmpty. Operand 44 states and 60 transitions. [2018-06-22 11:02:54,038 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:02:54,038 INFO ]: Found error trace [2018-06-22 11:02:54,038 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:54,038 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:54,039 INFO ]: Analyzing trace with hash 224234923, now seen corresponding path program 1 times [2018-06-22 11:02:54,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:54,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:54,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:54,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:54,229 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:54,229 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:54,230 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:02:54,230 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:02:54,230 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:02:54,230 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:02:54,230 INFO ]: Start difference. First operand 44 states and 60 transitions. Second operand 5 states. [2018-06-22 11:02:54,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:54,277 INFO ]: Finished difference Result 48 states and 64 transitions. [2018-06-22 11:02:54,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:02:54,277 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:02:54,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:54,279 INFO ]: With dead ends: 48 [2018-06-22 11:02:54,279 INFO ]: Without dead ends: 48 [2018-06-22 11:02:54,279 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:02:54,280 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:02:54,287 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 11:02:54,288 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:02:54,289 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2018-06-22 11:02:54,289 INFO ]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 17 [2018-06-22 11:02:54,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:54,290 INFO ]: Abstraction has 46 states and 62 transitions. [2018-06-22 11:02:54,290 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:02:54,290 INFO ]: Start isEmpty. Operand 46 states and 62 transitions. [2018-06-22 11:02:54,291 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:02:54,291 INFO ]: Found error trace [2018-06-22 11:02:54,291 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:54,291 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:54,291 INFO ]: Analyzing trace with hash -1617534774, now seen corresponding path program 1 times [2018-06-22 11:02:54,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:54,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:54,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:54,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:54,419 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:54,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:54,419 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:54,419 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:54,420 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:54,420 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:54,420 INFO ]: Start difference. First operand 46 states and 62 transitions. Second operand 6 states. [2018-06-22 11:02:54,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:54,649 INFO ]: Finished difference Result 52 states and 72 transitions. [2018-06-22 11:02:54,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:54,649 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:02:54,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:54,652 INFO ]: With dead ends: 52 [2018-06-22 11:02:54,652 INFO ]: Without dead ends: 52 [2018-06-22 11:02:54,652 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:54,652 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:02:54,661 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 11:02:54,661 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:02:54,662 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-06-22 11:02:54,662 INFO ]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 21 [2018-06-22 11:02:54,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:54,663 INFO ]: Abstraction has 48 states and 65 transitions. [2018-06-22 11:02:54,663 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:54,663 INFO ]: Start isEmpty. Operand 48 states and 65 transitions. [2018-06-22 11:02:54,664 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:02:54,664 INFO ]: Found error trace [2018-06-22 11:02:54,664 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:54,664 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:54,664 INFO ]: Analyzing trace with hash 150360121, now seen corresponding path program 1 times [2018-06-22 11:02:54,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:54,664 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:54,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:54,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:54,706 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:54,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:54,706 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:54,706 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:54,707 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:54,707 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:54,707 INFO ]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-06-22 11:02:54,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:54,825 INFO ]: Finished difference Result 52 states and 68 transitions. [2018-06-22 11:02:54,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:54,825 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:02:54,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:54,826 INFO ]: With dead ends: 52 [2018-06-22 11:02:54,826 INFO ]: Without dead ends: 48 [2018-06-22 11:02:54,827 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:54,827 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:02:54,832 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 11:02:54,832 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:02:54,833 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2018-06-22 11:02:54,833 INFO ]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 21 [2018-06-22 11:02:54,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:54,834 INFO ]: Abstraction has 46 states and 62 transitions. [2018-06-22 11:02:54,834 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:54,834 INFO ]: Start isEmpty. Operand 46 states and 62 transitions. [2018-06-22 11:02:54,835 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:02:54,835 INFO ]: Found error trace [2018-06-22 11:02:54,835 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:54,835 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:54,836 INFO ]: Analyzing trace with hash -554948141, now seen corresponding path program 1 times [2018-06-22 11:02:54,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:54,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:54,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:54,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:54,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:55,230 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:02:55,431 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:55,431 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:55,431 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:02:55,431 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:02:55,432 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:02:55,432 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:55,432 INFO ]: Start difference. First operand 46 states and 62 transitions. Second operand 7 states. [2018-06-22 11:02:55,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:55,632 INFO ]: Finished difference Result 54 states and 73 transitions. [2018-06-22 11:02:55,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:02:55,633 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:02:55,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:55,635 INFO ]: With dead ends: 54 [2018-06-22 11:02:55,635 INFO ]: Without dead ends: 54 [2018-06-22 11:02:55,635 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:55,636 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:02:55,642 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 11:02:55,642 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:02:55,643 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-06-22 11:02:55,644 INFO ]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 21 [2018-06-22 11:02:55,644 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:55,644 INFO ]: Abstraction has 52 states and 71 transitions. [2018-06-22 11:02:55,644 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:02:55,644 INFO ]: Start isEmpty. Operand 52 states and 71 transitions. [2018-06-22 11:02:55,645 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:55,645 INFO ]: Found error trace [2018-06-22 11:02:55,645 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:55,646 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:55,646 INFO ]: Analyzing trace with hash 2062207316, now seen corresponding path program 1 times [2018-06-22 11:02:55,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:55,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:55,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:55,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:55,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:55,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:55,696 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:55,696 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:55,696 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:02:55,696 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:02:55,696 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:02:55,696 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:02:55,696 INFO ]: Start difference. First operand 52 states and 71 transitions. Second operand 4 states. [2018-06-22 11:02:55,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:55,755 INFO ]: Finished difference Result 52 states and 71 transitions. [2018-06-22 11:02:55,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:02:55,756 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:02:55,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:55,757 INFO ]: With dead ends: 52 [2018-06-22 11:02:55,757 INFO ]: Without dead ends: 49 [2018-06-22 11:02:55,757 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:02:55,758 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:02:55,763 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:02:55,763 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:02:55,764 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2018-06-22 11:02:55,764 INFO ]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 25 [2018-06-22 11:02:55,764 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:55,764 INFO ]: Abstraction has 47 states and 63 transitions. [2018-06-22 11:02:55,764 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:02:55,764 INFO ]: Start isEmpty. Operand 47 states and 63 transitions. [2018-06-22 11:02:55,766 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:55,766 INFO ]: Found error trace [2018-06-22 11:02:55,766 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:55,766 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:55,766 INFO ]: Analyzing trace with hash 640039605, now seen corresponding path program 1 times [2018-06-22 11:02:55,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:55,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:55,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:55,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:55,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:55,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:55,894 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:55,894 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:55,894 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:02:55,894 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:02:55,894 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:02:55,894 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:55,895 INFO ]: Start difference. First operand 47 states and 63 transitions. Second operand 6 states. [2018-06-22 11:02:56,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:56,097 INFO ]: Finished difference Result 51 states and 69 transitions. [2018-06-22 11:02:56,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:02:56,101 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:02:56,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:56,102 INFO ]: With dead ends: 51 [2018-06-22 11:02:56,102 INFO ]: Without dead ends: 51 [2018-06-22 11:02:56,103 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:02:56,103 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:02:56,108 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 11:02:56,108 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:02:56,109 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2018-06-22 11:02:56,109 INFO ]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 25 [2018-06-22 11:02:56,109 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:56,109 INFO ]: Abstraction has 51 states and 69 transitions. [2018-06-22 11:02:56,109 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:02:56,109 INFO ]: Start isEmpty. Operand 51 states and 69 transitions. [2018-06-22 11:02:56,110 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:02:56,110 INFO ]: Found error trace [2018-06-22 11:02:56,110 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:56,110 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:56,110 INFO ]: Analyzing trace with hash 275749877, now seen corresponding path program 1 times [2018-06-22 11:02:56,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:56,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:56,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:56,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:56,313 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:56,314 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:56,334 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:02:56,334 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:02:56,334 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:02:56,334 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:56,334 INFO ]: Start difference. First operand 51 states and 69 transitions. Second operand 7 states. [2018-06-22 11:02:56,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:56,424 INFO ]: Finished difference Result 51 states and 69 transitions. [2018-06-22 11:02:56,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:02:56,424 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:02:56,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:56,425 INFO ]: With dead ends: 51 [2018-06-22 11:02:56,425 INFO ]: Without dead ends: 51 [2018-06-22 11:02:56,425 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:56,425 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:02:56,430 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-22 11:02:56,430 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:02:56,431 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-06-22 11:02:56,431 INFO ]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 25 [2018-06-22 11:02:56,431 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:56,431 INFO ]: Abstraction has 49 states and 65 transitions. [2018-06-22 11:02:56,431 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:02:56,431 INFO ]: Start isEmpty. Operand 49 states and 65 transitions. [2018-06-22 11:02:56,432 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:02:56,432 INFO ]: Found error trace [2018-06-22 11:02:56,432 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:56,432 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:56,432 INFO ]: Analyzing trace with hash 823349588, now seen corresponding path program 1 times [2018-06-22 11:02:56,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:56,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:56,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:56,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:56,643 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:56,643 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:56,643 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 11:02:56,643 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:02:56,644 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:02:56,644 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:02:56,644 INFO ]: Start difference. First operand 49 states and 65 transitions. Second operand 10 states. [2018-06-22 11:02:56,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:56,895 INFO ]: Finished difference Result 57 states and 77 transitions. [2018-06-22 11:02:56,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:02:56,896 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 11:02:56,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:56,896 INFO ]: With dead ends: 57 [2018-06-22 11:02:56,896 INFO ]: Without dead ends: 57 [2018-06-22 11:02:56,897 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:02:56,897 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:02:56,903 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:02:56,903 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:02:56,904 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2018-06-22 11:02:56,904 INFO ]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 29 [2018-06-22 11:02:56,904 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:56,904 INFO ]: Abstraction has 53 states and 71 transitions. [2018-06-22 11:02:56,904 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:02:56,904 INFO ]: Start isEmpty. Operand 53 states and 71 transitions. [2018-06-22 11:02:56,905 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:02:56,905 INFO ]: Found error trace [2018-06-22 11:02:56,905 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:56,905 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:56,906 INFO ]: Analyzing trace with hash 1535806045, now seen corresponding path program 1 times [2018-06-22 11:02:56,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:56,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:56,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:56,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:56,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:57,035 INFO ]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:02:57,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:57,035 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 11:02:57,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:57,084 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:57,094 INFO ]: Computing forward predicates... [2018-06-22 11:02:57,388 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:57,419 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:57,419 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-06-22 11:02:57,419 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:02:57,419 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:02:57,419 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:02:57,420 INFO ]: Start difference. First operand 53 states and 71 transitions. Second operand 16 states. [2018-06-22 11:02:57,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:57,845 INFO ]: Finished difference Result 69 states and 93 transitions. [2018-06-22 11:02:57,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:02:57,845 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:02:57,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:57,846 INFO ]: With dead ends: 69 [2018-06-22 11:02:57,847 INFO ]: Without dead ends: 69 [2018-06-22 11:02:57,847 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:02:57,847 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:02:57,866 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 59. [2018-06-22 11:02:57,866 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:02:57,867 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2018-06-22 11:02:57,867 INFO ]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 29 [2018-06-22 11:02:57,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:57,867 INFO ]: Abstraction has 59 states and 80 transitions. [2018-06-22 11:02:57,867 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:02:57,867 INFO ]: Start isEmpty. Operand 59 states and 80 transitions. [2018-06-22 11:02:57,868 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:57,868 INFO ]: Found error trace [2018-06-22 11:02:57,868 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:57,868 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:57,868 INFO ]: Analyzing trace with hash -1528664286, now seen corresponding path program 1 times [2018-06-22 11:02:57,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:57,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:57,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:57,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:57,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:57,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:57,996 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:02:57,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:57,996 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:02:57,996 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:02:57,996 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:02:57,997 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:02:57,997 INFO ]: Start difference. First operand 59 states and 80 transitions. Second operand 9 states. [2018-06-22 11:02:58,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:58,087 INFO ]: Finished difference Result 67 states and 90 transitions. [2018-06-22 11:02:58,088 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:02:58,088 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 11:02:58,088 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:58,089 INFO ]: With dead ends: 67 [2018-06-22 11:02:58,089 INFO ]: Without dead ends: 63 [2018-06-22 11:02:58,089 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:02:58,089 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:02:58,095 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-06-22 11:02:58,095 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:02:58,096 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2018-06-22 11:02:58,096 INFO ]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 33 [2018-06-22 11:02:58,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:58,096 INFO ]: Abstraction has 61 states and 83 transitions. [2018-06-22 11:02:58,096 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:02:58,096 INFO ]: Start isEmpty. Operand 61 states and 83 transitions. [2018-06-22 11:02:58,097 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:58,097 INFO ]: Found error trace [2018-06-22 11:02:58,097 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:58,097 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:58,097 INFO ]: Analyzing trace with hash 1565190238, now seen corresponding path program 1 times [2018-06-22 11:02:58,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:58,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:58,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:58,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:58,157 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:58,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:58,157 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:02:58,158 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:02:58,158 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:02:58,158 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:02:58,158 INFO ]: Start difference. First operand 61 states and 83 transitions. Second operand 7 states. [2018-06-22 11:02:58,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:58,252 INFO ]: Finished difference Result 72 states and 98 transitions. [2018-06-22 11:02:58,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:02:58,253 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-22 11:02:58,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:58,254 INFO ]: With dead ends: 72 [2018-06-22 11:02:58,254 INFO ]: Without dead ends: 67 [2018-06-22 11:02:58,254 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:02:58,254 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:02:58,259 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-06-22 11:02:58,259 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:02:58,260 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2018-06-22 11:02:58,261 INFO ]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 33 [2018-06-22 11:02:58,261 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:58,261 INFO ]: Abstraction has 65 states and 86 transitions. [2018-06-22 11:02:58,261 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:02:58,261 INFO ]: Start isEmpty. Operand 65 states and 86 transitions. [2018-06-22 11:02:58,262 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:58,262 INFO ]: Found error trace [2018-06-22 11:02:58,262 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:58,262 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:58,262 INFO ]: Analyzing trace with hash 1405388921, now seen corresponding path program 1 times [2018-06-22 11:02:58,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:58,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:58,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:58,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,272 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:58,451 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:02:58,451 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:58,451 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 11:02:58,451 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:02:58,451 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:02:58,452 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:02:58,452 INFO ]: Start difference. First operand 65 states and 86 transitions. Second operand 11 states. [2018-06-22 11:02:58,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:58,728 INFO ]: Finished difference Result 75 states and 98 transitions. [2018-06-22 11:02:58,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:02:58,728 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:02:58,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:58,729 INFO ]: With dead ends: 75 [2018-06-22 11:02:58,729 INFO ]: Without dead ends: 67 [2018-06-22 11:02:58,729 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:02:58,729 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:02:58,735 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-06-22 11:02:58,735 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:02:58,736 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-06-22 11:02:58,736 INFO ]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 33 [2018-06-22 11:02:58,736 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:58,736 INFO ]: Abstraction has 63 states and 83 transitions. [2018-06-22 11:02:58,736 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:02:58,736 INFO ]: Start isEmpty. Operand 63 states and 83 transitions. [2018-06-22 11:02:58,737 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:58,737 INFO ]: Found error trace [2018-06-22 11:02:58,737 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:58,737 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:58,737 INFO ]: Analyzing trace with hash -1459899521, now seen corresponding path program 1 times [2018-06-22 11:02:58,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:58,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:58,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:58,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,745 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:58,863 INFO ]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:02:58,863 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:58,863 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:02:58,863 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:02:58,863 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:02:58,863 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:02:58,863 INFO ]: Start difference. First operand 63 states and 83 transitions. Second operand 8 states. [2018-06-22 11:02:58,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:58,910 INFO ]: Finished difference Result 51 states and 61 transitions. [2018-06-22 11:02:58,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:02:58,910 INFO ]: Start accepts. Automaton has 8 states. Word has length 33 [2018-06-22 11:02:58,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:58,911 INFO ]: With dead ends: 51 [2018-06-22 11:02:58,911 INFO ]: Without dead ends: 42 [2018-06-22 11:02:58,911 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:02:58,911 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:02:58,916 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:02:58,916 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:02:58,916 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-06-22 11:02:58,916 INFO ]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 33 [2018-06-22 11:02:58,916 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:58,916 INFO ]: Abstraction has 42 states and 49 transitions. [2018-06-22 11:02:58,916 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:02:58,916 INFO ]: Start isEmpty. Operand 42 states and 49 transitions. [2018-06-22 11:02:58,917 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:02:58,917 INFO ]: Found error trace [2018-06-22 11:02:58,917 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:58,917 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:58,917 INFO ]: Analyzing trace with hash -1436319041, now seen corresponding path program 1 times [2018-06-22 11:02:58,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:58,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:58,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:58,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:58,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:59,113 INFO ]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:02:59,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:02:59,113 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 11:02:59,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:59,142 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:59,146 INFO ]: Computing forward predicates... [2018-06-22 11:02:59,330 INFO ]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:59,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:02:59,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 11:02:59,350 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:02:59,351 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:02:59,351 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:02:59,351 INFO ]: Start difference. First operand 42 states and 49 transitions. Second operand 14 states. [2018-06-22 11:02:59,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:59,605 INFO ]: Finished difference Result 42 states and 48 transitions. [2018-06-22 11:02:59,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:02:59,606 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:02:59,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:59,606 INFO ]: With dead ends: 42 [2018-06-22 11:02:59,606 INFO ]: Without dead ends: 41 [2018-06-22 11:02:59,607 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:02:59,607 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:02:59,609 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 11:02:59,609 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:02:59,609 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-22 11:02:59,609 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2018-06-22 11:02:59,609 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:59,609 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-22 11:02:59,609 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:02:59,609 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-22 11:02:59,610 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:02:59,610 INFO ]: Found error trace [2018-06-22 11:02:59,610 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:59,610 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:59,611 INFO ]: Analyzing trace with hash -385082146, now seen corresponding path program 1 times [2018-06-22 11:02:59,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:59,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:59,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:59,611 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:59,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:59,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:02:59,875 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:02:59,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:02:59,875 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 11:02:59,875 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:02:59,876 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:02:59,876 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:02:59,876 INFO ]: Start difference. First operand 41 states and 46 transitions. Second operand 12 states. [2018-06-22 11:02:59,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:02:59,983 INFO ]: Finished difference Result 45 states and 50 transitions. [2018-06-22 11:02:59,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:02:59,983 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 11:02:59,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:02:59,984 INFO ]: With dead ends: 45 [2018-06-22 11:02:59,984 INFO ]: Without dead ends: 42 [2018-06-22 11:02:59,984 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:02:59,984 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:02:59,986 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-06-22 11:02:59,986 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:02:59,987 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 11:02:59,987 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2018-06-22 11:02:59,987 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:02:59,987 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 11:02:59,987 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:02:59,987 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 11:02:59,987 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:02:59,987 INFO ]: Found error trace [2018-06-22 11:02:59,987 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:02:59,988 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:02:59,988 INFO ]: Analyzing trace with hash -502065789, now seen corresponding path program 1 times [2018-06-22 11:02:59,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:02:59,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:02:59,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:02:59,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:02:59,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:00,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:00,257 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:03:00,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:00,257 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 11:03:00,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:00,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:00,298 INFO ]: Computing forward predicates... [2018-06-22 11:03:00,593 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:03:00,612 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:00,612 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-22 11:03:00,612 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:03:00,613 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:03:00,613 INFO ]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:03:00,613 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 24 states. [2018-06-22 11:03:00,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:00,988 INFO ]: Finished difference Result 54 states and 59 transitions. [2018-06-22 11:03:00,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:03:00,989 INFO ]: Start accepts. Automaton has 24 states. Word has length 41 [2018-06-22 11:03:00,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:00,989 INFO ]: With dead ends: 54 [2018-06-22 11:03:00,989 INFO ]: Without dead ends: 50 [2018-06-22 11:03:00,990 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:03:00,990 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:03:00,996 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 11:03:00,996 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:03:00,996 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-22 11:03:00,997 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 41 [2018-06-22 11:03:00,997 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:00,997 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-22 11:03:00,997 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:03:00,997 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-22 11:03:00,997 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:03:00,997 INFO ]: Found error trace [2018-06-22 11:03:00,997 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:00,998 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:00,998 INFO ]: Analyzing trace with hash 1452619496, now seen corresponding path program 2 times [2018-06-22 11:03:00,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:00,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:00,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:00,998 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:00,998 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:01,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:01,785 INFO ]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:03:01,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:01,785 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 11:03:01,791 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:01,815 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:01,815 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:01,819 INFO ]: Computing forward predicates... [2018-06-22 11:03:02,199 INFO ]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:03:02,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:02,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2018-06-22 11:03:02,219 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:03:02,219 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:03:02,219 INFO ]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:03:02,219 INFO ]: Start difference. First operand 48 states and 52 transitions. Second operand 24 states. [2018-06-22 11:03:02,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:02,506 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-22 11:03:02,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:03:02,506 INFO ]: Start accepts. Automaton has 24 states. Word has length 45 [2018-06-22 11:03:02,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:02,507 INFO ]: With dead ends: 50 [2018-06-22 11:03:02,507 INFO ]: Without dead ends: 44 [2018-06-22 11:03:02,507 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:03:02,507 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:03:02,509 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:03:02,509 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:03:02,510 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 11:03:02,510 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 45 [2018-06-22 11:03:02,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:02,510 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 11:03:02,510 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:03:02,510 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 11:03:02,510 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:03:02,510 INFO ]: Found error trace [2018-06-22 11:03:02,510 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:02,510 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:02,511 INFO ]: Analyzing trace with hash 1155612045, now seen corresponding path program 3 times [2018-06-22 11:03:02,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:02,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:02,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:02,511 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:02,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:02,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:02,813 INFO ]: Checked inductivity of 25 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:03:02,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:02,813 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 11:03:02,818 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:02,846 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:03:02,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:02,850 INFO ]: Computing forward predicates... [2018-06-22 11:03:03,527 INFO ]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:03:03,546 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:03,546 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2018-06-22 11:03:03,546 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:03:03,546 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:03:03,546 INFO ]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:03:03,546 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 27 states. [2018-06-22 11:03:04,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:04,121 INFO ]: Finished difference Result 50 states and 54 transitions. [2018-06-22 11:03:04,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:03:04,121 INFO ]: Start accepts. Automaton has 27 states. Word has length 49 [2018-06-22 11:03:04,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:04,122 INFO ]: With dead ends: 50 [2018-06-22 11:03:04,122 INFO ]: Without dead ends: 48 [2018-06-22 11:03:04,123 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:03:04,123 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:03:04,125 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 11:03:04,125 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:03:04,126 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-06-22 11:03:04,126 INFO ]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 49 [2018-06-22 11:03:04,126 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:04,126 INFO ]: Abstraction has 46 states and 49 transitions. [2018-06-22 11:03:04,126 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:03:04,126 INFO ]: Start isEmpty. Operand 46 states and 49 transitions. [2018-06-22 11:03:04,126 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:03:04,126 INFO ]: Found error trace [2018-06-22 11:03:04,127 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:04,127 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:04,127 INFO ]: Analyzing trace with hash 1878655090, now seen corresponding path program 4 times [2018-06-22 11:03:04,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:04,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:04,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:04,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:04,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:04,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:04,890 INFO ]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:03:04,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:04,890 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 11:03:04,902 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:04,939 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:04,939 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:04,950 INFO ]: Computing forward predicates... [2018-06-22 11:03:05,327 INFO ]: Checked inductivity of 32 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:03:05,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:05,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 30 [2018-06-22 11:03:05,347 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:03:05,347 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:03:05,348 INFO ]: CoverageRelationStatistics Valid=62, Invalid=808, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:03:05,348 INFO ]: Start difference. First operand 46 states and 49 transitions. Second operand 30 states. [2018-06-22 11:03:05,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:05,972 INFO ]: Finished difference Result 62 states and 67 transitions. [2018-06-22 11:03:05,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:03:05,973 INFO ]: Start accepts. Automaton has 30 states. Word has length 53 [2018-06-22 11:03:05,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:05,974 INFO ]: With dead ends: 62 [2018-06-22 11:03:05,974 INFO ]: Without dead ends: 58 [2018-06-22 11:03:05,974 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:03:05,975 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:03:05,979 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-06-22 11:03:05,979 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:03:05,980 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-06-22 11:03:05,980 INFO ]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 53 [2018-06-22 11:03:05,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:05,980 INFO ]: Abstraction has 54 states and 58 transitions. [2018-06-22 11:03:05,980 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:03:05,980 INFO ]: Start isEmpty. Operand 54 states and 58 transitions. [2018-06-22 11:03:05,981 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:03:05,981 INFO ]: Found error trace [2018-06-22 11:03:05,982 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:05,982 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:05,982 INFO ]: Analyzing trace with hash -954770409, now seen corresponding path program 5 times [2018-06-22 11:03:05,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:05,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:05,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:05,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:05,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:05,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:06,581 INFO ]: Checked inductivity of 43 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:03:06,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:06,581 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 11:03:06,587 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:06,629 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:03:06,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:06,634 INFO ]: Computing forward predicates... [2018-06-22 11:03:06,877 INFO ]: Checked inductivity of 43 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:03:06,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:06,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2018-06-22 11:03:06,898 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:03:06,898 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:03:06,899 INFO ]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:03:06,899 INFO ]: Start difference. First operand 54 states and 58 transitions. Second operand 30 states. [2018-06-22 11:03:07,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:07,274 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-22 11:03:07,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:03:07,276 INFO ]: Start accepts. Automaton has 30 states. Word has length 57 [2018-06-22 11:03:07,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:07,276 INFO ]: With dead ends: 58 [2018-06-22 11:03:07,276 INFO ]: Without dead ends: 50 [2018-06-22 11:03:07,277 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:03:07,277 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:03:07,278 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 11:03:07,278 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:03:07,279 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-06-22 11:03:07,279 INFO ]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 57 [2018-06-22 11:03:07,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:07,279 INFO ]: Abstraction has 50 states and 53 transitions. [2018-06-22 11:03:07,279 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:03:07,279 INFO ]: Start isEmpty. Operand 50 states and 53 transitions. [2018-06-22 11:03:07,279 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:03:07,279 INFO ]: Found error trace [2018-06-22 11:03:07,279 INFO ]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:07,280 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:07,280 INFO ]: Analyzing trace with hash 1578247420, now seen corresponding path program 6 times [2018-06-22 11:03:07,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:07,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:07,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:07,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:07,547 INFO ]: Checked inductivity of 55 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:03:07,547 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:07,547 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 11:03:07,553 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:07,611 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 11:03:07,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:07,615 INFO ]: Computing forward predicates... [2018-06-22 11:03:07,983 INFO ]: Checked inductivity of 55 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:03:08,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:08,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2018-06-22 11:03:08,009 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:03:08,009 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:03:08,009 INFO ]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:03:08,009 INFO ]: Start difference. First operand 50 states and 53 transitions. Second operand 33 states. [2018-06-22 11:03:08,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:08,408 INFO ]: Finished difference Result 56 states and 60 transitions. [2018-06-22 11:03:08,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:03:08,408 INFO ]: Start accepts. Automaton has 33 states. Word has length 61 [2018-06-22 11:03:08,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:08,408 INFO ]: With dead ends: 56 [2018-06-22 11:03:08,408 INFO ]: Without dead ends: 54 [2018-06-22 11:03:08,409 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=1858, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:03:08,409 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:03:08,411 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 11:03:08,411 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:03:08,412 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-06-22 11:03:08,412 INFO ]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 61 [2018-06-22 11:03:08,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:08,412 INFO ]: Abstraction has 52 states and 55 transitions. [2018-06-22 11:03:08,412 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:03:08,412 INFO ]: Start isEmpty. Operand 52 states and 55 transitions. [2018-06-22 11:03:08,413 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:03:08,413 INFO ]: Found error trace [2018-06-22 11:03:08,413 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:08,413 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:08,413 INFO ]: Analyzing trace with hash -127991263, now seen corresponding path program 7 times [2018-06-22 11:03:08,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:08,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:08,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:08,414 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:08,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:08,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:09,208 INFO ]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:03:09,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:09,208 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 11:03:09,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:09,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:09,256 INFO ]: Computing forward predicates... [2018-06-22 11:03:09,777 INFO ]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:03:09,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:09,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2018-06-22 11:03:09,796 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:03:09,797 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:03:09,797 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:03:09,797 INFO ]: Start difference. First operand 52 states and 55 transitions. Second operand 36 states. [2018-06-22 11:03:10,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:10,827 INFO ]: Finished difference Result 70 states and 75 transitions. [2018-06-22 11:03:10,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:03:10,829 INFO ]: Start accepts. Automaton has 36 states. Word has length 65 [2018-06-22 11:03:10,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:10,829 INFO ]: With dead ends: 70 [2018-06-22 11:03:10,829 INFO ]: Without dead ends: 66 [2018-06-22 11:03:10,830 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=2304, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:03:10,830 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:03:10,835 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-06-22 11:03:10,835 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:03:10,835 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-06-22 11:03:10,835 INFO ]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 65 [2018-06-22 11:03:10,836 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:10,836 INFO ]: Abstraction has 60 states and 64 transitions. [2018-06-22 11:03:10,836 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:03:10,836 INFO ]: Start isEmpty. Operand 60 states and 64 transitions. [2018-06-22 11:03:10,836 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:03:10,836 INFO ]: Found error trace [2018-06-22 11:03:10,836 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:10,836 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:10,836 INFO ]: Analyzing trace with hash -1956255738, now seen corresponding path program 8 times [2018-06-22 11:03:10,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:10,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:10,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:10,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:10,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:10,858 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:11,189 INFO ]: Checked inductivity of 81 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:03:11,189 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:11,189 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 11:03:11,196 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:11,238 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:11,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:11,242 INFO ]: Computing forward predicates... [2018-06-22 11:03:11,585 INFO ]: Checked inductivity of 81 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:03:11,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:11,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 36 [2018-06-22 11:03:11,608 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:03:11,608 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:03:11,609 INFO ]: CoverageRelationStatistics Valid=121, Invalid=1139, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:03:11,609 INFO ]: Start difference. First operand 60 states and 64 transitions. Second operand 36 states. [2018-06-22 11:03:12,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:12,250 INFO ]: Finished difference Result 66 states and 69 transitions. [2018-06-22 11:03:12,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:03:12,250 INFO ]: Start accepts. Automaton has 36 states. Word has length 69 [2018-06-22 11:03:12,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:12,251 INFO ]: With dead ends: 66 [2018-06-22 11:03:12,251 INFO ]: Without dead ends: 56 [2018-06-22 11:03:12,252 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=2198, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:03:12,252 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:03:12,255 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:03:12,255 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:03:12,255 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-06-22 11:03:12,255 INFO ]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 69 [2018-06-22 11:03:12,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:12,255 INFO ]: Abstraction has 56 states and 59 transitions. [2018-06-22 11:03:12,255 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:03:12,256 INFO ]: Start isEmpty. Operand 56 states and 59 transitions. [2018-06-22 11:03:12,256 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:03:12,256 INFO ]: Found error trace [2018-06-22 11:03:12,257 INFO ]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:12,257 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:12,257 INFO ]: Analyzing trace with hash 1824375595, now seen corresponding path program 9 times [2018-06-22 11:03:12,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:12,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:12,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:12,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:12,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:12,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:12,597 INFO ]: Checked inductivity of 97 backedges. 40 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 11:03:12,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:12,597 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 11:03:12,603 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:12,644 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:03:12,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:12,647 INFO ]: Computing forward predicates... [2018-06-22 11:03:12,963 INFO ]: Checked inductivity of 97 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:03:12,981 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:12,982 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 38 [2018-06-22 11:03:12,982 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:03:12,982 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:03:12,982 INFO ]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:03:12,982 INFO ]: Start difference. First operand 56 states and 59 transitions. Second operand 38 states. [2018-06-22 11:03:13,536 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-06-22 11:03:13,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:13,738 INFO ]: Finished difference Result 62 states and 66 transitions. [2018-06-22 11:03:13,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:03:13,738 INFO ]: Start accepts. Automaton has 38 states. Word has length 73 [2018-06-22 11:03:13,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:13,739 INFO ]: With dead ends: 62 [2018-06-22 11:03:13,739 INFO ]: Without dead ends: 60 [2018-06-22 11:03:13,739 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:03:13,739 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:03:13,741 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 11:03:13,742 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:03:13,742 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-06-22 11:03:13,742 INFO ]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 73 [2018-06-22 11:03:13,742 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:13,742 INFO ]: Abstraction has 58 states and 61 transitions. [2018-06-22 11:03:13,742 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:03:13,742 INFO ]: Start isEmpty. Operand 58 states and 61 transitions. [2018-06-22 11:03:13,743 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:03:13,743 INFO ]: Found error trace [2018-06-22 11:03:13,743 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:13,743 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:13,743 INFO ]: Analyzing trace with hash 2045053584, now seen corresponding path program 10 times [2018-06-22 11:03:13,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:13,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:13,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:13,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:13,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:13,761 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:14,333 INFO ]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:03:14,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:14,333 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 11:03:14,339 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:14,378 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:14,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:14,384 INFO ]: Computing forward predicates... [2018-06-22 11:03:15,470 INFO ]: Checked inductivity of 112 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:03:15,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:15,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2018-06-22 11:03:15,502 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:03:15,502 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:03:15,503 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1634, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:03:15,503 INFO ]: Start difference. First operand 58 states and 61 transitions. Second operand 42 states. [2018-06-22 11:03:16,400 WARN ]: Spent 230.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-06-22 11:03:16,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:16,809 INFO ]: Finished difference Result 78 states and 83 transitions. [2018-06-22 11:03:16,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:03:16,809 INFO ]: Start accepts. Automaton has 42 states. Word has length 77 [2018-06-22 11:03:16,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:16,810 INFO ]: With dead ends: 78 [2018-06-22 11:03:16,810 INFO ]: Without dead ends: 74 [2018-06-22 11:03:16,811 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=175, Invalid=3247, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:03:16,811 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:03:16,817 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-06-22 11:03:16,817 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:03:16,817 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-06-22 11:03:16,817 INFO ]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 77 [2018-06-22 11:03:16,818 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:16,818 INFO ]: Abstraction has 66 states and 70 transitions. [2018-06-22 11:03:16,818 INFO ]: Interpolant automaton has 42 states. [2018-06-22 11:03:16,818 INFO ]: Start isEmpty. Operand 66 states and 70 transitions. [2018-06-22 11:03:16,818 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:03:16,818 INFO ]: Found error trace [2018-06-22 11:03:16,818 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:16,819 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:16,820 INFO ]: Analyzing trace with hash -1750611275, now seen corresponding path program 11 times [2018-06-22 11:03:16,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:16,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:16,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:16,820 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:16,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:16,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:17,224 INFO ]: Checked inductivity of 131 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 11:03:17,224 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:17,224 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 11:03:17,234 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:17,282 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:03:17,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:17,289 INFO ]: Computing forward predicates... [2018-06-22 11:03:18,235 INFO ]: Checked inductivity of 131 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:03:18,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:18,267 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 42 [2018-06-22 11:03:18,268 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:03:18,268 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:03:18,268 INFO ]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:03:18,268 INFO ]: Start difference. First operand 66 states and 70 transitions. Second operand 42 states. [2018-06-22 11:03:18,885 WARN ]: Spent 263.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 11:03:19,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:19,286 INFO ]: Finished difference Result 74 states and 77 transitions. [2018-06-22 11:03:19,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:03:19,286 INFO ]: Start accepts. Automaton has 42 states. Word has length 81 [2018-06-22 11:03:19,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:19,286 INFO ]: With dead ends: 74 [2018-06-22 11:03:19,286 INFO ]: Without dead ends: 62 [2018-06-22 11:03:19,287 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=347, Invalid=3075, Unknown=0, NotChecked=0, Total=3422 [2018-06-22 11:03:19,287 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:03:19,289 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 11:03:19,289 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:03:19,289 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-06-22 11:03:19,289 INFO ]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 81 [2018-06-22 11:03:19,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:19,289 INFO ]: Abstraction has 62 states and 65 transitions. [2018-06-22 11:03:19,289 INFO ]: Interpolant automaton has 42 states. [2018-06-22 11:03:19,289 INFO ]: Start isEmpty. Operand 62 states and 65 transitions. [2018-06-22 11:03:19,290 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:03:19,290 INFO ]: Found error trace [2018-06-22 11:03:19,290 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:19,290 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:19,290 INFO ]: Analyzing trace with hash -1542518758, now seen corresponding path program 12 times [2018-06-22 11:03:19,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:19,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:19,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:19,291 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:19,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:19,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:19,646 INFO ]: Checked inductivity of 151 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:03:19,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:19,646 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 11:03:19,652 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:19,712 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:03:19,712 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:19,716 INFO ]: Computing forward predicates... [2018-06-22 11:03:20,234 INFO ]: Checked inductivity of 151 backedges. 40 proven. 44 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:03:20,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:20,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2018-06-22 11:03:20,254 INFO ]: Interpolant automaton has 45 states [2018-06-22 11:03:20,254 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-22 11:03:20,254 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1806, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:03:20,254 INFO ]: Start difference. First operand 62 states and 65 transitions. Second operand 45 states. [2018-06-22 11:03:20,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:20,945 INFO ]: Finished difference Result 68 states and 72 transitions. [2018-06-22 11:03:20,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:03:20,945 INFO ]: Start accepts. Automaton has 45 states. Word has length 85 [2018-06-22 11:03:20,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:20,945 INFO ]: With dead ends: 68 [2018-06-22 11:03:20,945 INFO ]: Without dead ends: 66 [2018-06-22 11:03:20,947 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=402, Invalid=3630, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 11:03:20,947 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:03:20,949 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-06-22 11:03:20,949 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:03:20,950 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-06-22 11:03:20,950 INFO ]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 85 [2018-06-22 11:03:20,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:20,953 INFO ]: Abstraction has 64 states and 67 transitions. [2018-06-22 11:03:20,953 INFO ]: Interpolant automaton has 45 states. [2018-06-22 11:03:20,953 INFO ]: Start isEmpty. Operand 64 states and 67 transitions. [2018-06-22 11:03:20,954 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:03:20,954 INFO ]: Found error trace [2018-06-22 11:03:20,954 INFO ]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:20,954 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:20,954 INFO ]: Analyzing trace with hash -1690629697, now seen corresponding path program 13 times [2018-06-22 11:03:20,954 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:20,954 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:20,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:20,955 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:20,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:20,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:21,935 INFO ]: Checked inductivity of 170 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-22 11:03:21,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:21,935 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 11:03:21,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:21,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:21,999 INFO ]: Computing forward predicates... [2018-06-22 11:03:22,917 INFO ]: Checked inductivity of 170 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 11:03:22,936 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:22,936 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2018-06-22 11:03:22,937 INFO ]: Interpolant automaton has 48 states [2018-06-22 11:03:22,937 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 11:03:22,937 INFO ]: CoverageRelationStatistics Valid=101, Invalid=2155, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:03:22,937 INFO ]: Start difference. First operand 64 states and 67 transitions. Second operand 48 states. [2018-06-22 11:03:24,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:24,392 INFO ]: Finished difference Result 86 states and 91 transitions. [2018-06-22 11:03:24,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:03:24,392 INFO ]: Start accepts. Automaton has 48 states. Word has length 89 [2018-06-22 11:03:24,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:24,392 INFO ]: With dead ends: 86 [2018-06-22 11:03:24,392 INFO ]: Without dead ends: 82 [2018-06-22 11:03:24,393 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 63 SyntacticMatches, 14 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=204, Invalid=4352, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:03:24,394 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:03:24,397 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-06-22 11:03:24,397 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:03:24,398 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-06-22 11:03:24,398 INFO ]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 89 [2018-06-22 11:03:24,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:24,398 INFO ]: Abstraction has 72 states and 76 transitions. [2018-06-22 11:03:24,398 INFO ]: Interpolant automaton has 48 states. [2018-06-22 11:03:24,398 INFO ]: Start isEmpty. Operand 72 states and 76 transitions. [2018-06-22 11:03:24,399 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:03:24,399 INFO ]: Found error trace [2018-06-22 11:03:24,399 INFO ]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:24,399 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:24,399 INFO ]: Analyzing trace with hash -183503836, now seen corresponding path program 14 times [2018-06-22 11:03:24,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:24,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:24,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:24,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:24,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:24,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:24,981 INFO ]: Checked inductivity of 193 backedges. 42 proven. 69 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 11:03:24,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:24,981 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 11:03:24,988 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:25,070 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:25,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:25,076 INFO ]: Computing forward predicates... [2018-06-22 11:03:25,755 INFO ]: Checked inductivity of 193 backedges. 42 proven. 65 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-22 11:03:25,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:25,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 48 [2018-06-22 11:03:25,776 INFO ]: Interpolant automaton has 48 states [2018-06-22 11:03:25,776 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 11:03:25,776 INFO ]: CoverageRelationStatistics Valid=212, Invalid=2044, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:03:25,777 INFO ]: Start difference. First operand 72 states and 76 transitions. Second operand 48 states. [2018-06-22 11:03:26,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:26,453 INFO ]: Finished difference Result 82 states and 85 transitions. [2018-06-22 11:03:26,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:03:26,453 INFO ]: Start accepts. Automaton has 48 states. Word has length 93 [2018-06-22 11:03:26,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:26,453 INFO ]: With dead ends: 82 [2018-06-22 11:03:26,453 INFO ]: Without dead ends: 68 [2018-06-22 11:03:26,454 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=4098, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:03:26,455 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:03:26,457 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-06-22 11:03:26,457 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:03:26,458 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-06-22 11:03:26,458 INFO ]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 93 [2018-06-22 11:03:26,458 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:26,458 INFO ]: Abstraction has 68 states and 71 transitions. [2018-06-22 11:03:26,458 INFO ]: Interpolant automaton has 48 states. [2018-06-22 11:03:26,458 INFO ]: Start isEmpty. Operand 68 states and 71 transitions. [2018-06-22 11:03:26,458 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:03:26,458 INFO ]: Found error trace [2018-06-22 11:03:26,459 INFO ]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:26,459 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:26,459 INFO ]: Analyzing trace with hash 2034033609, now seen corresponding path program 15 times [2018-06-22 11:03:26,459 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:26,459 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:26,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:26,459 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:26,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:26,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:27,737 INFO ]: Checked inductivity of 217 backedges. 84 proven. 39 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-22 11:03:27,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:27,737 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 11:03:27,767 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:27,830 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:03:27,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:27,835 INFO ]: Computing forward predicates... [2018-06-22 11:03:28,634 INFO ]: Checked inductivity of 217 backedges. 84 proven. 30 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-22 11:03:28,658 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:28,658 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 50 [2018-06-22 11:03:28,658 INFO ]: Interpolant automaton has 50 states [2018-06-22 11:03:28,658 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 11:03:28,659 INFO ]: CoverageRelationStatistics Valid=234, Invalid=2216, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:03:28,659 INFO ]: Start difference. First operand 68 states and 71 transitions. Second operand 50 states. [2018-06-22 11:03:29,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:29,361 INFO ]: Finished difference Result 74 states and 78 transitions. [2018-06-22 11:03:29,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:03:29,361 INFO ]: Start accepts. Automaton has 50 states. Word has length 97 [2018-06-22 11:03:29,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:29,362 INFO ]: With dead ends: 74 [2018-06-22 11:03:29,362 INFO ]: Without dead ends: 72 [2018-06-22 11:03:29,363 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=514, Invalid=4456, Unknown=0, NotChecked=0, Total=4970 [2018-06-22 11:03:29,363 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:03:29,366 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-06-22 11:03:29,366 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:03:29,367 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-06-22 11:03:29,367 INFO ]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 97 [2018-06-22 11:03:29,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:29,367 INFO ]: Abstraction has 70 states and 73 transitions. [2018-06-22 11:03:29,367 INFO ]: Interpolant automaton has 50 states. [2018-06-22 11:03:29,367 INFO ]: Start isEmpty. Operand 70 states and 73 transitions. [2018-06-22 11:03:29,368 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:03:29,368 INFO ]: Found error trace [2018-06-22 11:03:29,368 INFO ]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:29,368 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:29,368 INFO ]: Analyzing trace with hash 840691630, now seen corresponding path program 16 times [2018-06-22 11:03:29,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:29,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:29,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:29,369 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:29,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:29,397 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:30,301 INFO ]: Checked inductivity of 240 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-06-22 11:03:30,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:30,302 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 11:03:30,308 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:30,380 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:30,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:30,390 INFO ]: Computing forward predicates... [2018-06-22 11:03:31,678 INFO ]: Checked inductivity of 240 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-22 11:03:31,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:31,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 54 [2018-06-22 11:03:31,699 INFO ]: Interpolant automaton has 54 states [2018-06-22 11:03:31,699 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 11:03:31,699 INFO ]: CoverageRelationStatistics Valid=114, Invalid=2748, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:03:31,699 INFO ]: Start difference. First operand 70 states and 73 transitions. Second operand 54 states. [2018-06-22 11:03:33,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:33,274 INFO ]: Finished difference Result 94 states and 99 transitions. [2018-06-22 11:03:33,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:03:33,274 INFO ]: Start accepts. Automaton has 54 states. Word has length 101 [2018-06-22 11:03:33,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:33,275 INFO ]: With dead ends: 94 [2018-06-22 11:03:33,275 INFO ]: Without dead ends: 90 [2018-06-22 11:03:33,276 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=233, Invalid=5619, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 11:03:33,276 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:03:33,280 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-06-22 11:03:33,280 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:03:33,281 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-06-22 11:03:33,281 INFO ]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 101 [2018-06-22 11:03:33,281 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:33,281 INFO ]: Abstraction has 78 states and 82 transitions. [2018-06-22 11:03:33,281 INFO ]: Interpolant automaton has 54 states. [2018-06-22 11:03:33,281 INFO ]: Start isEmpty. Operand 78 states and 82 transitions. [2018-06-22 11:03:33,282 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:03:33,282 INFO ]: Found error trace [2018-06-22 11:03:33,282 INFO ]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:33,282 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:33,282 INFO ]: Analyzing trace with hash -1998760877, now seen corresponding path program 17 times [2018-06-22 11:03:33,282 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:33,282 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:33,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:33,282 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:33,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:33,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:34,269 INFO ]: Checked inductivity of 267 backedges. 56 proven. 95 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 11:03:34,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:34,269 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 11:03:34,275 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:34,337 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:03:34,337 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:34,342 INFO ]: Computing forward predicates... [2018-06-22 11:03:35,116 INFO ]: Checked inductivity of 267 backedges. 56 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:03:35,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:35,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 54 [2018-06-22 11:03:35,135 INFO ]: Interpolant automaton has 54 states [2018-06-22 11:03:35,136 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 11:03:35,136 INFO ]: CoverageRelationStatistics Valid=268, Invalid=2594, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:03:35,136 INFO ]: Start difference. First operand 78 states and 82 transitions. Second operand 54 states. [2018-06-22 11:03:36,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:36,077 INFO ]: Finished difference Result 90 states and 93 transitions. [2018-06-22 11:03:36,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:03:36,077 INFO ]: Start accepts. Automaton has 54 states. Word has length 105 [2018-06-22 11:03:36,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:36,078 INFO ]: With dead ends: 90 [2018-06-22 11:03:36,078 INFO ]: Without dead ends: 74 [2018-06-22 11:03:36,078 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=585, Invalid=5267, Unknown=0, NotChecked=0, Total=5852 [2018-06-22 11:03:36,079 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:03:36,081 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 11:03:36,081 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:03:36,081 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-06-22 11:03:36,081 INFO ]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 105 [2018-06-22 11:03:36,082 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:36,082 INFO ]: Abstraction has 74 states and 77 transitions. [2018-06-22 11:03:36,082 INFO ]: Interpolant automaton has 54 states. [2018-06-22 11:03:36,082 INFO ]: Start isEmpty. Operand 74 states and 77 transitions. [2018-06-22 11:03:36,082 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:03:36,082 INFO ]: Found error trace [2018-06-22 11:03:36,082 INFO ]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:36,082 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:36,082 INFO ]: Analyzing trace with hash -1433778632, now seen corresponding path program 18 times [2018-06-22 11:03:36,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:36,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:36,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:36,083 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:36,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:36,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:36,665 INFO ]: Checked inductivity of 295 backedges. 112 proven. 53 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-22 11:03:36,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:36,665 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 11:03:36,671 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:36,750 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:03:36,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:36,755 INFO ]: Computing forward predicates... [2018-06-22 11:03:37,509 INFO ]: Checked inductivity of 295 backedges. 112 proven. 42 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-22 11:03:37,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:37,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2018-06-22 11:03:37,529 INFO ]: Interpolant automaton has 56 states [2018-06-22 11:03:37,529 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-22 11:03:37,529 INFO ]: CoverageRelationStatistics Valid=293, Invalid=2787, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:03:37,529 INFO ]: Start difference. First operand 74 states and 77 transitions. Second operand 56 states. [2018-06-22 11:03:38,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:38,424 INFO ]: Finished difference Result 80 states and 84 transitions. [2018-06-22 11:03:38,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:03:38,425 INFO ]: Start accepts. Automaton has 56 states. Word has length 109 [2018-06-22 11:03:38,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:38,425 INFO ]: With dead ends: 80 [2018-06-22 11:03:38,425 INFO ]: Without dead ends: 78 [2018-06-22 11:03:38,426 INFO ]: 0 DeclaredPredicates, 174 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1836 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=649, Invalid=5671, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 11:03:38,426 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 11:03:38,428 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-06-22 11:03:38,428 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:03:38,428 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-06-22 11:03:38,428 INFO ]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 109 [2018-06-22 11:03:38,429 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:38,429 INFO ]: Abstraction has 76 states and 79 transitions. [2018-06-22 11:03:38,429 INFO ]: Interpolant automaton has 56 states. [2018-06-22 11:03:38,429 INFO ]: Start isEmpty. Operand 76 states and 79 transitions. [2018-06-22 11:03:38,429 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:03:38,429 INFO ]: Found error trace [2018-06-22 11:03:38,429 INFO ]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:38,430 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:38,430 INFO ]: Analyzing trace with hash -1974555555, now seen corresponding path program 19 times [2018-06-22 11:03:38,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:38,430 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:38,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:38,430 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:38,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:38,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:39,364 INFO ]: Checked inductivity of 322 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-06-22 11:03:39,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:39,364 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 11:03:39,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:39,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:39,445 INFO ]: Computing forward predicates... [2018-06-22 11:03:41,504 INFO ]: Checked inductivity of 322 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-06-22 11:03:41,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:41,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 60 [2018-06-22 11:03:41,524 INFO ]: Interpolant automaton has 60 states [2018-06-22 11:03:41,524 INFO ]: Constructing interpolant automaton starting with 60 interpolants. [2018-06-22 11:03:41,525 INFO ]: CoverageRelationStatistics Valid=127, Invalid=3413, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 11:03:41,525 INFO ]: Start difference. First operand 76 states and 79 transitions. Second operand 60 states. [2018-06-22 11:03:44,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:44,149 INFO ]: Finished difference Result 102 states and 107 transitions. [2018-06-22 11:03:44,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:03:44,149 INFO ]: Start accepts. Automaton has 60 states. Word has length 113 [2018-06-22 11:03:44,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:44,150 INFO ]: With dead ends: 102 [2018-06-22 11:03:44,150 INFO ]: Without dead ends: 98 [2018-06-22 11:03:44,151 INFO ]: 0 DeclaredPredicates, 183 GetRequests, 79 SyntacticMatches, 20 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=262, Invalid=7048, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 11:03:44,151 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:03:44,156 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 84. [2018-06-22 11:03:44,156 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:03:44,156 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-06-22 11:03:44,157 INFO ]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 113 [2018-06-22 11:03:44,157 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:44,157 INFO ]: Abstraction has 84 states and 88 transitions. [2018-06-22 11:03:44,157 INFO ]: Interpolant automaton has 60 states. [2018-06-22 11:03:44,157 INFO ]: Start isEmpty. Operand 84 states and 88 transitions. [2018-06-22 11:03:44,158 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:03:44,158 INFO ]: Found error trace [2018-06-22 11:03:44,158 INFO ]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:44,158 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:44,158 INFO ]: Analyzing trace with hash -1688544446, now seen corresponding path program 20 times [2018-06-22 11:03:44,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:44,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:44,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:44,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:44,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:44,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:44,860 INFO ]: Checked inductivity of 353 backedges. 72 proven. 125 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-06-22 11:03:44,860 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:44,860 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 11:03:44,866 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:44,941 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:44,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:44,947 INFO ]: Computing forward predicates... [2018-06-22 11:03:45,733 INFO ]: Checked inductivity of 353 backedges. 72 proven. 119 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:03:45,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:45,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 60 [2018-06-22 11:03:45,753 INFO ]: Interpolant automaton has 60 states [2018-06-22 11:03:45,753 INFO ]: Constructing interpolant automaton starting with 60 interpolants. [2018-06-22 11:03:45,754 INFO ]: CoverageRelationStatistics Valid=331, Invalid=3209, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 11:03:45,754 INFO ]: Start difference. First operand 84 states and 88 transitions. Second operand 60 states. [2018-06-22 11:03:46,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:46,763 INFO ]: Finished difference Result 98 states and 101 transitions. [2018-06-22 11:03:46,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:03:46,764 INFO ]: Start accepts. Automaton has 60 states. Word has length 117 [2018-06-22 11:03:46,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:46,764 INFO ]: With dead ends: 98 [2018-06-22 11:03:46,764 INFO ]: Without dead ends: 80 [2018-06-22 11:03:46,765 INFO ]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=6582, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 11:03:46,765 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:03:46,767 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-06-22 11:03:46,767 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 11:03:46,768 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-06-22 11:03:46,768 INFO ]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 117 [2018-06-22 11:03:46,768 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:46,768 INFO ]: Abstraction has 80 states and 83 transitions. [2018-06-22 11:03:46,768 INFO ]: Interpolant automaton has 60 states. [2018-06-22 11:03:46,768 INFO ]: Start isEmpty. Operand 80 states and 83 transitions. [2018-06-22 11:03:46,771 INFO ]: Finished isEmpty. Found accepting run of length 122 [2018-06-22 11:03:46,771 INFO ]: Found error trace [2018-06-22 11:03:46,771 INFO ]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:46,771 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:46,771 INFO ]: Analyzing trace with hash 105258855, now seen corresponding path program 21 times [2018-06-22 11:03:46,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:46,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:46,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:46,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:46,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:46,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:47,335 INFO ]: Checked inductivity of 385 backedges. 144 proven. 69 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-22 11:03:47,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:47,335 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 11:03:47,342 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:47,432 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:03:47,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:47,440 INFO ]: Computing forward predicates... [2018-06-22 11:03:49,173 INFO ]: Checked inductivity of 385 backedges. 144 proven. 56 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-06-22 11:03:49,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:49,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 62 [2018-06-22 11:03:49,227 INFO ]: Interpolant automaton has 62 states [2018-06-22 11:03:49,227 INFO ]: Constructing interpolant automaton starting with 62 interpolants. [2018-06-22 11:03:49,228 INFO ]: CoverageRelationStatistics Valid=359, Invalid=3423, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:03:49,228 INFO ]: Start difference. First operand 80 states and 83 transitions. Second operand 62 states. [2018-06-22 11:03:50,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:50,093 INFO ]: Finished difference Result 86 states and 90 transitions. [2018-06-22 11:03:50,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:03:50,094 INFO ]: Start accepts. Automaton has 62 states. Word has length 121 [2018-06-22 11:03:50,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:50,094 INFO ]: With dead ends: 86 [2018-06-22 11:03:50,094 INFO ]: Without dead ends: 84 [2018-06-22 11:03:50,095 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=800, Invalid=7032, Unknown=0, NotChecked=0, Total=7832 [2018-06-22 11:03:50,095 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:03:50,098 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-06-22 11:03:50,098 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:03:50,098 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-06-22 11:03:50,098 INFO ]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 121 [2018-06-22 11:03:50,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:50,099 INFO ]: Abstraction has 82 states and 85 transitions. [2018-06-22 11:03:50,099 INFO ]: Interpolant automaton has 62 states. [2018-06-22 11:03:50,099 INFO ]: Start isEmpty. Operand 82 states and 85 transitions. [2018-06-22 11:03:50,099 INFO ]: Finished isEmpty. Found accepting run of length 126 [2018-06-22 11:03:50,099 INFO ]: Found error trace [2018-06-22 11:03:50,099 INFO ]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:50,099 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:50,100 INFO ]: Analyzing trace with hash 1822830540, now seen corresponding path program 22 times [2018-06-22 11:03:50,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:50,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:50,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:50,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:50,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:50,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:51,293 INFO ]: Checked inductivity of 416 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-06-22 11:03:51,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:51,293 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 11:03:51,298 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:51,365 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:51,365 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:51,373 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 11:03:52,887 INFO ]: Timeout while computing interpolants [2018-06-22 11:03:53,088 WARN ]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:53,088 WARN ]: Verification canceled [2018-06-22 11:03:53,198 WARN ]: Timeout [2018-06-22 11:03:53,198 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:03:53 BoogieIcfgContainer [2018-06-22 11:03:53,198 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:03:53,199 INFO ]: Toolchain (without parser) took 60336.72 ms. Allocated memory was 305.7 MB in the beginning and 848.8 MB in the end (delta: 543.2 MB). Free memory was 257.1 MB in the beginning and 817.6 MB in the end (delta: -560.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:03:53,200 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:03:53,200 INFO ]: ChcToBoogie took 47.19 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:03:53,200 INFO ]: Boogie Preprocessor took 46.66 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 253.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:03:53,200 INFO ]: RCFGBuilder took 430.46 ms. Allocated memory is still 305.7 MB. Free memory was 253.1 MB in the beginning and 240.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:03:53,201 INFO ]: TraceAbstraction took 59803.52 ms. Allocated memory was 305.7 MB in the beginning and 848.8 MB in the end (delta: 543.2 MB). Free memory was 240.1 MB in the beginning and 817.6 MB in the end (delta: -577.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:03:53,203 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 47.19 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.66 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 253.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 430.46 ms. Allocated memory is still 305.7 MB. Free memory was 253.1 MB in the beginning and 240.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59803.52 ms. Allocated memory was 305.7 MB in the beginning and 848.8 MB in the end (delta: 543.2 MB). Free memory was 240.1 MB in the beginning and 817.6 MB in the end (delta: -577.6 MB). Peak memory consumption was 14.9 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 126 with TraceHistMax 9, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 45 locations, 1 error locations. TIMEOUT Result, 59.7s OverallTime, 39 OverallIterations, 9 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1626 SDtfs, 325 SDslu, 23346 SDs, 0 SdLazy, 12163 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2911 GetRequests, 1459 SyntacticMatches, 100 SemanticMatches, 1352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15450 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=36, 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.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 110 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 3905 NumberOfCodeBlocks, 3905 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 3844 ConstructedInterpolants, 0 QuantifiedInterpolants, 1852388 SizeOfPredicates, 310 NumberOfNonLiveVariables, 9861 ConjunctsInSsa, 2216 ConjunctsInUnsatCore, 61 InterpolantComputations, 15 PerfectInterpolantSequences, 4362/6584 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/nested-while_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-03-53-211.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-03-53-211.csv Completed graceful shutdown