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/cube_square_unsafe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:59:34,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:59:34,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:59:34,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:59:34,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:59:34,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:59:34,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:59:34,406 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:59:34,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:59:34,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:59:34,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:59:34,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:59:34,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:59:34,415 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:59:34,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:59:34,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:59:34,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:59:34,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:59:34,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:59:34,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:59:34,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:59:34,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:59:34,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:59:34,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:59:34,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:59:34,438 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:59:34,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:59:34,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:59:34,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:59:34,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:59:34,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:59:34,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:59:34,442 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:59:34,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:59:34,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:59:34,444 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 10:59:34,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:59:34,457 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:59:34,457 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:59:34,457 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:59:34,458 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:59:34,459 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:59:34,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:59:34,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:59:34,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:59:34,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:59:34,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:59:34,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:59:34,460 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:59:34,460 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:59:34,460 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:59:34,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:59:34,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:59:34,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:59:34,461 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:59:34,466 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:59:34,466 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:59:34,505 INFO ]: Repository-Root is: /tmp [2018-06-22 10:59:34,519 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:59:34,525 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:59:34,526 INFO ]: Initializing SmtParser... [2018-06-22 10:59:34,526 INFO ]: SmtParser initialized [2018-06-22 10:59:34,527 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-22 10:59:34,528 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 10:59:34,614 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 unknown [2018-06-22 10:59:34,812 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2 [2018-06-22 10:59:34,817 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:59:34,823 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:59:34,824 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:59:34,824 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:59:34,824 INFO ]: ChcToBoogie initialized [2018-06-22 10:59:34,828 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,871 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34 Unit [2018-06-22 10:59:34,871 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:59:34,872 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:59:34,872 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:59:34,872 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:59:34,895 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,895 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,901 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,901 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,903 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,904 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,905 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (1/1) ... [2018-06-22 10:59:34,906 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:59:34,907 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:59:34,907 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:59:34,907 INFO ]: RCFGBuilder initialized [2018-06-22 10:59:34,908 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (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 10:59:34,921 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:59:34,921 INFO ]: Found specification of procedure False [2018-06-22 10:59:34,921 INFO ]: Found implementation of procedure False [2018-06-22 10:59:34,921 INFO ]: Specification and implementation of procedure inv_main27 given in one single declaration [2018-06-22 10:59:34,921 INFO ]: Found specification of procedure inv_main27 [2018-06-22 10:59:34,922 INFO ]: Found implementation of procedure inv_main27 [2018-06-22 10:59:34,922 INFO ]: Specification and implementation of procedure inv_main23 given in one single declaration [2018-06-22 10:59:34,922 INFO ]: Found specification of procedure inv_main23 [2018-06-22 10:59:34,922 INFO ]: Found implementation of procedure inv_main23 [2018-06-22 10:59:34,922 INFO ]: Specification and implementation of procedure inv_main14 given in one single declaration [2018-06-22 10:59:34,922 INFO ]: Found specification of procedure inv_main14 [2018-06-22 10:59:34,922 INFO ]: Found implementation of procedure inv_main14 [2018-06-22 10:59:34,922 INFO ]: Specification and implementation of procedure inv_main8 given in one single declaration [2018-06-22 10:59:34,922 INFO ]: Found specification of procedure inv_main8 [2018-06-22 10:59:34,922 INFO ]: Found implementation of procedure inv_main8 [2018-06-22 10:59:34,922 INFO ]: Specification and implementation of procedure inv_main3 given in one single declaration [2018-06-22 10:59:34,922 INFO ]: Found specification of procedure inv_main3 [2018-06-22 10:59:34,922 INFO ]: Found implementation of procedure inv_main3 [2018-06-22 10:59:34,922 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:59:34,922 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:59:34,922 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 10:59:35,309 INFO ]: Using library mode [2018-06-22 10:59:35,309 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:59:35 BoogieIcfgContainer [2018-06-22 10:59:35,310 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:59:35,311 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:59:35,311 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:59:35,314 INFO ]: TraceAbstraction initialized [2018-06-22 10:59:35,314 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:59:34" (1/3) ... [2018-06-22 10:59:35,315 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@954a674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:59:35, skipping insertion in model container [2018-06-22 10:59:35,315 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:59:34" (2/3) ... [2018-06-22 10:59:35,315 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@954a674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:59:35, skipping insertion in model container [2018-06-22 10:59:35,315 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:59:35" (3/3) ... [2018-06-22 10:59:35,317 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:59:35,327 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:59:35,337 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:59:35,373 INFO ]: Using default assertion order modulation [2018-06-22 10:59:35,373 INFO ]: Interprodecural is true [2018-06-22 10:59:35,373 INFO ]: Hoare is false [2018-06-22 10:59:35,373 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:59:35,373 INFO ]: Backedges is TWOTRACK [2018-06-22 10:59:35,373 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:59:35,373 INFO ]: Difference is false [2018-06-22 10:59:35,373 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:59:35,373 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:59:35,386 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 10:59:35,397 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:59:35,398 INFO ]: Found error trace [2018-06-22 10:59:35,398 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 10:59:35,399 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:35,404 INFO ]: Analyzing trace with hash -1208850875, now seen corresponding path program 1 times [2018-06-22 10:59:35,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:35,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:35,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:35,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:35,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:35,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:35,665 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:59:35,667 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:35,667 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 10:59:35,669 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:59:35,680 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:59:35,680 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:59:35,682 INFO ]: Start difference. First operand 31 states. Second operand 7 states. [2018-06-22 10:59:35,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:35,911 INFO ]: Finished difference Result 37 states and 44 transitions. [2018-06-22 10:59:35,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:59:35,913 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 10:59:35,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:35,922 INFO ]: With dead ends: 37 [2018-06-22 10:59:35,922 INFO ]: Without dead ends: 35 [2018-06-22 10:59:35,923 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:59:35,936 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:35,959 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 10:59:35,961 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 10:59:35,964 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-06-22 10:59:35,965 INFO ]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-06-22 10:59:35,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:35,965 INFO ]: Abstraction has 33 states and 39 transitions. [2018-06-22 10:59:35,965 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:59:35,965 INFO ]: Start isEmpty. Operand 33 states and 39 transitions. [2018-06-22 10:59:35,969 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:35,969 INFO ]: Found error trace [2018-06-22 10:59:35,969 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] [2018-06-22 10:59:35,969 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:35,970 INFO ]: Analyzing trace with hash 1358076327, now seen corresponding path program 1 times [2018-06-22 10:59:35,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:35,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:35,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:35,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:35,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:35,996 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:36,323 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:36,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:36,323 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 10:59:36,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:36,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:36,391 INFO ]: Computing forward predicates... [2018-06-22 10:59:36,743 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:36,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:36,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 10:59:36,765 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:59:36,765 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:59:36,766 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:59:36,766 INFO ]: Start difference. First operand 33 states and 39 transitions. Second operand 11 states. [2018-06-22 10:59:37,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:37,035 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-22 10:59:37,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:59:37,035 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 10:59:37,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:37,036 INFO ]: With dead ends: 35 [2018-06-22 10:59:37,036 INFO ]: Without dead ends: 35 [2018-06-22 10:59:37,037 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:59:37,037 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:37,042 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-06-22 10:59:37,042 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 10:59:37,043 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-22 10:59:37,043 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 29 [2018-06-22 10:59:37,044 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:37,044 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-22 10:59:37,044 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:59:37,044 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-22 10:59:37,045 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:59:37,045 INFO ]: Found error trace [2018-06-22 10:59:37,045 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] [2018-06-22 10:59:37,045 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:37,045 INFO ]: Analyzing trace with hash 1040202183, now seen corresponding path program 1 times [2018-06-22 10:59:37,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:37,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:37,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:37,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:37,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:37,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:37,376 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:59:37,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:59:37,376 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:59:37,376 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:59:37,376 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:59:37,377 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:59:37,377 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 8 states. [2018-06-22 10:59:37,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:37,686 INFO ]: Finished difference Result 41 states and 49 transitions. [2018-06-22 10:59:37,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:59:37,687 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 10:59:37,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:37,688 INFO ]: With dead ends: 41 [2018-06-22 10:59:37,688 INFO ]: Without dead ends: 35 [2018-06-22 10:59:37,688 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:59:37,688 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:37,693 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 10:59:37,693 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 10:59:37,694 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-06-22 10:59:37,694 INFO ]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 29 [2018-06-22 10:59:37,694 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:37,694 INFO ]: Abstraction has 33 states and 38 transitions. [2018-06-22 10:59:37,694 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:59:37,694 INFO ]: Start isEmpty. Operand 33 states and 38 transitions. [2018-06-22 10:59:37,695 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:59:37,695 INFO ]: Found error trace [2018-06-22 10:59:37,695 INFO ]: trace histogram [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 10:59:37,695 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:37,695 INFO ]: Analyzing trace with hash 84341196, now seen corresponding path program 1 times [2018-06-22 10:59:37,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:37,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:37,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:37,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:37,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:37,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:37,837 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:59:37,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:37,838 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 10:59:37,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:37,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:37,878 INFO ]: Computing forward predicates... [2018-06-22 10:59:37,922 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:59:37,950 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:59:37,950 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2018-06-22 10:59:37,951 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:59:37,951 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:59:37,951 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:59:37,951 INFO ]: Start difference. First operand 33 states and 38 transitions. Second operand 9 states. [2018-06-22 10:59:38,074 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:38,074 INFO ]: Finished difference Result 37 states and 42 transitions. [2018-06-22 10:59:38,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:59:38,075 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 10:59:38,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:38,076 INFO ]: With dead ends: 37 [2018-06-22 10:59:38,076 INFO ]: Without dead ends: 35 [2018-06-22 10:59:38,076 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:59:38,076 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 10:59:38,082 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 10:59:38,082 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 10:59:38,083 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-22 10:59:38,084 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 33 [2018-06-22 10:59:38,084 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:38,084 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-22 10:59:38,084 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:59:38,084 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-22 10:59:38,085 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:59:38,085 INFO ]: Found error trace [2018-06-22 10:59:38,085 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:38,085 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:38,085 INFO ]: Analyzing trace with hash -1869803794, now seen corresponding path program 1 times [2018-06-22 10:59:38,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:38,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:38,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:38,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:38,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:38,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:38,465 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:59:38,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:38,465 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 10:59:38,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:38,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:38,511 INFO ]: Computing forward predicates... [2018-06-22 10:59:38,734 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:59:38,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:38,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-22 10:59:38,762 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:59:38,762 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:59:38,763 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:38,763 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 17 states. [2018-06-22 10:59:39,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:39,352 INFO ]: Finished difference Result 47 states and 54 transitions. [2018-06-22 10:59:39,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:59:39,353 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 10:59:39,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:39,354 INFO ]: With dead ends: 47 [2018-06-22 10:59:39,354 INFO ]: Without dead ends: 45 [2018-06-22 10:59:39,355 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:59:39,355 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 10:59:39,360 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-22 10:59:39,360 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 10:59:39,361 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-22 10:59:39,361 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 37 [2018-06-22 10:59:39,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:39,362 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-22 10:59:39,362 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:59:39,362 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-22 10:59:39,363 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:59:39,363 INFO ]: Found error trace [2018-06-22 10:59:39,363 INFO ]: trace histogram [3, 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] [2018-06-22 10:59:39,363 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:39,363 INFO ]: Analyzing trace with hash 1983424912, now seen corresponding path program 2 times [2018-06-22 10:59:39,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:39,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:39,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:39,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:39,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:39,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:39,634 INFO ]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:59:39,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:39,634 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 10:59:39,640 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:39,667 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:39,667 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:39,670 INFO ]: Computing forward predicates... [2018-06-22 10:59:39,705 INFO ]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:39,725 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:39,725 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2018-06-22 10:59:39,725 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:59:39,725 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:59:39,725 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:59:39,726 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 15 states. [2018-06-22 10:59:39,896 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:39,896 INFO ]: Finished difference Result 51 states and 59 transitions. [2018-06-22 10:59:39,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:59:39,950 INFO ]: Start accepts. Automaton has 15 states. Word has length 41 [2018-06-22 10:59:39,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:39,952 INFO ]: With dead ends: 51 [2018-06-22 10:59:39,952 INFO ]: Without dead ends: 51 [2018-06-22 10:59:39,952 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:59:39,953 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 10:59:39,960 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-22 10:59:39,960 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 10:59:39,961 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-22 10:59:39,961 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 41 [2018-06-22 10:59:39,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:39,961 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-22 10:59:39,961 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:59:39,961 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-22 10:59:39,963 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:59:39,963 INFO ]: Found error trace [2018-06-22 10:59:39,963 INFO ]: trace histogram [3, 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] [2018-06-22 10:59:39,963 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:39,964 INFO ]: Analyzing trace with hash -1770674189, now seen corresponding path program 3 times [2018-06-22 10:59:39,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:39,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:39,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:39,964 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:39,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:39,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:40,088 INFO ]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:40,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:40,088 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 10:59:40,095 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:40,119 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:59:40,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:40,122 INFO ]: Computing forward predicates... [2018-06-22 10:59:40,168 INFO ]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:40,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:40,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-22 10:59:40,187 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:59:40,187 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:59:40,187 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:59:40,187 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 15 states. [2018-06-22 10:59:40,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:40,411 INFO ]: Finished difference Result 53 states and 61 transitions. [2018-06-22 10:59:40,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:59:40,412 INFO ]: Start accepts. Automaton has 15 states. Word has length 41 [2018-06-22 10:59:40,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:40,413 INFO ]: With dead ends: 53 [2018-06-22 10:59:40,413 INFO ]: Without dead ends: 53 [2018-06-22 10:59:40,413 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:59:40,413 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 10:59:40,419 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-22 10:59:40,419 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 10:59:40,419 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-06-22 10:59:40,419 INFO ]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 41 [2018-06-22 10:59:40,420 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:40,420 INFO ]: Abstraction has 37 states and 42 transitions. [2018-06-22 10:59:40,420 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:59:40,420 INFO ]: Start isEmpty. Operand 37 states and 42 transitions. [2018-06-22 10:59:40,421 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:59:40,421 INFO ]: Found error trace [2018-06-22 10:59:40,421 INFO ]: trace histogram [3, 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] [2018-06-22 10:59:40,421 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:40,421 INFO ]: Analyzing trace with hash -228271952, now seen corresponding path program 4 times [2018-06-22 10:59:40,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:40,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:40,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:40,422 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:40,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:40,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:40,533 INFO ]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:40,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:40,533 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 10:59:40,539 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:40,554 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:40,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:40,557 INFO ]: Computing forward predicates... [2018-06-22 10:59:40,614 INFO ]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:59:40,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:40,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 10:59:40,645 INFO ]: Interpolant automaton has 14 states [2018-06-22 10:59:40,645 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 10:59:40,645 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:59:40,646 INFO ]: Start difference. First operand 37 states and 42 transitions. Second operand 14 states. [2018-06-22 10:59:40,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:40,842 INFO ]: Finished difference Result 47 states and 53 transitions. [2018-06-22 10:59:40,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:59:40,842 INFO ]: Start accepts. Automaton has 14 states. Word has length 41 [2018-06-22 10:59:40,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:40,843 INFO ]: With dead ends: 47 [2018-06-22 10:59:40,843 INFO ]: Without dead ends: 39 [2018-06-22 10:59:40,843 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:59:40,843 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 10:59:40,848 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 10:59:40,848 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 10:59:40,849 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-22 10:59:40,849 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 41 [2018-06-22 10:59:40,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:40,849 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-22 10:59:40,849 INFO ]: Interpolant automaton has 14 states. [2018-06-22 10:59:40,849 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-22 10:59:40,850 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 10:59:40,850 INFO ]: Found error trace [2018-06-22 10:59:40,850 INFO ]: trace histogram [3, 3, 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] [2018-06-22 10:59:40,850 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:40,850 INFO ]: Analyzing trace with hash -301666827, now seen corresponding path program 5 times [2018-06-22 10:59:40,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:40,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:40,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:40,851 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:40,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:40,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:41,007 INFO ]: Checked inductivity of 23 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 10:59:41,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:41,007 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 10:59:41,016 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:41,053 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 10:59:41,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:41,057 INFO ]: Computing forward predicates... [2018-06-22 10:59:41,116 INFO ]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 10:59:41,136 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:41,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2018-06-22 10:59:41,137 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:59:41,137 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:59:41,137 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:59:41,137 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2018-06-22 10:59:41,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:41,331 INFO ]: Finished difference Result 45 states and 50 transitions. [2018-06-22 10:59:41,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:59:41,333 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 10:59:41,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:41,334 INFO ]: With dead ends: 45 [2018-06-22 10:59:41,334 INFO ]: Without dead ends: 41 [2018-06-22 10:59:41,334 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:59:41,334 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 10:59:41,338 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 10:59:41,338 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 10:59:41,339 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-22 10:59:41,339 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 45 [2018-06-22 10:59:41,340 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:41,340 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-22 10:59:41,340 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:59:41,340 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-22 10:59:41,341 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:59:41,341 INFO ]: Found error trace [2018-06-22 10:59:41,341 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:41,341 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:41,341 INFO ]: Analyzing trace with hash -2140982697, now seen corresponding path program 6 times [2018-06-22 10:59:41,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:41,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:41,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:41,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:41,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:41,356 INFO ]: Conjunction of SSA is sat [2018-06-22 10:59:41,360 INFO ]: Counterexample might be feasible [2018-06-22 10:59:41,388 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:59:41 BoogieIcfgContainer [2018-06-22 10:59:41,388 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:59:41,389 INFO ]: Toolchain (without parser) took 6571.36 ms. Allocated memory was 307.8 MB in the beginning and 363.3 MB in the end (delta: 55.6 MB). Free memory was 264.1 MB in the beginning and 207.0 MB in the end (delta: 57.1 MB). Peak memory consumption was 112.7 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:41,391 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:59:41,391 INFO ]: ChcToBoogie took 47.56 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.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 10:59:41,392 INFO ]: Boogie Preprocessor took 34.44 ms. Allocated memory is still 307.8 MB. Free memory is still 260.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:59:41,392 INFO ]: RCFGBuilder took 402.53 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 250.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:41,393 INFO ]: TraceAbstraction took 6077.39 ms. Allocated memory was 307.8 MB in the beginning and 363.3 MB in the end (delta: 55.6 MB). Free memory was 250.2 MB in the beginning and 207.0 MB in the end (delta: 43.1 MB). Peak memory consumption was 98.7 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:41,395 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 307.8 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 47.56 ms. Allocated memory is still 307.8 MB. Free memory was 262.1 MB in the beginning and 260.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 34.44 ms. Allocated memory is still 307.8 MB. Free memory is still 260.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 402.53 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 250.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6077.39 ms. Allocated memory was 307.8 MB in the beginning and 363.3 MB in the end (delta: 55.6 MB). Free memory was 250.2 MB in the beginning and 207.0 MB in the end (delta: 43.1 MB). Peak memory consumption was 98.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume !(hbv_False_1_Int == hbv_False_2_Int); [L0] CALL call inv_main27(hbv_False_3_Int, hbv_False_1_Int, hbv_False_2_Int); [L0] assume !(0 <= hbv_inv_main27_1_Int + -1); [L0] CALL call inv_main23(hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hbv_inv_main27_2_Int, hhv_inv_main27_2_Int, hbv_inv_main27_1_Int); [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] CALL call inv_main23(hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int); [L0] assume (hhv_inv_main23_3_Int == hbv_inv_main23_2_Int + hhv_inv_main23_2_Int && hhv_inv_main23_4_Int == hbv_inv_main23_1_Int + -1) && 0 <= hbv_inv_main23_1_Int + -1; [L0] CALL call inv_main23(hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int); [L0] assume ((hhv_inv_main23_2_Int == hhv_inv_main23_0_Int && hhv_inv_main23_3_Int == 0) && hhv_inv_main23_4_Int == hhv_inv_main23_0_Int) && !(0 <= hbv_inv_main23_1_Int + -1); [L0] CALL call inv_main14(hhv_inv_main23_0_Int, hbv_inv_main23_2_Int, hhv_inv_main23_1_Int, hbv_inv_main23_1_Int); [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] CALL call inv_main14(hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int); [L0] assume (0 <= hbv_inv_main14_2_Int + -1 && hhv_inv_main14_2_Int == hbv_inv_main14_1_Int + hhv_inv_main14_1_Int) && hhv_inv_main14_3_Int == hbv_inv_main14_2_Int + -1; [L0] CALL call inv_main14(hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int); [L0] assume hhv_inv_main14_2_Int == 0 && !(0 <= hbv_inv_main14_1_Int + -1); [L0] CALL call inv_main8(hhv_inv_main14_0_Int, hhv_inv_main14_3_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int); [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] CALL call inv_main8(hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int); [L0] assume (hhv_inv_main8_3_Int == hbv_inv_main8_1_Int + -1 && 0 <= hbv_inv_main8_1_Int + -1) && hhv_inv_main8_2_Int == hbv_inv_main8_2_Int + hhv_inv_main8_1_Int; [L0] CALL call inv_main8(hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int); [L0] assume (hhv_inv_main8_3_Int == hhv_inv_main8_0_Int && hhv_inv_main8_1_Int == hhv_inv_main8_0_Int) && hhv_inv_main8_2_Int == 0; [L0] CALL call inv_main3(hhv_inv_main8_0_Int); [L0] assume true; [L0] RET call inv_main3(hhv_inv_main8_0_Int); [L0] RET call inv_main8(hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int); [L0] RET call inv_main8(hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int); [L0] RET call inv_main8(hhv_inv_main14_0_Int, hhv_inv_main14_3_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int); [L0] RET call inv_main14(hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int); [L0] RET call inv_main14(hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int); [L0] RET call inv_main14(hhv_inv_main23_0_Int, hbv_inv_main23_2_Int, hhv_inv_main23_1_Int, hbv_inv_main23_1_Int); [L0] RET call inv_main23(hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int); [L0] RET call inv_main23(hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hbv_inv_main23_2_Int, hbv_inv_main23_1_Int); [L0] RET call inv_main23(hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hbv_inv_main27_2_Int, hhv_inv_main27_2_Int, hbv_inv_main27_1_Int); [L0] RET call inv_main27(hbv_False_3_Int, hbv_False_1_Int, hbv_False_2_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 31 locations, 1 error locations. UNSAFE Result, 6.0s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 281 SDtfs, 60 SDslu, 2106 SDs, 0 SdLazy, 951 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 258 SyntacticMatches, 12 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=5, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 50456 SizeOfPredicates, 34 NumberOfNonLiveVariables, 974 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 115/181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-59-41-414.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-59-41-414.csv Received shutdown request...