java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:34:44,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:34:44,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:34:44,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:34:44,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:34:44,109 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:34:44,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:34:44,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:34:44,114 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:34:44,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:34:44,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:34:44,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:34:44,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:34:44,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:34:44,119 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:34:44,120 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:34:44,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:34:44,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:34:44,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:34:44,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:34:44,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:34:44,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:34:44,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:34:44,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:34:44,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:34:44,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:34:44,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:34:44,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:34:44,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:34:44,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:34:44,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:34:44,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:34:44,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:34:44,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:34:44,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:34:44,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:34:44,151 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:34:44,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:34:44,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:34:44,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:34:44,178 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:34:44,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:34:44,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:34:44,179 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:34:44,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:34:44,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:34:44,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:34:44,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:34:44,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:34:44,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:34:44,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:34:44,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:34:44,181 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:34:44,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:34:44,182 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:34:44,182 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:34:44,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:34:44,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:34:44,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:34:44,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:34:44,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:34:44,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:34:44,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:34:44,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:34:44,184 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:34:44,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:34:44,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:34:44,184 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:34:44,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:34:44,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:34:44,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:34:44,269 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:34:44,270 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:34:44,270 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 23:34:44,340 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a65e4a3e/ef16dc460fe34c1da4367840f90533f2/FLAGdd00d8478 [2018-11-18 23:34:44,817 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:34:44,818 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 23:34:44,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a65e4a3e/ef16dc460fe34c1da4367840f90533f2/FLAGdd00d8478 [2018-11-18 23:34:45,181 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a65e4a3e/ef16dc460fe34c1da4367840f90533f2 [2018-11-18 23:34:45,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:34:45,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:34:45,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:34:45,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:34:45,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:34:45,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8a5721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45, skipping insertion in model container [2018-11-18 23:34:45,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:34:45,235 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:34:45,467 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:34:45,474 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:34:45,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:34:45,530 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:34:45,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45 WrapperNode [2018-11-18 23:34:45,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:34:45,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:34:45,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:34:45,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:34:45,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... [2018-11-18 23:34:45,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:34:45,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:34:45,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:34:45,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:34:45,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:34:45,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:34:45,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:34:45,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:34:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:34:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:34:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:34:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:34:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:34:46,362 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:34:46,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:34:46 BoogieIcfgContainer [2018-11-18 23:34:46,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:34:46,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:34:46,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:34:46,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:34:46,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:34:45" (1/3) ... [2018-11-18 23:34:46,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45512a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:34:46, skipping insertion in model container [2018-11-18 23:34:46,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:34:45" (2/3) ... [2018-11-18 23:34:46,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45512a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:34:46, skipping insertion in model container [2018-11-18 23:34:46,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:34:46" (3/3) ... [2018-11-18 23:34:46,372 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 23:34:46,383 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:34:46,392 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:34:46,411 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:34:46,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:34:46,446 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:34:46,447 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:34:46,447 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:34:46,447 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:34:46,447 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:34:46,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:34:46,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:34:46,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:34:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 23:34:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:34:46,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:46,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:46,487 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:46,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -6959071, now seen corresponding path program 1 times [2018-11-18 23:34:46,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:46,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-18 23:34:46,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-18 23:34:46,766 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #113#return; {33#true} is VALID [2018-11-18 23:34:46,767 INFO L256 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret6 := main(); {33#true} is VALID [2018-11-18 23:34:46,767 INFO L273 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {33#true} is VALID [2018-11-18 23:34:46,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-18 23:34:46,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2018-11-18 23:34:46,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {33#true} is VALID [2018-11-18 23:34:46,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 != ~p1~0;~lk1~0 := 1; {35#(= main_~lk1~0 1)} is VALID [2018-11-18 23:34:46,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {35#(= main_~lk1~0 1)} is VALID [2018-11-18 23:34:46,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {35#(= main_~lk1~0 1)} is VALID [2018-11-18 23:34:46,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {35#(= main_~lk1~0 1)} is VALID [2018-11-18 23:34:46,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#(= main_~lk1~0 1)} assume !(0 != ~p5~0); {35#(= main_~lk1~0 1)} is VALID [2018-11-18 23:34:46,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#(= main_~lk1~0 1)} assume 0 != ~p1~0; {35#(= main_~lk1~0 1)} is VALID [2018-11-18 23:34:46,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {34#false} is VALID [2018-11-18 23:34:46,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-18 23:34:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:46,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 23:34:46,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:46,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:47,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:47,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:47,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:47,033 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-18 23:34:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:47,381 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2018-11-18 23:34:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:47,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 23:34:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-18 23:34:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-18 23:34:47,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-18 23:34:47,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:47,731 INFO L225 Difference]: With dead ends: 59 [2018-11-18 23:34:47,731 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:34:47,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:34:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-18 23:34:47,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:47,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2018-11-18 23:34:47,785 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2018-11-18 23:34:47,785 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2018-11-18 23:34:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:47,795 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2018-11-18 23:34:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-11-18 23:34:47,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:47,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:47,796 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2018-11-18 23:34:47,796 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2018-11-18 23:34:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:47,803 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2018-11-18 23:34:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-11-18 23:34:47,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:47,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:47,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:34:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2018-11-18 23:34:47,810 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2018-11-18 23:34:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:47,811 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2018-11-18 23:34:47,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 23:34:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:34:47,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:47,813 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:47,813 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:47,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash -816305697, now seen corresponding path program 1 times [2018-11-18 23:34:47,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:47,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:47,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:47,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:47,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2018-11-18 23:34:47,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-18 23:34:47,949 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #113#return; {234#true} is VALID [2018-11-18 23:34:47,949 INFO L256 TraceCheckUtils]: 3: Hoare triple {234#true} call #t~ret6 := main(); {234#true} is VALID [2018-11-18 23:34:47,950 INFO L273 TraceCheckUtils]: 4: Hoare triple {234#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {234#true} is VALID [2018-11-18 23:34:47,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-18 23:34:47,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {234#true} is VALID [2018-11-18 23:34:47,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {234#true} is VALID [2018-11-18 23:34:47,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {234#true} assume !(0 != ~p1~0); {236#(= main_~p1~0 0)} is VALID [2018-11-18 23:34:47,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {236#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {236#(= main_~p1~0 0)} is VALID [2018-11-18 23:34:47,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {236#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {236#(= main_~p1~0 0)} is VALID [2018-11-18 23:34:47,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {236#(= main_~p1~0 0)} is VALID [2018-11-18 23:34:47,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#(= main_~p1~0 0)} assume !(0 != ~p5~0); {236#(= main_~p1~0 0)} is VALID [2018-11-18 23:34:47,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {236#(= main_~p1~0 0)} assume 0 != ~p1~0; {235#false} is VALID [2018-11-18 23:34:47,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {235#false} assume 1 != ~lk1~0; {235#false} is VALID [2018-11-18 23:34:47,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {235#false} assume !false; {235#false} is VALID [2018-11-18 23:34:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:47,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:47,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:47,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 23:34:47,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:47,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:48,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:48,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:48,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:48,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:48,003 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 3 states. [2018-11-18 23:34:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:48,535 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2018-11-18 23:34:48,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:48,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 23:34:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-18 23:34:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-18 23:34:48,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-18 23:34:48,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:48,753 INFO L225 Difference]: With dead ends: 70 [2018-11-18 23:34:48,754 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:34:48,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:34:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 23:34:48,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:48,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-18 23:34:48,775 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-18 23:34:48,775 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-18 23:34:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:48,779 INFO L93 Difference]: Finished difference Result 44 states and 68 transitions. [2018-11-18 23:34:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-11-18 23:34:48,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:48,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:48,781 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-18 23:34:48,781 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-18 23:34:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:48,785 INFO L93 Difference]: Finished difference Result 44 states and 68 transitions. [2018-11-18 23:34:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-11-18 23:34:48,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:48,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:48,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:48,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 23:34:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2018-11-18 23:34:48,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 16 [2018-11-18 23:34:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:48,791 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2018-11-18 23:34:48,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2018-11-18 23:34:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:34:48,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:48,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:48,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:48,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash -215516200, now seen corresponding path program 1 times [2018-11-18 23:34:48,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:48,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:48,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2018-11-18 23:34:48,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {456#true} assume true; {456#true} is VALID [2018-11-18 23:34:48,898 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {456#true} {456#true} #113#return; {456#true} is VALID [2018-11-18 23:34:48,899 INFO L256 TraceCheckUtils]: 3: Hoare triple {456#true} call #t~ret6 := main(); {456#true} is VALID [2018-11-18 23:34:48,899 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {456#true} is VALID [2018-11-18 23:34:48,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#true} assume true; {456#true} is VALID [2018-11-18 23:34:48,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {456#true} is VALID [2018-11-18 23:34:48,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {456#true} is VALID [2018-11-18 23:34:48,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#true} assume 0 != ~p1~0;~lk1~0 := 1; {458#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:34:48,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {458#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {458#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:34:48,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {458#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {458#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:34:48,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {458#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {458#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:34:48,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {458#(not (= main_~p1~0 0))} assume !(0 != ~p5~0); {458#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:34:48,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {458#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {457#false} is VALID [2018-11-18 23:34:48,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {457#false} assume 0 != ~p2~0; {457#false} is VALID [2018-11-18 23:34:48,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {457#false} assume 1 != ~lk2~0; {457#false} is VALID [2018-11-18 23:34:48,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {457#false} assume !false; {457#false} is VALID [2018-11-18 23:34:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:48,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:48,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:48,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:34:48,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:48,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:48,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:48,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:48,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:48,955 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 3 states. [2018-11-18 23:34:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:49,174 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2018-11-18 23:34:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:49,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:34:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-18 23:34:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-18 23:34:49,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-18 23:34:49,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:49,427 INFO L225 Difference]: With dead ends: 67 [2018-11-18 23:34:49,428 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 23:34:49,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 23:34:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 23:34:49,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:49,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-18 23:34:49,455 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-18 23:34:49,455 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-18 23:34:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:49,459 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2018-11-18 23:34:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2018-11-18 23:34:49,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:49,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:49,460 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-18 23:34:49,460 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-18 23:34:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:49,464 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2018-11-18 23:34:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2018-11-18 23:34:49,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:49,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:49,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:49,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 23:34:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2018-11-18 23:34:49,468 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 17 [2018-11-18 23:34:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:49,469 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2018-11-18 23:34:49,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2018-11-18 23:34:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:34:49,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:49,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:49,471 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:49,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:49,471 INFO L82 PathProgramCache]: Analyzing trace with hash 464542170, now seen corresponding path program 1 times [2018-11-18 23:34:49,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:49,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:49,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:49,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:49,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2018-11-18 23:34:49,539 INFO L273 TraceCheckUtils]: 1: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-18 23:34:49,540 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {689#true} {689#true} #113#return; {689#true} is VALID [2018-11-18 23:34:49,540 INFO L256 TraceCheckUtils]: 3: Hoare triple {689#true} call #t~ret6 := main(); {689#true} is VALID [2018-11-18 23:34:49,540 INFO L273 TraceCheckUtils]: 4: Hoare triple {689#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {689#true} is VALID [2018-11-18 23:34:49,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-18 23:34:49,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {689#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {689#true} is VALID [2018-11-18 23:34:49,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {689#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {689#true} is VALID [2018-11-18 23:34:49,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {689#true} assume !(0 != ~p1~0); {689#true} is VALID [2018-11-18 23:34:49,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {689#true} assume 0 != ~p2~0;~lk2~0 := 1; {691#(= main_~lk2~0 1)} is VALID [2018-11-18 23:34:49,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {691#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {691#(= main_~lk2~0 1)} is VALID [2018-11-18 23:34:49,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {691#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {691#(= main_~lk2~0 1)} is VALID [2018-11-18 23:34:49,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {691#(= main_~lk2~0 1)} assume !(0 != ~p5~0); {691#(= main_~lk2~0 1)} is VALID [2018-11-18 23:34:49,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {691#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {691#(= main_~lk2~0 1)} is VALID [2018-11-18 23:34:49,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {691#(= main_~lk2~0 1)} assume 0 != ~p2~0; {691#(= main_~lk2~0 1)} is VALID [2018-11-18 23:34:49,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {691#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {690#false} is VALID [2018-11-18 23:34:49,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {690#false} assume !false; {690#false} is VALID [2018-11-18 23:34:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:49,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:49,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:49,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:34:49,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:49,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:49,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:49,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:49,581 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand 3 states. [2018-11-18 23:34:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:49,730 INFO L93 Difference]: Finished difference Result 81 states and 125 transitions. [2018-11-18 23:34:49,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:49,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:34:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 23:34:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 23:34:49,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-18 23:34:49,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:49,876 INFO L225 Difference]: With dead ends: 81 [2018-11-18 23:34:49,877 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 23:34:49,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 23:34:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-11-18 23:34:49,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:49,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 59 states. [2018-11-18 23:34:49,910 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 59 states. [2018-11-18 23:34:49,910 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 59 states. [2018-11-18 23:34:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:49,914 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-11-18 23:34:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2018-11-18 23:34:49,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:49,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:49,916 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 79 states. [2018-11-18 23:34:49,916 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 79 states. [2018-11-18 23:34:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:49,920 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-11-18 23:34:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2018-11-18 23:34:49,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:49,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:49,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:49,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 23:34:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2018-11-18 23:34:49,926 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 17 [2018-11-18 23:34:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:49,926 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2018-11-18 23:34:49,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2018-11-18 23:34:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:34:49,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:49,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:49,928 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:49,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash -344804456, now seen corresponding path program 1 times [2018-11-18 23:34:49,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:49,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:49,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:50,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {1012#true} call ULTIMATE.init(); {1012#true} is VALID [2018-11-18 23:34:50,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {1012#true} assume true; {1012#true} is VALID [2018-11-18 23:34:50,004 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1012#true} {1012#true} #113#return; {1012#true} is VALID [2018-11-18 23:34:50,005 INFO L256 TraceCheckUtils]: 3: Hoare triple {1012#true} call #t~ret6 := main(); {1012#true} is VALID [2018-11-18 23:34:50,005 INFO L273 TraceCheckUtils]: 4: Hoare triple {1012#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {1012#true} is VALID [2018-11-18 23:34:50,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {1012#true} assume true; {1012#true} is VALID [2018-11-18 23:34:50,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {1012#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1012#true} is VALID [2018-11-18 23:34:50,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {1012#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1012#true} is VALID [2018-11-18 23:34:50,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {1012#true} assume !(0 != ~p1~0); {1012#true} is VALID [2018-11-18 23:34:50,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {1012#true} assume !(0 != ~p2~0); {1014#(= main_~p2~0 0)} is VALID [2018-11-18 23:34:50,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {1014#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1014#(= main_~p2~0 0)} is VALID [2018-11-18 23:34:50,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {1014#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1014#(= main_~p2~0 0)} is VALID [2018-11-18 23:34:50,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {1014#(= main_~p2~0 0)} assume !(0 != ~p5~0); {1014#(= main_~p2~0 0)} is VALID [2018-11-18 23:34:50,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {1014#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1014#(= main_~p2~0 0)} is VALID [2018-11-18 23:34:50,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {1014#(= main_~p2~0 0)} assume 0 != ~p2~0; {1013#false} is VALID [2018-11-18 23:34:50,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {1013#false} assume 1 != ~lk2~0; {1013#false} is VALID [2018-11-18 23:34:50,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {1013#false} assume !false; {1013#false} is VALID [2018-11-18 23:34:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:50,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:50,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:50,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:34:50,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:50,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:50,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:50,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:50,035 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand 3 states. [2018-11-18 23:34:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:50,150 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2018-11-18 23:34:50,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:50,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:34:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-18 23:34:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-18 23:34:50,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2018-11-18 23:34:50,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:50,278 INFO L225 Difference]: With dead ends: 131 [2018-11-18 23:34:50,278 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 23:34:50,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 23:34:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-18 23:34:50,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:50,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2018-11-18 23:34:50,317 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2018-11-18 23:34:50,317 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2018-11-18 23:34:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:50,321 INFO L93 Difference]: Finished difference Result 81 states and 120 transitions. [2018-11-18 23:34:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2018-11-18 23:34:50,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:50,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:50,323 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2018-11-18 23:34:50,323 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2018-11-18 23:34:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:50,327 INFO L93 Difference]: Finished difference Result 81 states and 120 transitions. [2018-11-18 23:34:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2018-11-18 23:34:50,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:50,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:50,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:50,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 23:34:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2018-11-18 23:34:50,333 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 17 [2018-11-18 23:34:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:50,333 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2018-11-18 23:34:50,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2018-11-18 23:34:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:34:50,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:50,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:50,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:50,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1516120724, now seen corresponding path program 1 times [2018-11-18 23:34:50,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:50,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:50,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:50,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {1413#true} call ULTIMATE.init(); {1413#true} is VALID [2018-11-18 23:34:50,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {1413#true} assume true; {1413#true} is VALID [2018-11-18 23:34:50,390 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1413#true} {1413#true} #113#return; {1413#true} is VALID [2018-11-18 23:34:50,391 INFO L256 TraceCheckUtils]: 3: Hoare triple {1413#true} call #t~ret6 := main(); {1413#true} is VALID [2018-11-18 23:34:50,391 INFO L273 TraceCheckUtils]: 4: Hoare triple {1413#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {1413#true} is VALID [2018-11-18 23:34:50,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1413#true} assume true; {1413#true} is VALID [2018-11-18 23:34:50,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {1413#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1413#true} is VALID [2018-11-18 23:34:50,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {1413#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1413#true} is VALID [2018-11-18 23:34:50,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {1413#true} assume !(0 != ~p1~0); {1413#true} is VALID [2018-11-18 23:34:50,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1413#true} assume 0 != ~p2~0;~lk2~0 := 1; {1415#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:34:50,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {1415#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1415#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:34:50,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {1415#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1415#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:34:50,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {1415#(not (= main_~p2~0 0))} assume !(0 != ~p5~0); {1415#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:34:50,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1415#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {1415#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:34:50,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {1415#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {1414#false} is VALID [2018-11-18 23:34:50,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {1414#false} assume 0 != ~p3~0; {1414#false} is VALID [2018-11-18 23:34:50,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {1414#false} assume 1 != ~lk3~0; {1414#false} is VALID [2018-11-18 23:34:50,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {1414#false} assume !false; {1414#false} is VALID [2018-11-18 23:34:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:50,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:50,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:50,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 23:34:50,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:50,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:50,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:50,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:50,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:50,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:50,486 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand 3 states. [2018-11-18 23:34:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:50,740 INFO L93 Difference]: Finished difference Result 118 states and 176 transitions. [2018-11-18 23:34:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:50,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 23:34:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-18 23:34:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-18 23:34:50,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-18 23:34:50,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:50,869 INFO L225 Difference]: With dead ends: 118 [2018-11-18 23:34:50,870 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 23:34:50,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 23:34:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-18 23:34:50,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:50,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-18 23:34:50,898 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-18 23:34:50,898 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-18 23:34:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:50,901 INFO L93 Difference]: Finished difference Result 83 states and 120 transitions. [2018-11-18 23:34:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2018-11-18 23:34:50,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:50,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:50,901 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-18 23:34:50,902 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-18 23:34:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:50,905 INFO L93 Difference]: Finished difference Result 83 states and 120 transitions. [2018-11-18 23:34:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2018-11-18 23:34:50,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:50,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:50,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:50,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 23:34:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2018-11-18 23:34:50,910 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 18 [2018-11-18 23:34:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:50,910 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2018-11-18 23:34:50,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2018-11-18 23:34:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:34:50,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:50,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:50,912 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:50,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2098788202, now seen corresponding path program 1 times [2018-11-18 23:34:50,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:50,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:50,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:50,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:50,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:50,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2018-11-18 23:34:50,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {1807#true} assume true; {1807#true} is VALID [2018-11-18 23:34:50,967 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1807#true} {1807#true} #113#return; {1807#true} is VALID [2018-11-18 23:34:50,968 INFO L256 TraceCheckUtils]: 3: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2018-11-18 23:34:50,968 INFO L273 TraceCheckUtils]: 4: Hoare triple {1807#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {1807#true} is VALID [2018-11-18 23:34:50,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {1807#true} assume true; {1807#true} is VALID [2018-11-18 23:34:50,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {1807#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1807#true} is VALID [2018-11-18 23:34:50,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {1807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1807#true} is VALID [2018-11-18 23:34:50,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 != ~p1~0); {1807#true} is VALID [2018-11-18 23:34:50,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {1807#true} assume !(0 != ~p2~0); {1807#true} is VALID [2018-11-18 23:34:50,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {1807#true} assume 0 != ~p3~0;~lk3~0 := 1; {1809#(= main_~lk3~0 1)} is VALID [2018-11-18 23:34:50,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {1809#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1809#(= main_~lk3~0 1)} is VALID [2018-11-18 23:34:50,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {1809#(= main_~lk3~0 1)} assume !(0 != ~p5~0); {1809#(= main_~lk3~0 1)} is VALID [2018-11-18 23:34:50,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {1809#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {1809#(= main_~lk3~0 1)} is VALID [2018-11-18 23:34:50,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {1809#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {1809#(= main_~lk3~0 1)} is VALID [2018-11-18 23:34:50,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {1809#(= main_~lk3~0 1)} assume 0 != ~p3~0; {1809#(= main_~lk3~0 1)} is VALID [2018-11-18 23:34:50,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {1808#false} is VALID [2018-11-18 23:34:50,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2018-11-18 23:34:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:50,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:50,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 23:34:50,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:50,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:51,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:51,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:51,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:51,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:51,015 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand 3 states. [2018-11-18 23:34:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:51,136 INFO L93 Difference]: Finished difference Result 141 states and 209 transitions. [2018-11-18 23:34:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:51,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 23:34:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-18 23:34:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-18 23:34:51,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-18 23:34:51,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:51,226 INFO L225 Difference]: With dead ends: 141 [2018-11-18 23:34:51,227 INFO L226 Difference]: Without dead ends: 139 [2018-11-18 23:34:51,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-18 23:34:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-18 23:34:51,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:51,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 109 states. [2018-11-18 23:34:51,289 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 109 states. [2018-11-18 23:34:51,289 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 109 states. [2018-11-18 23:34:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:51,295 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2018-11-18 23:34:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2018-11-18 23:34:51,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:51,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:51,296 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 139 states. [2018-11-18 23:34:51,297 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 139 states. [2018-11-18 23:34:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:51,302 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2018-11-18 23:34:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2018-11-18 23:34:51,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:51,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:51,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:51,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 23:34:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2018-11-18 23:34:51,308 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 18 [2018-11-18 23:34:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:51,308 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2018-11-18 23:34:51,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-11-18 23:34:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:34:51,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:51,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:51,310 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:51,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1386832468, now seen corresponding path program 1 times [2018-11-18 23:34:51,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:51,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:51,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {2366#true} call ULTIMATE.init(); {2366#true} is VALID [2018-11-18 23:34:51,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {2366#true} assume true; {2366#true} is VALID [2018-11-18 23:34:51,381 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2366#true} {2366#true} #113#return; {2366#true} is VALID [2018-11-18 23:34:51,382 INFO L256 TraceCheckUtils]: 3: Hoare triple {2366#true} call #t~ret6 := main(); {2366#true} is VALID [2018-11-18 23:34:51,382 INFO L273 TraceCheckUtils]: 4: Hoare triple {2366#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {2366#true} is VALID [2018-11-18 23:34:51,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {2366#true} assume true; {2366#true} is VALID [2018-11-18 23:34:51,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {2366#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2366#true} is VALID [2018-11-18 23:34:51,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {2366#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2366#true} is VALID [2018-11-18 23:34:51,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {2366#true} assume !(0 != ~p1~0); {2366#true} is VALID [2018-11-18 23:34:51,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {2366#true} assume !(0 != ~p2~0); {2366#true} is VALID [2018-11-18 23:34:51,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {2366#true} assume !(0 != ~p3~0); {2368#(= main_~p3~0 0)} is VALID [2018-11-18 23:34:51,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {2368#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2368#(= main_~p3~0 0)} is VALID [2018-11-18 23:34:51,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {2368#(= main_~p3~0 0)} assume !(0 != ~p5~0); {2368#(= main_~p3~0 0)} is VALID [2018-11-18 23:34:51,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {2368#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2368#(= main_~p3~0 0)} is VALID [2018-11-18 23:34:51,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {2368#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2368#(= main_~p3~0 0)} is VALID [2018-11-18 23:34:51,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {2368#(= main_~p3~0 0)} assume 0 != ~p3~0; {2367#false} is VALID [2018-11-18 23:34:51,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {2367#false} assume 1 != ~lk3~0; {2367#false} is VALID [2018-11-18 23:34:51,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {2367#false} assume !false; {2367#false} is VALID [2018-11-18 23:34:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:51,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:51,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:51,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 23:34:51,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:51,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:51,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:51,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:51,458 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2018-11-18 23:34:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:51,600 INFO L93 Difference]: Finished difference Result 245 states and 357 transitions. [2018-11-18 23:34:51,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:51,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 23:34:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-18 23:34:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-18 23:34:51,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-18 23:34:51,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:51,775 INFO L225 Difference]: With dead ends: 245 [2018-11-18 23:34:51,775 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 23:34:51,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 23:34:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-18 23:34:51,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:51,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 145 states. [2018-11-18 23:34:51,836 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 145 states. [2018-11-18 23:34:51,836 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 145 states. [2018-11-18 23:34:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:51,842 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2018-11-18 23:34:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2018-11-18 23:34:51,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:51,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:51,843 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 147 states. [2018-11-18 23:34:51,843 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 147 states. [2018-11-18 23:34:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:51,849 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2018-11-18 23:34:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2018-11-18 23:34:51,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:51,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:51,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:51,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 23:34:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-18 23:34:51,856 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 18 [2018-11-18 23:34:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:51,856 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-18 23:34:51,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-18 23:34:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:34:51,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:51,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:51,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:51,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash -637709139, now seen corresponding path program 1 times [2018-11-18 23:34:51,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:51,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:51,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:51,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:52,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {3089#true} call ULTIMATE.init(); {3089#true} is VALID [2018-11-18 23:34:52,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {3089#true} assume true; {3089#true} is VALID [2018-11-18 23:34:52,066 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3089#true} {3089#true} #113#return; {3089#true} is VALID [2018-11-18 23:34:52,066 INFO L256 TraceCheckUtils]: 3: Hoare triple {3089#true} call #t~ret6 := main(); {3089#true} is VALID [2018-11-18 23:34:52,066 INFO L273 TraceCheckUtils]: 4: Hoare triple {3089#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {3089#true} is VALID [2018-11-18 23:34:52,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {3089#true} assume true; {3089#true} is VALID [2018-11-18 23:34:52,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {3089#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {3089#true} is VALID [2018-11-18 23:34:52,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {3089#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3089#true} is VALID [2018-11-18 23:34:52,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {3089#true} assume !(0 != ~p1~0); {3089#true} is VALID [2018-11-18 23:34:52,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {3089#true} assume !(0 != ~p2~0); {3089#true} is VALID [2018-11-18 23:34:52,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {3089#true} assume 0 != ~p3~0;~lk3~0 := 1; {3091#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:34:52,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {3091#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3091#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:34:52,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {3091#(not (= main_~p3~0 0))} assume !(0 != ~p5~0); {3091#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:34:52,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {3091#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3091#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:34:52,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {3091#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3091#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:34:52,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {3091#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3090#false} is VALID [2018-11-18 23:34:52,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {3090#false} assume 0 != ~p4~0; {3090#false} is VALID [2018-11-18 23:34:52,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {3090#false} assume 1 != ~lk4~0; {3090#false} is VALID [2018-11-18 23:34:52,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {3090#false} assume !false; {3090#false} is VALID [2018-11-18 23:34:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:52,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:52,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:34:52,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:52,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:52,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:52,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:52,191 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 3 states. [2018-11-18 23:34:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:52,340 INFO L93 Difference]: Finished difference Result 217 states and 301 transitions. [2018-11-18 23:34:52,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:52,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:34:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-18 23:34:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-18 23:34:52,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-18 23:34:52,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:52,482 INFO L225 Difference]: With dead ends: 217 [2018-11-18 23:34:52,482 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 23:34:52,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 23:34:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-18 23:34:52,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:52,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 149 states. [2018-11-18 23:34:52,772 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 149 states. [2018-11-18 23:34:52,772 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 149 states. [2018-11-18 23:34:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:52,777 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2018-11-18 23:34:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2018-11-18 23:34:52,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:52,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:52,778 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 151 states. [2018-11-18 23:34:52,778 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 151 states. [2018-11-18 23:34:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:52,782 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2018-11-18 23:34:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2018-11-18 23:34:52,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:52,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:52,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:52,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 23:34:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2018-11-18 23:34:52,786 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 19 [2018-11-18 23:34:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:52,786 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2018-11-18 23:34:52,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-11-18 23:34:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:34:52,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:52,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:52,788 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:52,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 42349231, now seen corresponding path program 1 times [2018-11-18 23:34:52,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:52,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:52,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {3796#true} call ULTIMATE.init(); {3796#true} is VALID [2018-11-18 23:34:52,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {3796#true} assume true; {3796#true} is VALID [2018-11-18 23:34:52,858 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3796#true} {3796#true} #113#return; {3796#true} is VALID [2018-11-18 23:34:52,858 INFO L256 TraceCheckUtils]: 3: Hoare triple {3796#true} call #t~ret6 := main(); {3796#true} is VALID [2018-11-18 23:34:52,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {3796#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {3796#true} is VALID [2018-11-18 23:34:52,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {3796#true} assume true; {3796#true} is VALID [2018-11-18 23:34:52,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {3796#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {3796#true} is VALID [2018-11-18 23:34:52,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {3796#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3796#true} is VALID [2018-11-18 23:34:52,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {3796#true} assume !(0 != ~p1~0); {3796#true} is VALID [2018-11-18 23:34:52,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#true} assume !(0 != ~p2~0); {3796#true} is VALID [2018-11-18 23:34:52,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {3796#true} assume !(0 != ~p3~0); {3796#true} is VALID [2018-11-18 23:34:52,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {3796#true} assume 0 != ~p4~0;~lk4~0 := 1; {3798#(= main_~lk4~0 1)} is VALID [2018-11-18 23:34:52,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {3798#(= main_~lk4~0 1)} assume !(0 != ~p5~0); {3798#(= main_~lk4~0 1)} is VALID [2018-11-18 23:34:52,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {3798#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {3798#(= main_~lk4~0 1)} is VALID [2018-11-18 23:34:52,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {3798#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {3798#(= main_~lk4~0 1)} is VALID [2018-11-18 23:34:52,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {3798#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {3798#(= main_~lk4~0 1)} is VALID [2018-11-18 23:34:52,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {3798#(= main_~lk4~0 1)} assume 0 != ~p4~0; {3798#(= main_~lk4~0 1)} is VALID [2018-11-18 23:34:52,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {3798#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {3797#false} is VALID [2018-11-18 23:34:52,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {3797#false} assume !false; {3797#false} is VALID [2018-11-18 23:34:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:52,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:52,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:52,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:34:52,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:52,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:52,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:52,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:52,941 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 3 states. [2018-11-18 23:34:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:53,340 INFO L93 Difference]: Finished difference Result 253 states and 345 transitions. [2018-11-18 23:34:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:53,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:34:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-18 23:34:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-18 23:34:53,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-18 23:34:53,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:53,474 INFO L225 Difference]: With dead ends: 253 [2018-11-18 23:34:53,474 INFO L226 Difference]: Without dead ends: 251 [2018-11-18 23:34:53,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-18 23:34:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 209. [2018-11-18 23:34:53,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:53,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand 209 states. [2018-11-18 23:34:53,530 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 209 states. [2018-11-18 23:34:53,531 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 209 states. [2018-11-18 23:34:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:53,537 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2018-11-18 23:34:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 336 transitions. [2018-11-18 23:34:53,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:53,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:53,538 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 251 states. [2018-11-18 23:34:53,538 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 251 states. [2018-11-18 23:34:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:53,544 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2018-11-18 23:34:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 336 transitions. [2018-11-18 23:34:53,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:53,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:53,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:53,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-18 23:34:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2018-11-18 23:34:53,550 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 279 transitions. Word has length 19 [2018-11-18 23:34:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:53,551 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 279 transitions. [2018-11-18 23:34:53,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 279 transitions. [2018-11-18 23:34:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:34:53,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:53,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:53,553 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:53,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash -766997395, now seen corresponding path program 1 times [2018-11-18 23:34:53,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:53,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:53,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:53,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {4803#true} call ULTIMATE.init(); {4803#true} is VALID [2018-11-18 23:34:53,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {4803#true} assume true; {4803#true} is VALID [2018-11-18 23:34:53,785 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4803#true} {4803#true} #113#return; {4803#true} is VALID [2018-11-18 23:34:53,786 INFO L256 TraceCheckUtils]: 3: Hoare triple {4803#true} call #t~ret6 := main(); {4803#true} is VALID [2018-11-18 23:34:53,786 INFO L273 TraceCheckUtils]: 4: Hoare triple {4803#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {4803#true} is VALID [2018-11-18 23:34:53,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {4803#true} assume true; {4803#true} is VALID [2018-11-18 23:34:53,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {4803#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {4803#true} is VALID [2018-11-18 23:34:53,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {4803#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4803#true} is VALID [2018-11-18 23:34:53,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {4803#true} assume !(0 != ~p1~0); {4803#true} is VALID [2018-11-18 23:34:53,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {4803#true} assume !(0 != ~p2~0); {4803#true} is VALID [2018-11-18 23:34:53,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {4803#true} assume !(0 != ~p3~0); {4803#true} is VALID [2018-11-18 23:34:53,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {4803#true} assume !(0 != ~p4~0); {4805#(= main_~p4~0 0)} is VALID [2018-11-18 23:34:53,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {4805#(= main_~p4~0 0)} assume !(0 != ~p5~0); {4805#(= main_~p4~0 0)} is VALID [2018-11-18 23:34:53,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {4805#(= main_~p4~0 0)} assume !(0 != ~p1~0); {4805#(= main_~p4~0 0)} is VALID [2018-11-18 23:34:53,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {4805#(= main_~p4~0 0)} assume !(0 != ~p2~0); {4805#(= main_~p4~0 0)} is VALID [2018-11-18 23:34:53,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {4805#(= main_~p4~0 0)} assume !(0 != ~p3~0); {4805#(= main_~p4~0 0)} is VALID [2018-11-18 23:34:53,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {4805#(= main_~p4~0 0)} assume 0 != ~p4~0; {4804#false} is VALID [2018-11-18 23:34:53,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {4804#false} assume 1 != ~lk4~0; {4804#false} is VALID [2018-11-18 23:34:53,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {4804#false} assume !false; {4804#false} is VALID [2018-11-18 23:34:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:53,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:53,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:34:53,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:53,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:54,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:54,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:54,077 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand 3 states. [2018-11-18 23:34:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:54,738 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2018-11-18 23:34:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:54,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:34:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-18 23:34:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-18 23:34:54,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2018-11-18 23:34:55,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:55,202 INFO L225 Difference]: With dead ends: 469 [2018-11-18 23:34:55,202 INFO L226 Difference]: Without dead ends: 275 [2018-11-18 23:34:55,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-18 23:34:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-11-18 23:34:55,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:55,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 273 states. [2018-11-18 23:34:55,363 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 273 states. [2018-11-18 23:34:55,364 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 273 states. [2018-11-18 23:34:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:55,371 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2018-11-18 23:34:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2018-11-18 23:34:55,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:55,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:55,372 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 275 states. [2018-11-18 23:34:55,372 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 275 states. [2018-11-18 23:34:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:55,380 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2018-11-18 23:34:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2018-11-18 23:34:55,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:55,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:55,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:55,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 23:34:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2018-11-18 23:34:55,390 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 19 [2018-11-18 23:34:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:55,390 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2018-11-18 23:34:55,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2018-11-18 23:34:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:34:55,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:55,391 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:55,392 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:55,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:55,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1313042185, now seen corresponding path program 1 times [2018-11-18 23:34:55,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:55,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:55,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:55,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {6154#true} call ULTIMATE.init(); {6154#true} is VALID [2018-11-18 23:34:55,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {6154#true} assume true; {6154#true} is VALID [2018-11-18 23:34:55,636 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6154#true} {6154#true} #113#return; {6154#true} is VALID [2018-11-18 23:34:55,637 INFO L256 TraceCheckUtils]: 3: Hoare triple {6154#true} call #t~ret6 := main(); {6154#true} is VALID [2018-11-18 23:34:55,637 INFO L273 TraceCheckUtils]: 4: Hoare triple {6154#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {6154#true} is VALID [2018-11-18 23:34:55,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {6154#true} assume true; {6154#true} is VALID [2018-11-18 23:34:55,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {6154#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {6154#true} is VALID [2018-11-18 23:34:55,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {6154#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {6154#true} is VALID [2018-11-18 23:34:55,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {6154#true} assume !(0 != ~p1~0); {6154#true} is VALID [2018-11-18 23:34:55,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#true} assume !(0 != ~p2~0); {6154#true} is VALID [2018-11-18 23:34:55,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#true} assume !(0 != ~p3~0); {6154#true} is VALID [2018-11-18 23:34:55,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#true} assume 0 != ~p4~0;~lk4~0 := 1; {6156#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:34:55,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {6156#(not (= main_~p4~0 0))} assume !(0 != ~p5~0); {6156#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:34:55,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {6156#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {6156#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:34:55,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {6156#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {6156#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:34:55,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {6156#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {6156#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:34:55,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {6156#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {6155#false} is VALID [2018-11-18 23:34:55,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {6155#false} assume 0 != ~p5~0; {6155#false} is VALID [2018-11-18 23:34:55,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {6155#false} assume 1 != ~lk5~0; {6155#false} is VALID [2018-11-18 23:34:55,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {6155#false} assume !false; {6155#false} is VALID [2018-11-18 23:34:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:55,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:55,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:55,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:34:55,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:55,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:55,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:55,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:55,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:55,814 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand 3 states. [2018-11-18 23:34:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:56,084 INFO L93 Difference]: Finished difference Result 409 states and 509 transitions. [2018-11-18 23:34:56,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:56,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:34:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-18 23:34:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-18 23:34:56,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-18 23:34:56,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:56,543 INFO L225 Difference]: With dead ends: 409 [2018-11-18 23:34:56,543 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 23:34:56,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 23:34:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-11-18 23:34:56,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:56,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand 281 states. [2018-11-18 23:34:56,629 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand 281 states. [2018-11-18 23:34:56,629 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 281 states. [2018-11-18 23:34:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:56,636 INFO L93 Difference]: Finished difference Result 283 states and 344 transitions. [2018-11-18 23:34:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 344 transitions. [2018-11-18 23:34:56,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:56,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:56,638 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 283 states. [2018-11-18 23:34:56,638 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 283 states. [2018-11-18 23:34:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:56,645 INFO L93 Difference]: Finished difference Result 283 states and 344 transitions. [2018-11-18 23:34:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 344 transitions. [2018-11-18 23:34:56,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:56,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:56,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:56,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 23:34:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 343 transitions. [2018-11-18 23:34:56,655 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 343 transitions. Word has length 20 [2018-11-18 23:34:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:56,655 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 343 transitions. [2018-11-18 23:34:56,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 343 transitions. [2018-11-18 23:34:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:34:56,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:56,656 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:56,656 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:56,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1993100555, now seen corresponding path program 1 times [2018-11-18 23:34:56,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:56,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:56,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:56,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:56,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:56,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7469#true} is VALID [2018-11-18 23:34:56,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {7469#true} assume true; {7469#true} is VALID [2018-11-18 23:34:56,895 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7469#true} {7469#true} #113#return; {7469#true} is VALID [2018-11-18 23:34:56,895 INFO L256 TraceCheckUtils]: 3: Hoare triple {7469#true} call #t~ret6 := main(); {7469#true} is VALID [2018-11-18 23:34:56,895 INFO L273 TraceCheckUtils]: 4: Hoare triple {7469#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {7469#true} is VALID [2018-11-18 23:34:56,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {7469#true} assume true; {7469#true} is VALID [2018-11-18 23:34:56,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {7469#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {7469#true} is VALID [2018-11-18 23:34:56,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {7469#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {7469#true} is VALID [2018-11-18 23:34:56,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {7469#true} assume !(0 != ~p1~0); {7469#true} is VALID [2018-11-18 23:34:56,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {7469#true} assume !(0 != ~p2~0); {7469#true} is VALID [2018-11-18 23:34:56,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {7469#true} assume !(0 != ~p3~0); {7469#true} is VALID [2018-11-18 23:34:56,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {7469#true} assume !(0 != ~p4~0); {7469#true} is VALID [2018-11-18 23:34:56,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {7469#true} assume !(0 != ~p5~0); {7471#(= main_~p5~0 0)} is VALID [2018-11-18 23:34:56,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {7471#(= main_~p5~0 0)} assume !(0 != ~p1~0); {7471#(= main_~p5~0 0)} is VALID [2018-11-18 23:34:56,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {7471#(= main_~p5~0 0)} assume !(0 != ~p2~0); {7471#(= main_~p5~0 0)} is VALID [2018-11-18 23:34:56,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {7471#(= main_~p5~0 0)} assume !(0 != ~p3~0); {7471#(= main_~p5~0 0)} is VALID [2018-11-18 23:34:56,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {7471#(= main_~p5~0 0)} assume !(0 != ~p4~0); {7471#(= main_~p5~0 0)} is VALID [2018-11-18 23:34:56,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {7471#(= main_~p5~0 0)} assume 0 != ~p5~0; {7470#false} is VALID [2018-11-18 23:34:56,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {7470#false} assume 1 != ~lk5~0; {7470#false} is VALID [2018-11-18 23:34:56,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2018-11-18 23:34:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:56,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:56,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:56,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:34:56,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:56,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:57,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:57,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:57,069 INFO L87 Difference]: Start difference. First operand 281 states and 343 transitions. Second operand 3 states. [2018-11-18 23:34:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:57,581 INFO L93 Difference]: Finished difference Result 779 states and 920 transitions. [2018-11-18 23:34:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:57,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:34:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-18 23:34:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-18 23:34:57,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-18 23:34:58,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:58,073 INFO L225 Difference]: With dead ends: 779 [2018-11-18 23:34:58,073 INFO L226 Difference]: Without dead ends: 281 [2018-11-18 23:34:58,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-18 23:34:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-18 23:34:58,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:58,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand 281 states. [2018-11-18 23:34:58,311 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 281 states. [2018-11-18 23:34:58,311 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 281 states. [2018-11-18 23:34:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:58,321 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-18 23:34:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-18 23:34:58,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:58,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:58,322 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 281 states. [2018-11-18 23:34:58,322 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 281 states. [2018-11-18 23:34:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:58,332 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-18 23:34:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-18 23:34:58,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:58,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:58,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:58,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 23:34:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 311 transitions. [2018-11-18 23:34:58,341 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 311 transitions. Word has length 20 [2018-11-18 23:34:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:58,341 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 311 transitions. [2018-11-18 23:34:58,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-18 23:34:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:34:58,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:34:58,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:34:58,343 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:34:58,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:34:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1492520115, now seen corresponding path program 1 times [2018-11-18 23:34:58,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:34:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:34:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:34:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:34:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:34:58,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {9173#true} call ULTIMATE.init(); {9173#true} is VALID [2018-11-18 23:34:58,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {9173#true} assume true; {9173#true} is VALID [2018-11-18 23:34:58,610 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9173#true} {9173#true} #113#return; {9173#true} is VALID [2018-11-18 23:34:58,610 INFO L256 TraceCheckUtils]: 3: Hoare triple {9173#true} call #t~ret6 := main(); {9173#true} is VALID [2018-11-18 23:34:58,610 INFO L273 TraceCheckUtils]: 4: Hoare triple {9173#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;havoc ~cond~0; {9173#true} is VALID [2018-11-18 23:34:58,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {9173#true} assume true; {9173#true} is VALID [2018-11-18 23:34:58,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {9173#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {9173#true} is VALID [2018-11-18 23:34:58,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {9173#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {9173#true} is VALID [2018-11-18 23:34:58,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {9173#true} assume !(0 != ~p1~0); {9173#true} is VALID [2018-11-18 23:34:58,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {9173#true} assume !(0 != ~p2~0); {9173#true} is VALID [2018-11-18 23:34:58,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {9173#true} assume !(0 != ~p3~0); {9173#true} is VALID [2018-11-18 23:34:58,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {9173#true} assume !(0 != ~p4~0); {9173#true} is VALID [2018-11-18 23:34:58,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {9173#true} assume 0 != ~p5~0;~lk5~0 := 1; {9175#(= main_~lk5~0 1)} is VALID [2018-11-18 23:34:58,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {9175#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9175#(= main_~lk5~0 1)} is VALID [2018-11-18 23:34:58,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {9175#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9175#(= main_~lk5~0 1)} is VALID [2018-11-18 23:34:58,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {9175#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9175#(= main_~lk5~0 1)} is VALID [2018-11-18 23:34:58,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {9175#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9175#(= main_~lk5~0 1)} is VALID [2018-11-18 23:34:58,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {9175#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9175#(= main_~lk5~0 1)} is VALID [2018-11-18 23:34:58,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {9175#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9174#false} is VALID [2018-11-18 23:34:58,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {9174#false} assume !false; {9174#false} is VALID [2018-11-18 23:34:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:34:58,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:34:58,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:34:58,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:34:58,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:34:58,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:34:58,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:58,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:34:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:34:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:58,795 INFO L87 Difference]: Start difference. First operand 281 states and 311 transitions. Second operand 3 states. [2018-11-18 23:34:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:58,912 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-18 23:34:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:34:58,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:34:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:34:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-18 23:34:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:34:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-18 23:34:58,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2018-11-18 23:34:59,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:34:59,327 INFO L225 Difference]: With dead ends: 281 [2018-11-18 23:34:59,327 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:34:59,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:34:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:34:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:34:59,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:34:59,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:34:59,329 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:34:59,329 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:34:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:59,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:34:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:34:59,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:59,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:59,329 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:34:59,330 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:34:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:34:59,330 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:34:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:34:59,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:59,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:34:59,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:34:59,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:34:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:34:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:34:59,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-18 23:34:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:34:59,331 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:34:59,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:34:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:34:59,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:34:59,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:34:59,402 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 23:34:59,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:34:59,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:34:59,403 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L428 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,403 INFO L425 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-18 23:34:59,404 INFO L428 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-18 23:34:59,404 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-18 23:34:59,405 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-18 23:34:59,405 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,405 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-18 23:34:59,405 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-18 23:34:59,405 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-18 23:34:59,405 INFO L421 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-18 23:34:59,405 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-18 23:34:59,407 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-18 23:34:59,408 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-18 23:34:59,409 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-18 23:34:59,410 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-18 23:34:59,410 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-18 23:34:59,410 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-18 23:34:59,410 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-18 23:34:59,410 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:34:59,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:34:59 BoogieIcfgContainer [2018-11-18 23:34:59,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:34:59,418 INFO L168 Benchmark]: Toolchain (without parser) took 14226.54 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 865.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.9 MB). Peak memory consumption was 120.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:34:59,419 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:34:59,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:34:59,420 INFO L168 Benchmark]: Boogie Preprocessor took 49.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:34:59,421 INFO L168 Benchmark]: RCFGBuilder took 774.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:34:59,422 INFO L168 Benchmark]: TraceAbstraction took 13052.43 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 148.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -3.4 MB). Peak memory consumption was 145.5 MB. Max. memory is 7.1 GB. [2018-11-18 23:34:59,428 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 774.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 716.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13052.43 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 148.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -3.4 MB). Peak memory consumption was 145.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. SAFE Result, 12.9s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 297 SDslu, 428 SDs, 0 SdLazy, 73 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=12, 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: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 121 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 7060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...