java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-8d74a04
[2018-06-22 01:10:58,454 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-06-22 01:10:58,456 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-06-22 01:10:58,488 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-06-22 01:10:58,488 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-06-22 01:10:58,489 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-06-22 01:10:58,491 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-06-22 01:10:58,499 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-06-22 01:10:58,501 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-06-22 01:10:58,502 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-06-22 01:10:58,503 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-06-22 01:10:58,503 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-06-22 01:10:58,504 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-06-22 01:10:58,515 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-06-22 01:10:58,516 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-06-22 01:10:58,517 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-06-22 01:10:58,519 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-06-22 01:10:58,521 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-06-22 01:10:58,532 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-06-22 01:10:58,534 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-06-22 01:10:58,535 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-06-22 01:10:58,538 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-06-22 01:10:58,538 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-06-22 01:10:58,538 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-06-22 01:10:58,539 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-06-22 01:10:58,540 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-06-22 01:10:58,546 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-06-22 01:10:58,547 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-06-22 01:10:58,548 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-06-22 01:10:58,549 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-06-22 01:10:58,549 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-06-22 01:10:58,559 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-06-22 01:10:58,559 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-06-22 01:10:58,560 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-06-22 01:10:58,561 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-06-22 01:10:58,561 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf
[2018-06-22 01:10:58,589 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-06-22 01:10:58,590 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-06-22 01:10:58,596 INFO  L131        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2018-06-22 01:10:58,597 INFO  L133        SettingsManager]:  * Logger pattern=[%d{ISO8601} %-5p]: %m%n
[2018-06-22 01:10:58,598 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-06-22 01:10:58,598 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-06-22 01:10:58,598 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-06-22 01:10:58,599 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-06-22 01:10:58,599 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-06-22 01:10:58,599 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-06-22 01:10:58,599 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-06-22 01:10:58,599 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-06-22 01:10:58,600 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-06-22 01:10:58,601 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-06-22 01:10:58,602 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-06-22 01:10:58,602 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-06-22 01:10:58,602 INFO  L133        SettingsManager]:  * Compute trace for counterexample result=false
[2018-06-22 01:10:58,604 INFO  L131        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2018-06-22 01:10:58,604 INFO  L133        SettingsManager]:  * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true
[2018-06-22 01:10:58,665 INFO ]: Repository-Root is: /tmp
[2018-06-22 01:10:58,683 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-06-22 01:10:58,689 INFO ]: [Toolchain 1]: Toolchain data selected.
[2018-06-22 01:10:58,690 INFO ]: Initializing SmtParser...
[2018-06-22 01:10:58,691 INFO ]: SmtParser initialized
[2018-06-22 01:10:58,691 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2
[2018-06-22 01:10:58,693 INFO ]: Parsing .smt2 file as a set of Horn Clauses
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2018-06-22 01:10:58,798 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2
unknown
[2018-06-22 01:10:58,960 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/cube_square_unsafe.c-1.smt2
[2018-06-22 01:10:58,969 INFO ]: ####################### [Toolchain 1] #######################
[2018-06-22 01:10:58,983 INFO ]: Walking toolchain with 4 elements.
[2018-06-22 01:10:58,984 INFO ]: ------------------------ChcToBoogie----------------------------
[2018-06-22 01:10:58,984 INFO ]: Initializing ChcToBoogie...
[2018-06-22 01:10:58,984 INFO ]: ChcToBoogie initialized
[2018-06-22 01:10:58,991 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:10:58" (1/1) ...
[2018-06-22 01:10:59,059 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59 Unit
[2018-06-22 01:10:59,060 INFO ]: ------------------------ END ChcToBoogie----------------------------
[2018-06-22 01:10:59,060 INFO ]: ------------------------Boogie Preprocessor----------------------------
[2018-06-22 01:10:59,060 INFO ]: Initializing Boogie Preprocessor...
[2018-06-22 01:10:59,060 INFO ]: Boogie Preprocessor initialized
[2018-06-22 01:10:59,086 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,086 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,094 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,094 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,098 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,100 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,101 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
[2018-06-22 01:10:59,104 INFO ]: ------------------------ END Boogie Preprocessor----------------------------
[2018-06-22 01:10:59,105 INFO ]: ------------------------RCFGBuilder----------------------------
[2018-06-22 01:10:59,105 INFO ]: Initializing RCFGBuilder...
[2018-06-22 01:10:59,105 INFO ]: RCFGBuilder initialized
[2018-06-22 01:10:59,109 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2018-06-22 01:10:59,128 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration
[2018-06-22 01:10:59,129 INFO ]: Found specification of procedure gotoProc
[2018-06-22 01:10:59,129 INFO ]: Found implementation of procedure gotoProc
[2018-06-22 01:10:59,129 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2018-06-22 01:10:59,129 INFO ]: Found specification of procedure Ultimate.START
[2018-06-22 01:10:59,129 INFO ]: Found implementation of procedure Ultimate.START
Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-06-22 01:10:59,459 INFO ]: Using library mode
[2018-06-22 01:10:59,460 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:10:59 BoogieIcfgContainer
[2018-06-22 01:10:59,460 INFO ]: ------------------------ END RCFGBuilder----------------------------
[2018-06-22 01:10:59,471 INFO ]: ------------------------TraceAbstraction----------------------------
[2018-06-22 01:10:59,471 INFO ]: Initializing TraceAbstraction...
[2018-06-22 01:10:59,477 INFO ]: TraceAbstraction initialized
[2018-06-22 01:10:59,477 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:10:58" (1/3) ...
[2018-06-22 01:10:59,478 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39699f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:10:59, skipping insertion in model container
[2018-06-22 01:10:59,478 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:10:59" (2/3) ...
[2018-06-22 01:10:59,479 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39699f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:10:59, skipping insertion in model container
[2018-06-22 01:10:59,479 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:10:59" (3/3) ...
[2018-06-22 01:10:59,481 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2018-06-22 01:10:59,495 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-06-22 01:10:59,502 INFO ]: Appying trace abstraction to program that has 1 error locations.
[2018-06-22 01:10:59,543 INFO ]: Using default assertion order modulation
[2018-06-22 01:10:59,544 INFO ]: Interprodecural is true
[2018-06-22 01:10:59,544 INFO ]: Hoare is false
[2018-06-22 01:10:59,544 INFO ]: Compute interpolants for FPandBP
[2018-06-22 01:10:59,544 INFO ]: Backedges is TWOTRACK
[2018-06-22 01:10:59,544 INFO ]: Determinization is PREDICATE_ABSTRACTION
[2018-06-22 01:10:59,544 INFO ]: Difference is false
[2018-06-22 01:10:59,544 INFO ]: Minimize is MINIMIZE_SEVPA
[2018-06-22 01:10:59,544 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-06-22 01:10:59,562 INFO ]: Start isEmpty. Operand 14 states.
[2018-06-22 01:10:59,573 INFO ]: Finished isEmpty. Found accepting run of length 12
[2018-06-22 01:10:59,573 INFO ]: Found error trace
[2018-06-22 01:10:59,575 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:10:59,576 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:10:59,582 INFO ]: Analyzing trace with hash 46595302, now seen corresponding path program 1 times
[2018-06-22 01:10:59,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:10:59,585 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:10:59,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:10:59,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:10:59,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:10:59,762 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:00,014 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:00,017 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 01:11:00,017 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-06-22 01:11:00,025 INFO ]: Interpolant automaton has 5 states
[2018-06-22 01:11:00,059 INFO ]: Constructing interpolant automaton starting with 5 interpolants.
[2018-06-22 01:11:00,060 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-06-22 01:11:00,062 INFO ]: Start difference. First operand 14 states. Second operand 5 states.
[2018-06-22 01:11:00,245 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:00,245 INFO ]: Finished difference Result 19 states and 24 transitions.
[2018-06-22 01:11:00,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 01:11:00,246 INFO ]: Start accepts. Automaton has 5 states. Word has length 11
[2018-06-22 01:11:00,246 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:00,257 INFO ]: With dead ends: 19
[2018-06-22 01:11:00,257 INFO ]: Without dead ends: 19
[2018-06-22 01:11:00,259 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-06-22 01:11:00,278 INFO ]: Start minimizeSevpa. Operand 19 states.
[2018-06-22 01:11:00,295 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14.
[2018-06-22 01:11:00,297 INFO ]: Start removeUnreachable. Operand 14 states.
[2018-06-22 01:11:00,301 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions.
[2018-06-22 01:11:00,303 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11
[2018-06-22 01:11:00,303 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:00,303 INFO ]: Abstraction has 14 states and 17 transitions.
[2018-06-22 01:11:00,303 INFO ]: Interpolant automaton has 5 states.
[2018-06-22 01:11:00,303 INFO ]: Start isEmpty. Operand 14 states and 17 transitions.
[2018-06-22 01:11:00,304 INFO ]: Finished isEmpty. Found accepting run of length 13
[2018-06-22 01:11:00,304 INFO ]: Found error trace
[2018-06-22 01:11:00,304 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:00,304 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:00,304 INFO ]: Analyzing trace with hash -1251009968, now seen corresponding path program 1 times
[2018-06-22 01:11:00,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:00,304 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:00,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:00,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:00,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:00,332 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:00,580 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:00,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 01:11:00,580 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-06-22 01:11:00,582 INFO ]: Interpolant automaton has 4 states
[2018-06-22 01:11:00,582 INFO ]: Constructing interpolant automaton starting with 4 interpolants.
[2018-06-22 01:11:00,582 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-06-22 01:11:00,582 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 4 states.
[2018-06-22 01:11:00,876 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:00,876 INFO ]: Finished difference Result 20 states and 25 transitions.
[2018-06-22 01:11:00,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-06-22 01:11:00,877 INFO ]: Start accepts. Automaton has 4 states. Word has length 12
[2018-06-22 01:11:00,877 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:00,878 INFO ]: With dead ends: 20
[2018-06-22 01:11:00,878 INFO ]: Without dead ends: 20
[2018-06-22 01:11:00,878 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-06-22 01:11:00,879 INFO ]: Start minimizeSevpa. Operand 20 states.
[2018-06-22 01:11:00,881 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16.
[2018-06-22 01:11:00,881 INFO ]: Start removeUnreachable. Operand 16 states.
[2018-06-22 01:11:00,882 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions.
[2018-06-22 01:11:00,882 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12
[2018-06-22 01:11:00,882 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:00,882 INFO ]: Abstraction has 16 states and 20 transitions.
[2018-06-22 01:11:00,882 INFO ]: Interpolant automaton has 4 states.
[2018-06-22 01:11:00,882 INFO ]: Start isEmpty. Operand 16 states and 20 transitions.
[2018-06-22 01:11:00,882 INFO ]: Finished isEmpty. Found accepting run of length 13
[2018-06-22 01:11:00,883 INFO ]: Found error trace
[2018-06-22 01:11:00,883 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:00,886 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:00,886 INFO ]: Analyzing trace with hash -570451450, now seen corresponding path program 1 times
[2018-06-22 01:11:00,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:00,886 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:00,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:00,887 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:00,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:00,935 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:01,024 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:01,024 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 01:11:01,024 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-06-22 01:11:01,024 INFO ]: Interpolant automaton has 5 states
[2018-06-22 01:11:01,024 INFO ]: Constructing interpolant automaton starting with 5 interpolants.
[2018-06-22 01:11:01,024 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-06-22 01:11:01,025 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 5 states.
[2018-06-22 01:11:01,345 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:01,345 INFO ]: Finished difference Result 23 states and 29 transitions.
[2018-06-22 01:11:01,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 01:11:01,349 INFO ]: Start accepts. Automaton has 5 states. Word has length 12
[2018-06-22 01:11:01,349 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:01,350 INFO ]: With dead ends: 23
[2018-06-22 01:11:01,350 INFO ]: Without dead ends: 23
[2018-06-22 01:11:01,350 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-06-22 01:11:01,350 INFO ]: Start minimizeSevpa. Operand 23 states.
[2018-06-22 01:11:01,355 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 15.
[2018-06-22 01:11:01,355 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:11:01,356 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions.
[2018-06-22 01:11:01,356 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 12
[2018-06-22 01:11:01,356 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:01,356 INFO ]: Abstraction has 15 states and 18 transitions.
[2018-06-22 01:11:01,356 INFO ]: Interpolant automaton has 5 states.
[2018-06-22 01:11:01,356 INFO ]: Start isEmpty. Operand 15 states and 18 transitions.
[2018-06-22 01:11:01,357 INFO ]: Finished isEmpty. Found accepting run of length 14
[2018-06-22 01:11:01,357 INFO ]: Found error trace
[2018-06-22 01:11:01,357 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:01,357 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:01,357 INFO ]: Analyzing trace with hash -73074532, now seen corresponding path program 1 times
[2018-06-22 01:11:01,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:01,357 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:01,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:01,358 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:01,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:01,372 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:01,558 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:01,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:11:01,558 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:11:01,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:01,620 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:01,631 INFO ]: Computing forward predicates...
[2018-06-22 01:11:01,856 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:01,892 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-06-22 01:11:01,892 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8
[2018-06-22 01:11:01,892 INFO ]: Interpolant automaton has 8 states
[2018-06-22 01:11:01,892 INFO ]: Constructing interpolant automaton starting with 8 interpolants.
[2018-06-22 01:11:01,892 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-06-22 01:11:01,893 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 8 states.
[2018-06-22 01:11:02,080 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:02,080 INFO ]: Finished difference Result 18 states and 22 transitions.
[2018-06-22 01:11:02,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-06-22 01:11:02,081 INFO ]: Start accepts. Automaton has 8 states. Word has length 13
[2018-06-22 01:11:02,081 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:02,082 INFO ]: With dead ends: 18
[2018-06-22 01:11:02,082 INFO ]: Without dead ends: 14
[2018-06-22 01:11:02,082 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2018-06-22 01:11:02,082 INFO ]: Start minimizeSevpa. Operand 14 states.
[2018-06-22 01:11:02,084 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2018-06-22 01:11:02,084 INFO ]: Start removeUnreachable. Operand 14 states.
[2018-06-22 01:11:02,084 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions.
[2018-06-22 01:11:02,084 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 13
[2018-06-22 01:11:02,084 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:02,084 INFO ]: Abstraction has 14 states and 16 transitions.
[2018-06-22 01:11:02,084 INFO ]: Interpolant automaton has 8 states.
[2018-06-22 01:11:02,084 INFO ]: Start isEmpty. Operand 14 states and 16 transitions.
[2018-06-22 01:11:02,086 INFO ]: Finished isEmpty. Found accepting run of length 14
[2018-06-22 01:11:02,086 INFO ]: Found error trace
[2018-06-22 01:11:02,086 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:02,086 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:02,086 INFO ]: Analyzing trace with hash -450596954, now seen corresponding path program 1 times
[2018-06-22 01:11:02,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:02,086 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:02,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:02,087 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:02,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:02,101 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:02,220 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:02,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:11:02,220 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:11:02,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:02,262 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:02,265 INFO ]: Computing forward predicates...
[2018-06-22 01:11:02,635 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:02,674 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-06-22 01:11:02,674 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8
[2018-06-22 01:11:02,674 INFO ]: Interpolant automaton has 8 states
[2018-06-22 01:11:02,674 INFO ]: Constructing interpolant automaton starting with 8 interpolants.
[2018-06-22 01:11:02,675 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-06-22 01:11:02,675 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states.
[2018-06-22 01:11:02,771 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:02,771 INFO ]: Finished difference Result 17 states and 20 transitions.
[2018-06-22 01:11:02,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 01:11:02,772 INFO ]: Start accepts. Automaton has 8 states. Word has length 13
[2018-06-22 01:11:02,772 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:02,772 INFO ]: With dead ends: 17
[2018-06-22 01:11:02,772 INFO ]: Without dead ends: 15
[2018-06-22 01:11:02,772 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2018-06-22 01:11:02,773 INFO ]: Start minimizeSevpa. Operand 15 states.
[2018-06-22 01:11:02,774 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2018-06-22 01:11:02,774 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:11:02,775 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions.
[2018-06-22 01:11:02,775 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13
[2018-06-22 01:11:02,775 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:02,775 INFO ]: Abstraction has 15 states and 17 transitions.
[2018-06-22 01:11:02,775 INFO ]: Interpolant automaton has 8 states.
[2018-06-22 01:11:02,775 INFO ]: Start isEmpty. Operand 15 states and 17 transitions.
[2018-06-22 01:11:02,775 INFO ]: Finished isEmpty. Found accepting run of length 15
[2018-06-22 01:11:02,775 INFO ]: Found error trace
[2018-06-22 01:11:02,775 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:02,775 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:02,776 INFO ]: Analyzing trace with hash -349516356, now seen corresponding path program 1 times
[2018-06-22 01:11:02,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:02,776 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:02,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:02,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:02,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:02,808 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:03,091 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:03,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:11:03,092 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:11:03,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:03,118 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:03,125 INFO ]: Computing forward predicates...
[2018-06-22 01:11:03,219 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:03,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:11:03,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12
[2018-06-22 01:11:03,252 INFO ]: Interpolant automaton has 12 states
[2018-06-22 01:11:03,252 INFO ]: Constructing interpolant automaton starting with 12 interpolants.
[2018-06-22 01:11:03,252 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-06-22 01:11:03,253 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states.
[2018-06-22 01:11:03,982 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:03,982 INFO ]: Finished difference Result 30 states and 37 transitions.
[2018-06-22 01:11:03,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-06-22 01:11:03,983 INFO ]: Start accepts. Automaton has 12 states. Word has length 14
[2018-06-22 01:11:03,983 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:03,984 INFO ]: With dead ends: 30
[2018-06-22 01:11:03,984 INFO ]: Without dead ends: 30
[2018-06-22 01:11:03,984 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306
[2018-06-22 01:11:03,985 INFO ]: Start minimizeSevpa. Operand 30 states.
[2018-06-22 01:11:03,987 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 19.
[2018-06-22 01:11:03,987 INFO ]: Start removeUnreachable. Operand 19 states.
[2018-06-22 01:11:03,987 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions.
[2018-06-22 01:11:03,987 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14
[2018-06-22 01:11:03,987 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:03,987 INFO ]: Abstraction has 19 states and 23 transitions.
[2018-06-22 01:11:03,988 INFO ]: Interpolant automaton has 12 states.
[2018-06-22 01:11:03,988 INFO ]: Start isEmpty. Operand 19 states and 23 transitions.
[2018-06-22 01:11:03,988 INFO ]: Finished isEmpty. Found accepting run of length 16
[2018-06-22 01:11:03,988 INFO ]: Found error trace
[2018-06-22 01:11:03,988 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:03,988 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:03,988 INFO ]: Analyzing trace with hash -1510985114, now seen corresponding path program 2 times
[2018-06-22 01:11:03,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:03,988 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:03,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:03,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:11:03,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:04,013 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:04,255 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:11:04,255 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:11:04,255 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:11:04,267 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:11:04,288 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:11:04,288 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:04,291 INFO ]: Computing forward predicates...
[2018-06-22 01:11:04,559 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 6
[2018-06-22 01:11:04,634 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:04,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:11:04,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12
[2018-06-22 01:11:04,671 INFO ]: Interpolant automaton has 12 states
[2018-06-22 01:11:04,671 INFO ]: Constructing interpolant automaton starting with 12 interpolants.
[2018-06-22 01:11:04,671 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2018-06-22 01:11:04,671 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 12 states.
[2018-06-22 01:11:04,818 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:04,818 INFO ]: Finished difference Result 27 states and 33 transitions.
[2018-06-22 01:11:04,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2018-06-22 01:11:04,820 INFO ]: Start accepts. Automaton has 12 states. Word has length 15
[2018-06-22 01:11:04,820 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:04,820 INFO ]: With dead ends: 27
[2018-06-22 01:11:04,820 INFO ]: Without dead ends: 24
[2018-06-22 01:11:04,821 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240
[2018-06-22 01:11:04,821 INFO ]: Start minimizeSevpa. Operand 24 states.
[2018-06-22 01:11:04,823 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19.
[2018-06-22 01:11:04,823 INFO ]: Start removeUnreachable. Operand 19 states.
[2018-06-22 01:11:04,823 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions.
[2018-06-22 01:11:04,823 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15
[2018-06-22 01:11:04,823 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:04,823 INFO ]: Abstraction has 19 states and 22 transitions.
[2018-06-22 01:11:04,823 INFO ]: Interpolant automaton has 12 states.
[2018-06-22 01:11:04,823 INFO ]: Start isEmpty. Operand 19 states and 22 transitions.
[2018-06-22 01:11:04,824 INFO ]: Finished isEmpty. Found accepting run of length 16
[2018-06-22 01:11:04,824 INFO ]: Found error trace
[2018-06-22 01:11:04,824 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:04,824 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:04,824 INFO ]: Analyzing trace with hash 2103423664, now seen corresponding path program 3 times
[2018-06-22 01:11:04,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:04,824 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:04,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:04,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:11:04,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:04,836 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:04,944 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:04,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:11:04,944 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:11:04,950 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-06-22 01:11:04,990 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2018-06-22 01:11:04,990 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:04,992 INFO ]: Computing forward predicates...
[2018-06-22 01:11:05,823 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:05,862 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:11:05,862 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13
[2018-06-22 01:11:05,862 INFO ]: Interpolant automaton has 13 states
[2018-06-22 01:11:05,862 INFO ]: Constructing interpolant automaton starting with 13 interpolants.
[2018-06-22 01:11:05,862 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2018-06-22 01:11:05,863 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 13 states.
[2018-06-22 01:11:06,425 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:06,425 INFO ]: Finished difference Result 28 states and 33 transitions.
[2018-06-22 01:11:06,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2018-06-22 01:11:06,425 INFO ]: Start accepts. Automaton has 13 states. Word has length 15
[2018-06-22 01:11:06,425 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:06,426 INFO ]: With dead ends: 28
[2018-06-22 01:11:06,426 INFO ]: Without dead ends: 22
[2018-06-22 01:11:06,426 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462
[2018-06-22 01:11:06,426 INFO ]: Start minimizeSevpa. Operand 22 states.
[2018-06-22 01:11:06,428 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19.
[2018-06-22 01:11:06,428 INFO ]: Start removeUnreachable. Operand 19 states.
[2018-06-22 01:11:06,429 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions.
[2018-06-22 01:11:06,429 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15
[2018-06-22 01:11:06,429 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:06,429 INFO ]: Abstraction has 19 states and 22 transitions.
[2018-06-22 01:11:06,429 INFO ]: Interpolant automaton has 13 states.
[2018-06-22 01:11:06,429 INFO ]: Start isEmpty. Operand 19 states and 22 transitions.
[2018-06-22 01:11:06,429 INFO ]: Finished isEmpty. Found accepting run of length 16
[2018-06-22 01:11:06,429 INFO ]: Found error trace
[2018-06-22 01:11:06,430 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:06,430 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:06,430 INFO ]: Analyzing trace with hash -329278308, now seen corresponding path program 4 times
[2018-06-22 01:11:06,430 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:06,430 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:06,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:06,430 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:11:06,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:06,440 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:06,503 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:06,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:11:06,504 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:11:06,512 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 01:11:06,535 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 01:11:06,535 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:11:06,537 INFO ]: Computing forward predicates...
[2018-06-22 01:11:06,573 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:11:06,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:11:06,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10
[2018-06-22 01:11:06,604 INFO ]: Interpolant automaton has 10 states
[2018-06-22 01:11:06,604 INFO ]: Constructing interpolant automaton starting with 10 interpolants.
[2018-06-22 01:11:06,604 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2018-06-22 01:11:06,604 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states.
[2018-06-22 01:11:06,707 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:11:06,707 INFO ]: Finished difference Result 20 states and 22 transitions.
[2018-06-22 01:11:06,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2018-06-22 01:11:06,708 INFO ]: Start accepts. Automaton has 10 states. Word has length 15
[2018-06-22 01:11:06,708 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:11:06,708 INFO ]: With dead ends: 20
[2018-06-22 01:11:06,708 INFO ]: Without dead ends: 18
[2018-06-22 01:11:06,708 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272
[2018-06-22 01:11:06,709 INFO ]: Start minimizeSevpa. Operand 18 states.
[2018-06-22 01:11:06,710 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2018-06-22 01:11:06,710 INFO ]: Start removeUnreachable. Operand 18 states.
[2018-06-22 01:11:06,711 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions.
[2018-06-22 01:11:06,711 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15
[2018-06-22 01:11:06,711 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:11:06,711 INFO ]: Abstraction has 18 states and 20 transitions.
[2018-06-22 01:11:06,711 INFO ]: Interpolant automaton has 10 states.
[2018-06-22 01:11:06,711 INFO ]: Start isEmpty. Operand 18 states and 20 transitions.
[2018-06-22 01:11:06,711 INFO ]: Finished isEmpty. Found accepting run of length 18
[2018-06-22 01:11:06,712 INFO ]: Found error trace
[2018-06-22 01:11:06,712 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:11:06,712 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:11:06,712 INFO ]: Analyzing trace with hash -1568441818, now seen corresponding path program 5 times
[2018-06-22 01:11:06,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:11:06,712 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:11:06,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:06,713 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:11:06,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:11:06,741 INFO ]: Conjunction of SSA is sat
[2018-06-22 01:11:06,756 INFO ]: Counterexample might be feasible
[2018-06-22 01:11:06,773 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:11:06 BoogieIcfgContainer
[2018-06-22 01:11:06,773 INFO ]: ------------------------ END TraceAbstraction----------------------------
[2018-06-22 01:11:06,774 INFO ]: Toolchain (without parser) took 7804.49 ms. Allocated memory was 304.1 MB in the beginning and 335.5 MB in the end (delta: 31.5 MB). Free memory was 260.5 MB in the beginning and 230.3 MB in the end (delta: 30.2 MB). Peak memory consumption was 61.6 MB. Max. memory is 3.6 GB.
[2018-06-22 01:11:06,774 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB.
[2018-06-22 01:11:06,775 INFO ]: ChcToBoogie took 75.96 ms. Allocated memory is still 304.1 MB. Free memory was 259.5 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB.
[2018-06-22 01:11:06,775 INFO ]: Boogie Preprocessor took 43.55 ms. Allocated memory is still 304.1 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB.
[2018-06-22 01:11:06,776 INFO ]: RCFGBuilder took 355.55 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 247.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB.
[2018-06-22 01:11:06,776 INFO ]: TraceAbstraction took 7302.27 ms. Allocated memory was 304.1 MB in the beginning and 335.5 MB in the end (delta: 31.5 MB). Free memory was 247.4 MB in the beginning and 230.3 MB in the end (delta: 17.1 MB). Peak memory consumption was 48.6 MB. Max. memory is 3.6 GB.
[2018-06-22 01:11:06,779 INFO ]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.10 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB.
 * ChcToBoogie took 75.96 ms. Allocated memory is still 304.1 MB. Free memory was 259.5 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB.
 * Boogie Preprocessor took 43.55 ms. Allocated memory is still 304.1 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB.
 * RCFGBuilder took 355.55 ms. Allocated memory is still 304.1 MB. Free memory was 256.4 MB in the beginning and 247.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB.
 * TraceAbstraction took 7302.27 ms. Allocated memory was 304.1 MB in the beginning and 335.5 MB in the end (delta: 31.5 MB). Free memory was 247.4 MB in the beginning and 230.3 MB in the end (delta: 17.1 MB). Peak memory consumption was 48.6 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 gotoProc(0, 0, 0, 0, 0, 0);
[L0]        gotoSwitch := gotoSwitch_in;
[L0]        assume !(hbv_False_1_Int == hbv_False_2_Int);
[L0]        hhv_inv_main27_0_Int, hhv_inv_main27_1_Int, hhv_inv_main27_2_Int := hbv_False_3_Int, hbv_False_1_Int, hbv_False_2_Int;
[L0]        havoc hbv_False_2_Int, hbv_False_1_Int, hbv_False_3_Int;
[L0]        assume !(0 <= hbv_inv_main27_1_Int + -1);
[L0]        hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := 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]        havoc hbv_inv_main27_1_Int, hbv_inv_main27_2_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]        hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := 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]        havoc hbv_inv_main23_1_Int, hbv_inv_main23_2_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]        hhv_inv_main23_0_Int, hhv_inv_main23_1_Int, hhv_inv_main23_2_Int, hhv_inv_main23_3_Int, hhv_inv_main23_4_Int := 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]        havoc hbv_inv_main23_1_Int, hbv_inv_main23_2_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]        hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main23_0_Int, hbv_inv_main23_2_Int, hhv_inv_main23_1_Int, hbv_inv_main23_1_Int;
[L0]        havoc hbv_inv_main23_1_Int, hbv_inv_main23_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]        hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int;
[L0]        havoc 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]        hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hhv_inv_main14_2_Int, hhv_inv_main14_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int, hbv_inv_main14_2_Int;
[L0]        havoc 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]        hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main14_0_Int, hhv_inv_main14_3_Int, hhv_inv_main14_1_Int, hbv_inv_main14_1_Int;
[L0]        havoc 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]        hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int;
[L0]        havoc 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]        hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hhv_inv_main8_2_Int, hhv_inv_main8_3_Int := hhv_inv_main8_0_Int, hhv_inv_main8_1_Int, hbv_inv_main8_2_Int, hbv_inv_main8_1_Int;
[L0]        havoc 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]        hhv_inv_main3_0_Int := hhv_inv_main8_0_Int;
[L0]        assume true;
[L0]  RET   call gotoProc(0, 0, 0, 0, 0, 0);
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 14 locations, 1 error locations. UNSAFE Result, 7.2s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 134 SDslu, 457 SDs, 0 SdLazy, 321 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=6, 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, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 6590 SizeOfPredicates, 42 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 26/46 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_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-11-06-791.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cube_square_unsafe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-11-06-791.csv
Received shutdown request...