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_8_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:35:02,052 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:35:02,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:35:02,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:35:02,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:35:02,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:35:02,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:35:02,074 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:35:02,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:35:02,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:35:02,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:35:02,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:35:02,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:35:02,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:35:02,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:35:02,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:35:02,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:35:02,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:35:02,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:35:02,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:35:02,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:35:02,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:35:02,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:35:02,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:35:02,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:35:02,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:35:02,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:35:02,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:35:02,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:35:02,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:35:02,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:35:02,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:35:02,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:35:02,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:35:02,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:35:02,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:35:02,103 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:35:02,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:35:02,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:35:02,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:35:02,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:35:02,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:35:02,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:35:02,132 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:35:02,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:35:02,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:35:02,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:35:02,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:35:02,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:35:02,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:35:02,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:35:02,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:35:02,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:35:02,134 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:35:02,135 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:35:02,136 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:35:02,136 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:35:02,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:35:02,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:35:02,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:35:02,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:35:02,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:35:02,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:35:02,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:35:02,137 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:35:02,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:35:02,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:35:02,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:35:02,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:35:02,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:35:02,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:35:02,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:35:02,224 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:35:02,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 23:35:02,296 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0766415c/09736bf8c1a74e9d8b3bb3635a94c243/FLAG3d7b4bbb0 [2018-11-18 23:35:02,718 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:35:02,719 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 23:35:02,727 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0766415c/09736bf8c1a74e9d8b3bb3635a94c243/FLAG3d7b4bbb0 [2018-11-18 23:35:03,109 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0766415c/09736bf8c1a74e9d8b3bb3635a94c243 [2018-11-18 23:35:03,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:35:03,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:35:03,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:35:03,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:35:03,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:35:03,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4508b2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03, skipping insertion in model container [2018-11-18 23:35:03,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:35:03,174 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:35:03,437 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:35:03,444 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:35:03,475 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:35:03,491 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:35:03,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03 WrapperNode [2018-11-18 23:35:03,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:35:03,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:35:03,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:35:03,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:35:03,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (1/1) ... [2018-11-18 23:35:03,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:35:03,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:35:03,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:35:03,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:35:03,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (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:35:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:35:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:35:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:35:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:35:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:35:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:35:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:35:03,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:35:04,469 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:35:04,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:35:04 BoogieIcfgContainer [2018-11-18 23:35:04,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:35:04,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:35:04,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:35:04,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:35:04,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:35:03" (1/3) ... [2018-11-18 23:35:04,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f68c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:35:04, skipping insertion in model container [2018-11-18 23:35:04,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:35:03" (2/3) ... [2018-11-18 23:35:04,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f68c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:35:04, skipping insertion in model container [2018-11-18 23:35:04,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:35:04" (3/3) ... [2018-11-18 23:35:04,480 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 23:35:04,491 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:35:04,500 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:35:04,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:35:04,551 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:35:04,552 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:35:04,552 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:35:04,552 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:35:04,553 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:35:04,553 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:35:04,553 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:35:04,553 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:35:04,554 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:35:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-18 23:35:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:35:04,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:04,584 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:35:04,586 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:04,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-11-18 23:35:04,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:04,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:04,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-18 23:35:04,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-18 23:35:04,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #164#return; {42#true} is VALID [2018-11-18 23:35:04,846 INFO L256 TraceCheckUtils]: 3: Hoare triple {42#true} call #t~ret9 := main(); {42#true} is VALID [2018-11-18 23:35:04,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {42#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {42#true} is VALID [2018-11-18 23:35:04,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-18 23:35:04,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {42#true} is VALID [2018-11-18 23:35:04,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {42#true} is VALID [2018-11-18 23:35:04,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} assume !(0 != ~p5~0); {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p1~0; {44#(= main_~lk1~0 1)} is VALID [2018-11-18 23:35:04,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {44#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2018-11-18 23:35:04,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-18 23:35:04,885 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:35:04,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:04,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:04,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:35:04,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:04,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:05,043 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:35:05,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:05,055 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-18 23:35:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:05,570 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-11-18 23:35:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:05,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:35:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-18 23:35:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-18 23:35:05,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-18 23:35:06,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:06,357 INFO L225 Difference]: With dead ends: 77 [2018-11-18 23:35:06,357 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 23:35:06,361 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:35:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 23:35:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-18 23:35:06,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:06,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 43 states. [2018-11-18 23:35:06,470 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 43 states. [2018-11-18 23:35:06,470 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 43 states. [2018-11-18 23:35:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:06,491 INFO L93 Difference]: Finished difference Result 62 states and 106 transitions. [2018-11-18 23:35:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 106 transitions. [2018-11-18 23:35:06,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:06,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:06,493 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 62 states. [2018-11-18 23:35:06,493 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 62 states. [2018-11-18 23:35:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:06,505 INFO L93 Difference]: Finished difference Result 62 states and 106 transitions. [2018-11-18 23:35:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 106 transitions. [2018-11-18 23:35:06,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:06,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:06,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:06,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 23:35:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-11-18 23:35:06,513 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-11-18 23:35:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:06,513 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-11-18 23:35:06,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-11-18 23:35:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:35:06,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:06,515 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:35:06,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:06,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:06,516 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-11-18 23:35:06,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:06,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:06,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-18 23:35:06,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-18 23:35:06,649 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #164#return; {309#true} is VALID [2018-11-18 23:35:06,649 INFO L256 TraceCheckUtils]: 3: Hoare triple {309#true} call #t~ret9 := main(); {309#true} is VALID [2018-11-18 23:35:06,649 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {309#true} is VALID [2018-11-18 23:35:06,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-18 23:35:06,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {309#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {309#true} is VALID [2018-11-18 23:35:06,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {309#true} is VALID [2018-11-18 23:35:06,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {309#true} assume !(0 != ~p1~0); {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {311#(= main_~p1~0 0)} assume !(0 != ~p5~0); {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {311#(= main_~p1~0 0)} is VALID [2018-11-18 23:35:06,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {311#(= main_~p1~0 0)} assume 0 != ~p1~0; {310#false} is VALID [2018-11-18 23:35:06,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {310#false} assume 1 != ~lk1~0; {310#false} is VALID [2018-11-18 23:35:06,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-18 23:35:06,752 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:35:06,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:06,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:06,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:35:06,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:06,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:06,800 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:35:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:06,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:06,802 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-11-18 23:35:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:07,085 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-11-18 23:35:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:07,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:35:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-18 23:35:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-18 23:35:07,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-18 23:35:07,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:07,398 INFO L225 Difference]: With dead ends: 100 [2018-11-18 23:35:07,398 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 23:35:07,400 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:35:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 23:35:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-18 23:35:07,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:07,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-18 23:35:07,453 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-18 23:35:07,453 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-18 23:35:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:07,458 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2018-11-18 23:35:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2018-11-18 23:35:07,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:07,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:07,460 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-18 23:35:07,460 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-18 23:35:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:07,465 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2018-11-18 23:35:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2018-11-18 23:35:07,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:07,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:07,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:07,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 23:35:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-11-18 23:35:07,471 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-11-18 23:35:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:07,471 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-11-18 23:35:07,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-11-18 23:35:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:35:07,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:07,473 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:35:07,473 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:07,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-11-18 23:35:07,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:07,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:07,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2018-11-18 23:35:07,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2018-11-18 23:35:07,563 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #164#return; {615#true} is VALID [2018-11-18 23:35:07,563 INFO L256 TraceCheckUtils]: 3: Hoare triple {615#true} call #t~ret9 := main(); {615#true} is VALID [2018-11-18 23:35:07,563 INFO L273 TraceCheckUtils]: 4: Hoare triple {615#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {615#true} is VALID [2018-11-18 23:35:07,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {615#true} assume true; {615#true} is VALID [2018-11-18 23:35:07,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {615#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {615#true} is VALID [2018-11-18 23:35:07,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {615#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {615#true} is VALID [2018-11-18 23:35:07,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {615#true} assume 0 != ~p1~0;~lk1~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {617#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {617#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {617#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {617#(not (= main_~p1~0 0))} assume !(0 != ~p5~0); {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {617#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {617#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {617#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {617#(not (= main_~p1~0 0))} is VALID [2018-11-18 23:35:07,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {617#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {616#false} is VALID [2018-11-18 23:35:07,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {616#false} assume 0 != ~p2~0; {616#false} is VALID [2018-11-18 23:35:07,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {616#false} assume 1 != ~lk2~0; {616#false} is VALID [2018-11-18 23:35:07,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {616#false} assume !false; {616#false} is VALID [2018-11-18 23:35:07,580 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:35:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:07,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:35:07,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:07,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:07,645 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:35:07,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:07,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:07,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:07,646 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-11-18 23:35:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:07,812 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-11-18 23:35:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:07,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:35:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-18 23:35:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-18 23:35:07,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-18 23:35:08,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:08,043 INFO L225 Difference]: With dead ends: 94 [2018-11-18 23:35:08,044 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 23:35:08,044 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:35:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 23:35:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-18 23:35:08,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:08,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-18 23:35:08,064 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-18 23:35:08,065 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-18 23:35:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:08,068 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2018-11-18 23:35:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 107 transitions. [2018-11-18 23:35:08,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:08,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:08,070 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-18 23:35:08,070 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-18 23:35:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:08,074 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2018-11-18 23:35:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 107 transitions. [2018-11-18 23:35:08,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:08,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:08,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:08,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 23:35:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-11-18 23:35:08,080 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-11-18 23:35:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:08,081 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-11-18 23:35:08,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-18 23:35:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:35:08,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:08,082 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:35:08,082 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:08,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-11-18 23:35:08,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:08,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:08,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:08,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2018-11-18 23:35:08,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {929#true} assume true; {929#true} is VALID [2018-11-18 23:35:08,170 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {929#true} {929#true} #164#return; {929#true} is VALID [2018-11-18 23:35:08,170 INFO L256 TraceCheckUtils]: 3: Hoare triple {929#true} call #t~ret9 := main(); {929#true} is VALID [2018-11-18 23:35:08,171 INFO L273 TraceCheckUtils]: 4: Hoare triple {929#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {929#true} is VALID [2018-11-18 23:35:08,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {929#true} assume true; {929#true} is VALID [2018-11-18 23:35:08,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {929#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {929#true} is VALID [2018-11-18 23:35:08,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {929#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {929#true} is VALID [2018-11-18 23:35:08,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#true} assume !(0 != ~p1~0); {929#true} is VALID [2018-11-18 23:35:08,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {929#true} assume 0 != ~p2~0;~lk2~0 := 1; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {931#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {931#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(= main_~lk2~0 1)} assume !(0 != ~p5~0); {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {931#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {931#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {931#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#(= main_~lk2~0 1)} assume 0 != ~p2~0; {931#(= main_~lk2~0 1)} is VALID [2018-11-18 23:35:08,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {931#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {930#false} is VALID [2018-11-18 23:35:08,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {930#false} assume !false; {930#false} is VALID [2018-11-18 23:35:08,184 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:35:08,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:08,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:35:08,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:08,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:08,221 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:35:08,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:08,222 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-11-18 23:35:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:08,382 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-11-18 23:35:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:08,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:35:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-18 23:35:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-18 23:35:08,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-18 23:35:08,619 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:35:08,623 INFO L225 Difference]: With dead ends: 117 [2018-11-18 23:35:08,623 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 23:35:08,623 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:35:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 23:35:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-11-18 23:35:08,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:08,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 83 states. [2018-11-18 23:35:08,650 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 83 states. [2018-11-18 23:35:08,651 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 83 states. [2018-11-18 23:35:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:08,656 INFO L93 Difference]: Finished difference Result 115 states and 194 transitions. [2018-11-18 23:35:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 194 transitions. [2018-11-18 23:35:08,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:08,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:08,658 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 115 states. [2018-11-18 23:35:08,658 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 115 states. [2018-11-18 23:35:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:08,664 INFO L93 Difference]: Finished difference Result 115 states and 194 transitions. [2018-11-18 23:35:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 194 transitions. [2018-11-18 23:35:08,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:08,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:08,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:08,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 23:35:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-11-18 23:35:08,675 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-11-18 23:35:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:08,676 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-11-18 23:35:08,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-11-18 23:35:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:35:08,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:08,680 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:35:08,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:08,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-11-18 23:35:08,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:08,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:08,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:08,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:08,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {1384#true} call ULTIMATE.init(); {1384#true} is VALID [2018-11-18 23:35:08,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {1384#true} assume true; {1384#true} is VALID [2018-11-18 23:35:08,742 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1384#true} {1384#true} #164#return; {1384#true} is VALID [2018-11-18 23:35:08,742 INFO L256 TraceCheckUtils]: 3: Hoare triple {1384#true} call #t~ret9 := main(); {1384#true} is VALID [2018-11-18 23:35:08,742 INFO L273 TraceCheckUtils]: 4: Hoare triple {1384#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1384#true} is VALID [2018-11-18 23:35:08,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {1384#true} assume true; {1384#true} is VALID [2018-11-18 23:35:08,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {1384#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1384#true} is VALID [2018-11-18 23:35:08,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {1384#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1384#true} is VALID [2018-11-18 23:35:08,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {1384#true} assume !(0 != ~p1~0); {1384#true} is VALID [2018-11-18 23:35:08,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {1384#true} assume !(0 != ~p2~0); {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {1386#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {1386#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {1386#(= main_~p2~0 0)} assume !(0 != ~p5~0); {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {1386#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {1386#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {1386#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1386#(= main_~p2~0 0)} is VALID [2018-11-18 23:35:08,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#(= main_~p2~0 0)} assume 0 != ~p2~0; {1385#false} is VALID [2018-11-18 23:35:08,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {1385#false} assume 1 != ~lk2~0; {1385#false} is VALID [2018-11-18 23:35:08,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2018-11-18 23:35:08,756 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:35:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:08,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:35:08,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:08,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:08,792 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:35:08,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:08,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:08,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:08,794 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-11-18 23:35:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:08,965 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-11-18 23:35:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:08,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:35:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-18 23:35:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-18 23:35:08,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-18 23:35:09,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:09,181 INFO L225 Difference]: With dead ends: 191 [2018-11-18 23:35:09,181 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 23:35:09,183 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:35:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 23:35:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-18 23:35:09,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:09,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-18 23:35:09,327 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-18 23:35:09,327 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-18 23:35:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:09,332 INFO L93 Difference]: Finished difference Result 117 states and 192 transitions. [2018-11-18 23:35:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 192 transitions. [2018-11-18 23:35:09,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:09,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:09,333 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-18 23:35:09,333 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-18 23:35:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:09,338 INFO L93 Difference]: Finished difference Result 117 states and 192 transitions. [2018-11-18 23:35:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 192 transitions. [2018-11-18 23:35:09,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:09,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:09,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:09,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 23:35:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-11-18 23:35:09,345 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-11-18 23:35:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:09,345 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-11-18 23:35:09,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-11-18 23:35:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:35:09,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:09,347 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, 1] [2018-11-18 23:35:09,347 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:09,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-11-18 23:35:09,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:09,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:09,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:09,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:09,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:09,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {1953#true} call ULTIMATE.init(); {1953#true} is VALID [2018-11-18 23:35:09,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {1953#true} assume true; {1953#true} is VALID [2018-11-18 23:35:09,424 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1953#true} {1953#true} #164#return; {1953#true} is VALID [2018-11-18 23:35:09,424 INFO L256 TraceCheckUtils]: 3: Hoare triple {1953#true} call #t~ret9 := main(); {1953#true} is VALID [2018-11-18 23:35:09,425 INFO L273 TraceCheckUtils]: 4: Hoare triple {1953#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1953#true} is VALID [2018-11-18 23:35:09,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {1953#true} assume true; {1953#true} is VALID [2018-11-18 23:35:09,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {1953#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1953#true} is VALID [2018-11-18 23:35:09,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {1953#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1953#true} is VALID [2018-11-18 23:35:09,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {1953#true} assume !(0 != ~p1~0); {1953#true} is VALID [2018-11-18 23:35:09,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {1953#true} assume 0 != ~p2~0;~lk2~0 := 1; {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {1955#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {1955#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {1955#(not (= main_~p2~0 0))} assume !(0 != ~p5~0); {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {1955#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {1955#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {1955#(not (= main_~p2~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {1955#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {1955#(not (= main_~p2~0 0))} is VALID [2018-11-18 23:35:09,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {1955#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {1954#false} is VALID [2018-11-18 23:35:09,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {1954#false} assume 0 != ~p3~0; {1954#false} is VALID [2018-11-18 23:35:09,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {1954#false} assume 1 != ~lk3~0; {1954#false} is VALID [2018-11-18 23:35:09,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {1954#false} assume !false; {1954#false} is VALID [2018-11-18 23:35:09,439 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:35:09,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:09,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:09,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:35:09,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:09,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:09,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:09,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:09,469 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-11-18 23:35:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:09,616 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-11-18 23:35:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:09,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:35:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-18 23:35:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-18 23:35:09,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-18 23:35:09,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:09,847 INFO L225 Difference]: With dead ends: 172 [2018-11-18 23:35:09,847 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 23:35:09,848 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:35:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 23:35:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-18 23:35:09,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:09,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-18 23:35:09,872 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-18 23:35:09,872 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-18 23:35:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:09,877 INFO L93 Difference]: Finished difference Result 119 states and 192 transitions. [2018-11-18 23:35:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2018-11-18 23:35:09,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:09,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:09,878 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-18 23:35:09,878 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-18 23:35:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:09,883 INFO L93 Difference]: Finished difference Result 119 states and 192 transitions. [2018-11-18 23:35:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2018-11-18 23:35:09,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:09,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:09,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:09,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 23:35:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-11-18 23:35:09,889 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-11-18 23:35:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:09,890 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-11-18 23:35:09,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-11-18 23:35:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:35:09,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:09,891 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, 1] [2018-11-18 23:35:09,891 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:09,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-11-18 23:35:09,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:09,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:09,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2018-11-18 23:35:09,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2018-11-18 23:35:09,965 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #164#return; {2509#true} is VALID [2018-11-18 23:35:09,965 INFO L256 TraceCheckUtils]: 3: Hoare triple {2509#true} call #t~ret9 := main(); {2509#true} is VALID [2018-11-18 23:35:09,966 INFO L273 TraceCheckUtils]: 4: Hoare triple {2509#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {2509#true} is VALID [2018-11-18 23:35:09,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {2509#true} assume true; {2509#true} is VALID [2018-11-18 23:35:09,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {2509#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {2509#true} is VALID [2018-11-18 23:35:09,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {2509#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2509#true} is VALID [2018-11-18 23:35:09,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {2509#true} assume !(0 != ~p1~0); {2509#true} is VALID [2018-11-18 23:35:09,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {2509#true} assume !(0 != ~p2~0); {2509#true} is VALID [2018-11-18 23:35:09,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {2509#true} assume 0 != ~p3~0;~lk3~0 := 1; {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {2511#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {2511#(= main_~lk3~0 1)} assume !(0 != ~p5~0); {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {2511#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {2511#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {2511#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {2511#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {2511#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {2511#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2511#(= main_~lk3~0 1)} is VALID [2018-11-18 23:35:09,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {2511#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2510#false} is VALID [2018-11-18 23:35:09,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2018-11-18 23:35:09,988 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:35:09,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:09,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:09,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:35:09,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:09,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:10,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:10,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:10,017 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-11-18 23:35:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:10,342 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-11-18 23:35:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:10,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:35:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2018-11-18 23:35:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2018-11-18 23:35:10,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 100 transitions. [2018-11-18 23:35:10,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:10,783 INFO L225 Difference]: With dead ends: 213 [2018-11-18 23:35:10,784 INFO L226 Difference]: Without dead ends: 211 [2018-11-18 23:35:10,784 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:35:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-18 23:35:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-11-18 23:35:10,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:10,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 157 states. [2018-11-18 23:35:10,834 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 157 states. [2018-11-18 23:35:10,834 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 157 states. [2018-11-18 23:35:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:10,842 INFO L93 Difference]: Finished difference Result 211 states and 348 transitions. [2018-11-18 23:35:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 348 transitions. [2018-11-18 23:35:10,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:10,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:10,844 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 211 states. [2018-11-18 23:35:10,844 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 211 states. [2018-11-18 23:35:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:10,853 INFO L93 Difference]: Finished difference Result 211 states and 348 transitions. [2018-11-18 23:35:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 348 transitions. [2018-11-18 23:35:10,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:10,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:10,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:10,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 23:35:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-11-18 23:35:10,861 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-11-18 23:35:10,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:10,861 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-11-18 23:35:10,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-11-18 23:35:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:35:10,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:10,863 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, 1] [2018-11-18 23:35:10,863 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:10,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-11-18 23:35:10,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:10,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:10,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:11,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {3332#true} call ULTIMATE.init(); {3332#true} is VALID [2018-11-18 23:35:11,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {3332#true} assume true; {3332#true} is VALID [2018-11-18 23:35:11,113 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3332#true} {3332#true} #164#return; {3332#true} is VALID [2018-11-18 23:35:11,113 INFO L256 TraceCheckUtils]: 3: Hoare triple {3332#true} call #t~ret9 := main(); {3332#true} is VALID [2018-11-18 23:35:11,114 INFO L273 TraceCheckUtils]: 4: Hoare triple {3332#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {3332#true} is VALID [2018-11-18 23:35:11,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {3332#true} assume true; {3332#true} is VALID [2018-11-18 23:35:11,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {3332#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {3332#true} is VALID [2018-11-18 23:35:11,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {3332#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {3332#true} is VALID [2018-11-18 23:35:11,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {3332#true} assume !(0 != ~p1~0); {3332#true} is VALID [2018-11-18 23:35:11,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {3332#true} assume !(0 != ~p2~0); {3332#true} is VALID [2018-11-18 23:35:11,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {3332#true} assume !(0 != ~p3~0); {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {3334#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {3334#(= main_~p3~0 0)} assume !(0 != ~p5~0); {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {3334#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {3334#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {3334#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {3334#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {3334#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3334#(= main_~p3~0 0)} is VALID [2018-11-18 23:35:11,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {3334#(= main_~p3~0 0)} assume 0 != ~p3~0; {3333#false} is VALID [2018-11-18 23:35:11,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {3333#false} assume 1 != ~lk3~0; {3333#false} is VALID [2018-11-18 23:35:11,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {3333#false} assume !false; {3333#false} is VALID [2018-11-18 23:35:11,232 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:35:11,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:11,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:35:11,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:11,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:11,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:11,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:11,314 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-11-18 23:35:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:11,637 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-11-18 23:35:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:11,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:35:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-18 23:35:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-18 23:35:11,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-18 23:35:11,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:11,850 INFO L225 Difference]: With dead ends: 365 [2018-11-18 23:35:11,850 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 23:35:11,851 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:35:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 23:35:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-18 23:35:11,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:11,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 217 states. [2018-11-18 23:35:11,914 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 217 states. [2018-11-18 23:35:11,915 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 217 states. [2018-11-18 23:35:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:11,924 INFO L93 Difference]: Finished difference Result 219 states and 348 transitions. [2018-11-18 23:35:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2018-11-18 23:35:11,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:11,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:11,925 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 219 states. [2018-11-18 23:35:11,925 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 219 states. [2018-11-18 23:35:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:11,931 INFO L93 Difference]: Finished difference Result 219 states and 348 transitions. [2018-11-18 23:35:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2018-11-18 23:35:11,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:11,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:11,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:11,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 23:35:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-11-18 23:35:11,938 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-11-18 23:35:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:11,938 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-11-18 23:35:11,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-11-18 23:35:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 23:35:11,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:11,939 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, 1, 1] [2018-11-18 23:35:11,939 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:11,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-11-18 23:35:11,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:12,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {4391#true} call ULTIMATE.init(); {4391#true} is VALID [2018-11-18 23:35:12,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {4391#true} assume true; {4391#true} is VALID [2018-11-18 23:35:12,003 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4391#true} {4391#true} #164#return; {4391#true} is VALID [2018-11-18 23:35:12,003 INFO L256 TraceCheckUtils]: 3: Hoare triple {4391#true} call #t~ret9 := main(); {4391#true} is VALID [2018-11-18 23:35:12,004 INFO L273 TraceCheckUtils]: 4: Hoare triple {4391#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {4391#true} is VALID [2018-11-18 23:35:12,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {4391#true} assume true; {4391#true} is VALID [2018-11-18 23:35:12,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {4391#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {4391#true} is VALID [2018-11-18 23:35:12,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {4391#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4391#true} is VALID [2018-11-18 23:35:12,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {4391#true} assume !(0 != ~p1~0); {4391#true} is VALID [2018-11-18 23:35:12,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {4391#true} assume !(0 != ~p2~0); {4391#true} is VALID [2018-11-18 23:35:12,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {4391#true} assume 0 != ~p3~0;~lk3~0 := 1; {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {4393#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {4393#(not (= main_~p3~0 0))} assume !(0 != ~p5~0); {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {4393#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {4393#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {4393#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {4393#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {4393#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4393#(not (= main_~p3~0 0))} is VALID [2018-11-18 23:35:12,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {4393#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4392#false} is VALID [2018-11-18 23:35:12,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {4392#false} assume 0 != ~p4~0; {4392#false} is VALID [2018-11-18 23:35:12,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {4392#false} assume 1 != ~lk4~0; {4392#false} is VALID [2018-11-18 23:35:12,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {4392#false} assume !false; {4392#false} is VALID [2018-11-18 23:35:12,017 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:35:12,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:12,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:12,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:35:12,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:12,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:12,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:12,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:12,045 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-11-18 23:35:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:12,371 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-18 23:35:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:12,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:35:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-18 23:35:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-18 23:35:12,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-18 23:35:13,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:13,044 INFO L225 Difference]: With dead ends: 325 [2018-11-18 23:35:13,044 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 23:35:13,045 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:35:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 23:35:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-18 23:35:13,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:13,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand 221 states. [2018-11-18 23:35:13,096 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 221 states. [2018-11-18 23:35:13,097 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 221 states. [2018-11-18 23:35:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:13,103 INFO L93 Difference]: Finished difference Result 223 states and 348 transitions. [2018-11-18 23:35:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 348 transitions. [2018-11-18 23:35:13,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:13,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:13,105 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 223 states. [2018-11-18 23:35:13,105 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 223 states. [2018-11-18 23:35:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:13,112 INFO L93 Difference]: Finished difference Result 223 states and 348 transitions. [2018-11-18 23:35:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 348 transitions. [2018-11-18 23:35:13,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:13,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:13,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:13,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 23:35:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-11-18 23:35:13,120 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-11-18 23:35:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:13,120 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-11-18 23:35:13,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-11-18 23:35:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 23:35:13,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:13,122 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, 1, 1] [2018-11-18 23:35:13,122 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:13,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-11-18 23:35:13,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:13,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:13,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:13,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {5422#true} call ULTIMATE.init(); {5422#true} is VALID [2018-11-18 23:35:13,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {5422#true} assume true; {5422#true} is VALID [2018-11-18 23:35:13,384 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5422#true} {5422#true} #164#return; {5422#true} is VALID [2018-11-18 23:35:13,384 INFO L256 TraceCheckUtils]: 3: Hoare triple {5422#true} call #t~ret9 := main(); {5422#true} is VALID [2018-11-18 23:35:13,385 INFO L273 TraceCheckUtils]: 4: Hoare triple {5422#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {5422#true} is VALID [2018-11-18 23:35:13,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {5422#true} assume true; {5422#true} is VALID [2018-11-18 23:35:13,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {5422#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {5422#true} is VALID [2018-11-18 23:35:13,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {5422#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {5422#true} is VALID [2018-11-18 23:35:13,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {5422#true} assume !(0 != ~p1~0); {5422#true} is VALID [2018-11-18 23:35:13,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {5422#true} assume !(0 != ~p2~0); {5422#true} is VALID [2018-11-18 23:35:13,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {5422#true} assume !(0 != ~p3~0); {5422#true} is VALID [2018-11-18 23:35:13,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {5422#true} assume 0 != ~p4~0;~lk4~0 := 1; {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {5424#(= main_~lk4~0 1)} assume !(0 != ~p5~0); {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {5424#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {5424#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {5424#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {5424#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {5424#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {5424#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {5424#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5424#(= main_~lk4~0 1)} is VALID [2018-11-18 23:35:13,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {5424#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5423#false} is VALID [2018-11-18 23:35:13,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {5423#false} assume !false; {5423#false} is VALID [2018-11-18 23:35:13,511 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:35:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:13,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:35:13,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:13,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:13,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:13,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:13,655 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-11-18 23:35:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:13,989 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-11-18 23:35:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:13,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:35:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-18 23:35:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-18 23:35:13,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-18 23:35:14,198 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:35:14,209 INFO L225 Difference]: With dead ends: 397 [2018-11-18 23:35:14,209 INFO L226 Difference]: Without dead ends: 395 [2018-11-18 23:35:14,210 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:35:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-18 23:35:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-11-18 23:35:14,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:14,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand 305 states. [2018-11-18 23:35:14,270 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand 305 states. [2018-11-18 23:35:14,270 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 305 states. [2018-11-18 23:35:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:14,285 INFO L93 Difference]: Finished difference Result 395 states and 624 transitions. [2018-11-18 23:35:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2018-11-18 23:35:14,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:14,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:14,287 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 395 states. [2018-11-18 23:35:14,287 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 395 states. [2018-11-18 23:35:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:14,297 INFO L93 Difference]: Finished difference Result 395 states and 624 transitions. [2018-11-18 23:35:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2018-11-18 23:35:14,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:14,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:14,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:14,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-18 23:35:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-11-18 23:35:14,305 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-11-18 23:35:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:14,305 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-11-18 23:35:14,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-11-18 23:35:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 23:35:14,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:14,306 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, 1, 1] [2018-11-18 23:35:14,307 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:14,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-11-18 23:35:14,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:14,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:14,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {6957#true} call ULTIMATE.init(); {6957#true} is VALID [2018-11-18 23:35:14,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {6957#true} assume true; {6957#true} is VALID [2018-11-18 23:35:14,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6957#true} {6957#true} #164#return; {6957#true} is VALID [2018-11-18 23:35:14,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {6957#true} call #t~ret9 := main(); {6957#true} is VALID [2018-11-18 23:35:14,536 INFO L273 TraceCheckUtils]: 4: Hoare triple {6957#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {6957#true} is VALID [2018-11-18 23:35:14,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {6957#true} assume true; {6957#true} is VALID [2018-11-18 23:35:14,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {6957#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {6957#true} is VALID [2018-11-18 23:35:14,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {6957#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {6957#true} is VALID [2018-11-18 23:35:14,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {6957#true} assume !(0 != ~p1~0); {6957#true} is VALID [2018-11-18 23:35:14,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {6957#true} assume !(0 != ~p2~0); {6957#true} is VALID [2018-11-18 23:35:14,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {6957#true} assume !(0 != ~p3~0); {6957#true} is VALID [2018-11-18 23:35:14,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {6957#true} assume !(0 != ~p4~0); {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {6959#(= main_~p4~0 0)} assume !(0 != ~p5~0); {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {6959#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {6959#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {6959#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {6959#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {6959#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {6959#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6959#(= main_~p4~0 0)} is VALID [2018-11-18 23:35:14,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {6959#(= main_~p4~0 0)} assume 0 != ~p4~0; {6958#false} is VALID [2018-11-18 23:35:14,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {6958#false} assume 1 != ~lk4~0; {6958#false} is VALID [2018-11-18 23:35:14,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {6958#false} assume !false; {6958#false} is VALID [2018-11-18 23:35:14,609 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:35:14,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:14,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:35:14,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:14,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:14,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:14,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:14,657 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-11-18 23:35:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:15,112 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-11-18 23:35:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:15,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 23:35:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-18 23:35:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-18 23:35:15,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-18 23:35:15,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:15,602 INFO L225 Difference]: With dead ends: 709 [2018-11-18 23:35:15,602 INFO L226 Difference]: Without dead ends: 419 [2018-11-18 23:35:15,603 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:35:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-18 23:35:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-11-18 23:35:16,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:16,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand 417 states. [2018-11-18 23:35:16,193 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand 417 states. [2018-11-18 23:35:16,193 INFO L87 Difference]: Start difference. First operand 419 states. Second operand 417 states. [2018-11-18 23:35:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:16,204 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2018-11-18 23:35:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-11-18 23:35:16,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:16,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:16,205 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand 419 states. [2018-11-18 23:35:16,205 INFO L87 Difference]: Start difference. First operand 417 states. Second operand 419 states. [2018-11-18 23:35:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:16,216 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2018-11-18 23:35:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-11-18 23:35:16,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:16,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:16,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:16,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 23:35:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-11-18 23:35:16,227 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-11-18 23:35:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:16,227 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-11-18 23:35:16,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-11-18 23:35:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:35:16,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:16,228 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, 1, 1, 1] [2018-11-18 23:35:16,228 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:16,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-11-18 23:35:16,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:16,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:16,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:16,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {8980#true} call ULTIMATE.init(); {8980#true} is VALID [2018-11-18 23:35:16,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {8980#true} assume true; {8980#true} is VALID [2018-11-18 23:35:16,287 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8980#true} {8980#true} #164#return; {8980#true} is VALID [2018-11-18 23:35:16,288 INFO L256 TraceCheckUtils]: 3: Hoare triple {8980#true} call #t~ret9 := main(); {8980#true} is VALID [2018-11-18 23:35:16,288 INFO L273 TraceCheckUtils]: 4: Hoare triple {8980#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {8980#true} is VALID [2018-11-18 23:35:16,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {8980#true} assume true; {8980#true} is VALID [2018-11-18 23:35:16,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {8980#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {8980#true} is VALID [2018-11-18 23:35:16,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {8980#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {8980#true} is VALID [2018-11-18 23:35:16,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {8980#true} assume !(0 != ~p1~0); {8980#true} is VALID [2018-11-18 23:35:16,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {8980#true} assume !(0 != ~p2~0); {8980#true} is VALID [2018-11-18 23:35:16,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {8980#true} assume !(0 != ~p3~0); {8980#true} is VALID [2018-11-18 23:35:16,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {8980#true} assume 0 != ~p4~0;~lk4~0 := 1; {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {8982#(not (= main_~p4~0 0))} assume !(0 != ~p5~0); {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {8982#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {8982#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {8982#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {8982#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {8982#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {8982#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8982#(not (= main_~p4~0 0))} is VALID [2018-11-18 23:35:16,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {8982#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8981#false} is VALID [2018-11-18 23:35:16,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {8981#false} assume 0 != ~p5~0; {8981#false} is VALID [2018-11-18 23:35:16,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {8981#false} assume 1 != ~lk5~0; {8981#false} is VALID [2018-11-18 23:35:16,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {8981#false} assume !false; {8981#false} is VALID [2018-11-18 23:35:16,342 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:35:16,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:16,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:16,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:35:16,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:16,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:16,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:16,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:16,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:16,405 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-11-18 23:35:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:16,740 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-11-18 23:35:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:16,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:35:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-18 23:35:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-18 23:35:16,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-18 23:35:17,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:17,162 INFO L225 Difference]: With dead ends: 625 [2018-11-18 23:35:17,162 INFO L226 Difference]: Without dead ends: 427 [2018-11-18 23:35:17,163 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:35:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-18 23:35:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-11-18 23:35:17,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:17,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand 425 states. [2018-11-18 23:35:17,257 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand 425 states. [2018-11-18 23:35:17,257 INFO L87 Difference]: Start difference. First operand 427 states. Second operand 425 states. [2018-11-18 23:35:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:17,267 INFO L93 Difference]: Finished difference Result 427 states and 632 transitions. [2018-11-18 23:35:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 632 transitions. [2018-11-18 23:35:17,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:17,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:17,268 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand 427 states. [2018-11-18 23:35:17,268 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 427 states. [2018-11-18 23:35:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:17,280 INFO L93 Difference]: Finished difference Result 427 states and 632 transitions. [2018-11-18 23:35:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 632 transitions. [2018-11-18 23:35:17,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:17,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:17,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:17,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-18 23:35:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-11-18 23:35:17,294 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-11-18 23:35:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:17,294 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-11-18 23:35:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-11-18 23:35:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:35:17,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:17,295 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, 1, 1, 1] [2018-11-18 23:35:17,296 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-11-18 23:35:17,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:17,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:17,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {10943#true} call ULTIMATE.init(); {10943#true} is VALID [2018-11-18 23:35:17,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {10943#true} assume true; {10943#true} is VALID [2018-11-18 23:35:17,345 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10943#true} {10943#true} #164#return; {10943#true} is VALID [2018-11-18 23:35:17,346 INFO L256 TraceCheckUtils]: 3: Hoare triple {10943#true} call #t~ret9 := main(); {10943#true} is VALID [2018-11-18 23:35:17,346 INFO L273 TraceCheckUtils]: 4: Hoare triple {10943#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {10943#true} is VALID [2018-11-18 23:35:17,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {10943#true} assume true; {10943#true} is VALID [2018-11-18 23:35:17,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {10943#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {10943#true} is VALID [2018-11-18 23:35:17,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {10943#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {10943#true} is VALID [2018-11-18 23:35:17,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {10943#true} assume !(0 != ~p1~0); {10943#true} is VALID [2018-11-18 23:35:17,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {10943#true} assume !(0 != ~p2~0); {10943#true} is VALID [2018-11-18 23:35:17,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {10943#true} assume !(0 != ~p3~0); {10943#true} is VALID [2018-11-18 23:35:17,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {10943#true} assume !(0 != ~p4~0); {10943#true} is VALID [2018-11-18 23:35:17,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {10943#true} assume !(0 != ~p5~0); {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {10945#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {10945#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {10945#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {10945#(= main_~p5~0 0)} assume !(0 != ~p1~0); {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {10945#(= main_~p5~0 0)} assume !(0 != ~p2~0); {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {10945#(= main_~p5~0 0)} assume !(0 != ~p3~0); {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {10945#(= main_~p5~0 0)} assume !(0 != ~p4~0); {10945#(= main_~p5~0 0)} is VALID [2018-11-18 23:35:17,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {10945#(= main_~p5~0 0)} assume 0 != ~p5~0; {10944#false} is VALID [2018-11-18 23:35:17,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {10944#false} assume 1 != ~lk5~0; {10944#false} is VALID [2018-11-18 23:35:17,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {10944#false} assume !false; {10944#false} is VALID [2018-11-18 23:35:17,358 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:35:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:17,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:35:17,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:17,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:17,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:17,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:17,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:17,388 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-11-18 23:35:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:17,721 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-11-18 23:35:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:17,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:35:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-18 23:35:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-18 23:35:17,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-18 23:35:17,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:17,891 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 23:35:17,892 INFO L226 Difference]: Without dead ends: 811 [2018-11-18 23:35:17,892 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:35:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-18 23:35:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-11-18 23:35:18,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:18,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand 809 states. [2018-11-18 23:35:18,125 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand 809 states. [2018-11-18 23:35:18,125 INFO L87 Difference]: Start difference. First operand 811 states. Second operand 809 states. [2018-11-18 23:35:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:18,153 INFO L93 Difference]: Finished difference Result 811 states and 1160 transitions. [2018-11-18 23:35:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1160 transitions. [2018-11-18 23:35:18,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:18,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:18,155 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand 811 states. [2018-11-18 23:35:18,155 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 811 states. [2018-11-18 23:35:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:18,191 INFO L93 Difference]: Finished difference Result 811 states and 1160 transitions. [2018-11-18 23:35:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1160 transitions. [2018-11-18 23:35:18,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:18,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:18,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:18,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 23:35:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-11-18 23:35:18,230 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-11-18 23:35:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:18,230 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-11-18 23:35:18,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-11-18 23:35:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:35:18,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:18,232 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, 1, 1, 1] [2018-11-18 23:35:18,232 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:18,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-11-18 23:35:18,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:18,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:18,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:18,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:18,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:18,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {14686#true} call ULTIMATE.init(); {14686#true} is VALID [2018-11-18 23:35:18,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {14686#true} assume true; {14686#true} is VALID [2018-11-18 23:35:18,345 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14686#true} {14686#true} #164#return; {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L256 TraceCheckUtils]: 3: Hoare triple {14686#true} call #t~ret9 := main(); {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L273 TraceCheckUtils]: 4: Hoare triple {14686#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {14686#true} assume true; {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {14686#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {14686#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {14686#true} assume !(0 != ~p1~0); {14686#true} is VALID [2018-11-18 23:35:18,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {14686#true} assume !(0 != ~p2~0); {14686#true} is VALID [2018-11-18 23:35:18,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {14686#true} assume !(0 != ~p3~0); {14686#true} is VALID [2018-11-18 23:35:18,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {14686#true} assume !(0 != ~p4~0); {14686#true} is VALID [2018-11-18 23:35:18,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {14686#true} assume 0 != ~p5~0;~lk5~0 := 1; {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {14688#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {14688#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {14688#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {14688#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {14688#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {14688#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {14688#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {14688#(= main_~lk5~0 1)} assume 0 != ~p5~0; {14688#(= main_~lk5~0 1)} is VALID [2018-11-18 23:35:18,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {14688#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {14687#false} is VALID [2018-11-18 23:35:18,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {14687#false} assume !false; {14687#false} is VALID [2018-11-18 23:35:18,361 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:35:18,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:18,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:18,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:35:18,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:18,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:18,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:18,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:18,411 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-11-18 23:35:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:18,847 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-11-18 23:35:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:18,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:35:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-18 23:35:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-18 23:35:18,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2018-11-18 23:35:18,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:18,975 INFO L225 Difference]: With dead ends: 957 [2018-11-18 23:35:18,976 INFO L226 Difference]: Without dead ends: 955 [2018-11-18 23:35:18,976 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:35:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-18 23:35:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-11-18 23:35:19,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:19,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 955 states. Second operand 809 states. [2018-11-18 23:35:19,324 INFO L74 IsIncluded]: Start isIncluded. First operand 955 states. Second operand 809 states. [2018-11-18 23:35:19,324 INFO L87 Difference]: Start difference. First operand 955 states. Second operand 809 states. [2018-11-18 23:35:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:19,363 INFO L93 Difference]: Finished difference Result 955 states and 1384 transitions. [2018-11-18 23:35:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1384 transitions. [2018-11-18 23:35:19,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:19,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:19,365 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand 955 states. [2018-11-18 23:35:19,365 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 955 states. [2018-11-18 23:35:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:19,411 INFO L93 Difference]: Finished difference Result 955 states and 1384 transitions. [2018-11-18 23:35:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1384 transitions. [2018-11-18 23:35:19,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:19,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:19,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:19,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 23:35:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-11-18 23:35:19,450 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-11-18 23:35:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:19,450 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-11-18 23:35:19,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-11-18 23:35:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:35:19,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:19,452 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, 1, 1, 1, 1] [2018-11-18 23:35:19,452 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:19,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:19,452 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-11-18 23:35:19,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:19,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:19,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:19,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {18461#true} call ULTIMATE.init(); {18461#true} is VALID [2018-11-18 23:35:19,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {18461#true} assume true; {18461#true} is VALID [2018-11-18 23:35:19,513 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18461#true} {18461#true} #164#return; {18461#true} is VALID [2018-11-18 23:35:19,513 INFO L256 TraceCheckUtils]: 3: Hoare triple {18461#true} call #t~ret9 := main(); {18461#true} is VALID [2018-11-18 23:35:19,514 INFO L273 TraceCheckUtils]: 4: Hoare triple {18461#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {18461#true} is VALID [2018-11-18 23:35:19,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {18461#true} assume true; {18461#true} is VALID [2018-11-18 23:35:19,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {18461#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {18461#true} is VALID [2018-11-18 23:35:19,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {18461#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {18461#true} is VALID [2018-11-18 23:35:19,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {18461#true} assume !(0 != ~p1~0); {18461#true} is VALID [2018-11-18 23:35:19,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {18461#true} assume !(0 != ~p2~0); {18461#true} is VALID [2018-11-18 23:35:19,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {18461#true} assume !(0 != ~p3~0); {18461#true} is VALID [2018-11-18 23:35:19,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {18461#true} assume !(0 != ~p4~0); {18461#true} is VALID [2018-11-18 23:35:19,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {18461#true} assume !(0 != ~p5~0); {18461#true} is VALID [2018-11-18 23:35:19,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {18461#true} assume 0 != ~p6~0;~lk6~0 := 1; {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {18463#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {18463#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {18463#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {18463#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {18463#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {18463#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {18463#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {18463#(= main_~lk6~0 1)} assume 0 != ~p6~0; {18463#(= main_~lk6~0 1)} is VALID [2018-11-18 23:35:19,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {18463#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {18462#false} is VALID [2018-11-18 23:35:19,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {18462#false} assume !false; {18462#false} is VALID [2018-11-18 23:35:19,534 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:35:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:19,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 23:35:19,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:19,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:19,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:19,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:19,562 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-11-18 23:35:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:20,741 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-11-18 23:35:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:20,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 23:35:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-18 23:35:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-18 23:35:20,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-18 23:35:20,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:20,933 INFO L225 Difference]: With dead ends: 1405 [2018-11-18 23:35:20,933 INFO L226 Difference]: Without dead ends: 1403 [2018-11-18 23:35:20,934 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:35:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-11-18 23:35:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-11-18 23:35:21,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:21,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1403 states. Second operand 1177 states. [2018-11-18 23:35:21,813 INFO L74 IsIncluded]: Start isIncluded. First operand 1403 states. Second operand 1177 states. [2018-11-18 23:35:21,814 INFO L87 Difference]: Start difference. First operand 1403 states. Second operand 1177 states. [2018-11-18 23:35:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:21,892 INFO L93 Difference]: Finished difference Result 1403 states and 1976 transitions. [2018-11-18 23:35:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1976 transitions. [2018-11-18 23:35:21,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:21,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:21,895 INFO L74 IsIncluded]: Start isIncluded. First operand 1177 states. Second operand 1403 states. [2018-11-18 23:35:21,895 INFO L87 Difference]: Start difference. First operand 1177 states. Second operand 1403 states. [2018-11-18 23:35:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:21,969 INFO L93 Difference]: Finished difference Result 1403 states and 1976 transitions. [2018-11-18 23:35:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1976 transitions. [2018-11-18 23:35:21,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:21,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:21,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:21,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-18 23:35:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-11-18 23:35:22,017 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-11-18 23:35:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:22,017 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-11-18 23:35:22,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-11-18 23:35:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:35:22,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:22,019 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, 1, 1, 1, 1] [2018-11-18 23:35:22,020 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-11-18 23:35:22,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:22,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {23964#true} call ULTIMATE.init(); {23964#true} is VALID [2018-11-18 23:35:22,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {23964#true} assume true; {23964#true} is VALID [2018-11-18 23:35:22,252 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23964#true} {23964#true} #164#return; {23964#true} is VALID [2018-11-18 23:35:22,252 INFO L256 TraceCheckUtils]: 3: Hoare triple {23964#true} call #t~ret9 := main(); {23964#true} is VALID [2018-11-18 23:35:22,252 INFO L273 TraceCheckUtils]: 4: Hoare triple {23964#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {23964#true} is VALID [2018-11-18 23:35:22,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {23964#true} assume true; {23964#true} is VALID [2018-11-18 23:35:22,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {23964#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {23964#true} is VALID [2018-11-18 23:35:22,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {23964#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {23964#true} is VALID [2018-11-18 23:35:22,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {23964#true} assume !(0 != ~p1~0); {23964#true} is VALID [2018-11-18 23:35:22,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {23964#true} assume !(0 != ~p2~0); {23964#true} is VALID [2018-11-18 23:35:22,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {23964#true} assume !(0 != ~p3~0); {23964#true} is VALID [2018-11-18 23:35:22,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {23964#true} assume !(0 != ~p4~0); {23964#true} is VALID [2018-11-18 23:35:22,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {23964#true} assume !(0 != ~p5~0); {23964#true} is VALID [2018-11-18 23:35:22,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {23964#true} assume !(0 != ~p6~0); {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {23966#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {23966#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {23966#(= main_~p6~0 0)} assume !(0 != ~p1~0); {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {23966#(= main_~p6~0 0)} assume !(0 != ~p2~0); {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {23966#(= main_~p6~0 0)} assume !(0 != ~p3~0); {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {23966#(= main_~p6~0 0)} assume !(0 != ~p4~0); {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {23966#(= main_~p6~0 0)} assume !(0 != ~p5~0); {23966#(= main_~p6~0 0)} is VALID [2018-11-18 23:35:22,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {23966#(= main_~p6~0 0)} assume 0 != ~p6~0; {23965#false} is VALID [2018-11-18 23:35:22,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {23965#false} assume 1 != ~lk6~0; {23965#false} is VALID [2018-11-18 23:35:22,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {23965#false} assume !false; {23965#false} is VALID [2018-11-18 23:35:22,375 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:35:22,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:22,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:22,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 23:35:22,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:22,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:22,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:22,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:22,578 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-11-18 23:35:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:23,500 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-11-18 23:35:23,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:23,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 23:35:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-18 23:35:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-18 23:35:23,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2018-11-18 23:35:23,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:23,735 INFO L225 Difference]: With dead ends: 2717 [2018-11-18 23:35:23,736 INFO L226 Difference]: Without dead ends: 1563 [2018-11-18 23:35:23,738 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:35:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-11-18 23:35:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-11-18 23:35:24,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:24,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1563 states. Second operand 1561 states. [2018-11-18 23:35:24,219 INFO L74 IsIncluded]: Start isIncluded. First operand 1563 states. Second operand 1561 states. [2018-11-18 23:35:24,219 INFO L87 Difference]: Start difference. First operand 1563 states. Second operand 1561 states. [2018-11-18 23:35:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:24,302 INFO L93 Difference]: Finished difference Result 1563 states and 2088 transitions. [2018-11-18 23:35:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2088 transitions. [2018-11-18 23:35:24,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:24,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:24,304 INFO L74 IsIncluded]: Start isIncluded. First operand 1561 states. Second operand 1563 states. [2018-11-18 23:35:24,304 INFO L87 Difference]: Start difference. First operand 1561 states. Second operand 1563 states. [2018-11-18 23:35:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:24,412 INFO L93 Difference]: Finished difference Result 1563 states and 2088 transitions. [2018-11-18 23:35:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2088 transitions. [2018-11-18 23:35:24,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:24,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:24,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:24,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-18 23:35:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-11-18 23:35:24,505 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-11-18 23:35:24,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:24,505 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-11-18 23:35:24,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-11-18 23:35:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:35:24,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:24,506 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, 1, 1, 1, 1, 1] [2018-11-18 23:35:24,507 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:24,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-11-18 23:35:24,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:24,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:24,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {31547#true} call ULTIMATE.init(); {31547#true} is VALID [2018-11-18 23:35:24,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {31547#true} assume true; {31547#true} is VALID [2018-11-18 23:35:24,556 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31547#true} {31547#true} #164#return; {31547#true} is VALID [2018-11-18 23:35:24,556 INFO L256 TraceCheckUtils]: 3: Hoare triple {31547#true} call #t~ret9 := main(); {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 4: Hoare triple {31547#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {31547#true} assume true; {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {31547#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {31547#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {31547#true} assume !(0 != ~p1~0); {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {31547#true} assume !(0 != ~p2~0); {31547#true} is VALID [2018-11-18 23:35:24,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {31547#true} assume !(0 != ~p3~0); {31547#true} is VALID [2018-11-18 23:35:24,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {31547#true} assume !(0 != ~p4~0); {31547#true} is VALID [2018-11-18 23:35:24,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {31547#true} assume !(0 != ~p5~0); {31547#true} is VALID [2018-11-18 23:35:24,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {31547#true} assume 0 != ~p6~0;~lk6~0 := 1; {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {31549#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {31549#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {31549#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {31549#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {31549#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {31549#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {31549#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {31549#(not (= main_~p6~0 0))} is VALID [2018-11-18 23:35:24,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {31549#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {31548#false} is VALID [2018-11-18 23:35:24,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {31548#false} assume 0 != ~p7~0; {31548#false} is VALID [2018-11-18 23:35:24,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {31548#false} assume 1 != ~lk7~0; {31548#false} is VALID [2018-11-18 23:35:24,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {31548#false} assume !false; {31548#false} is VALID [2018-11-18 23:35:24,567 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:35:24,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:24,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:24,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:35:24,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:24,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:24,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:24,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:24,596 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-11-18 23:35:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:25,591 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-11-18 23:35:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:25,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:35:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-18 23:35:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-18 23:35:25,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-18 23:35:25,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:25,847 INFO L225 Difference]: With dead ends: 2365 [2018-11-18 23:35:25,847 INFO L226 Difference]: Without dead ends: 1611 [2018-11-18 23:35:25,849 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:35:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-18 23:35:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-11-18 23:35:26,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:26,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand 1609 states. [2018-11-18 23:35:26,691 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand 1609 states. [2018-11-18 23:35:26,691 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand 1609 states. [2018-11-18 23:35:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:26,776 INFO L93 Difference]: Finished difference Result 1611 states and 2120 transitions. [2018-11-18 23:35:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2120 transitions. [2018-11-18 23:35:26,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:26,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:26,778 INFO L74 IsIncluded]: Start isIncluded. First operand 1609 states. Second operand 1611 states. [2018-11-18 23:35:26,778 INFO L87 Difference]: Start difference. First operand 1609 states. Second operand 1611 states. [2018-11-18 23:35:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:26,865 INFO L93 Difference]: Finished difference Result 1611 states and 2120 transitions. [2018-11-18 23:35:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2120 transitions. [2018-11-18 23:35:26,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:26,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:26,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:26,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-18 23:35:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-11-18 23:35:26,950 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-11-18 23:35:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:26,951 INFO L480 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-11-18 23:35:26,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-11-18 23:35:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:35:26,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:26,952 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, 1, 1, 1, 1, 1] [2018-11-18 23:35:26,952 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:26,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:26,953 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-11-18 23:35:26,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:26,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:26,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:26,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:26,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:27,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {38922#true} call ULTIMATE.init(); {38922#true} is VALID [2018-11-18 23:35:27,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {38922#true} assume true; {38922#true} is VALID [2018-11-18 23:35:27,052 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38922#true} {38922#true} #164#return; {38922#true} is VALID [2018-11-18 23:35:27,052 INFO L256 TraceCheckUtils]: 3: Hoare triple {38922#true} call #t~ret9 := main(); {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 4: Hoare triple {38922#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {38922#true} assume true; {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {38922#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {38922#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {38922#true} assume !(0 != ~p1~0); {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {38922#true} assume !(0 != ~p2~0); {38922#true} is VALID [2018-11-18 23:35:27,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {38922#true} assume !(0 != ~p3~0); {38922#true} is VALID [2018-11-18 23:35:27,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {38922#true} assume !(0 != ~p4~0); {38922#true} is VALID [2018-11-18 23:35:27,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {38922#true} assume !(0 != ~p5~0); {38922#true} is VALID [2018-11-18 23:35:27,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {38922#true} assume !(0 != ~p6~0); {38922#true} is VALID [2018-11-18 23:35:27,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {38922#true} assume 0 != ~p7~0;~lk7~0 := 1; {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {38924#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {38924#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {38924#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {38924#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {38924#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {38924#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {38924#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {38924#(= main_~lk7~0 1)} assume 0 != ~p7~0; {38924#(= main_~lk7~0 1)} is VALID [2018-11-18 23:35:27,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {38924#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {38923#false} is VALID [2018-11-18 23:35:27,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {38923#false} assume !false; {38923#false} is VALID [2018-11-18 23:35:27,072 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:35:27,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:27,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:27,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:35:27,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:27,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:27,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:27,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:27,095 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-11-18 23:35:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:28,829 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-11-18 23:35:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:28,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:35:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2018-11-18 23:35:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2018-11-18 23:35:28,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2018-11-18 23:35:28,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:29,193 INFO L225 Difference]: With dead ends: 2701 [2018-11-18 23:35:29,193 INFO L226 Difference]: Without dead ends: 2699 [2018-11-18 23:35:29,194 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:35:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-11-18 23:35:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-11-18 23:35:30,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:30,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand 2377 states. [2018-11-18 23:35:30,312 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand 2377 states. [2018-11-18 23:35:30,312 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand 2377 states. [2018-11-18 23:35:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:30,572 INFO L93 Difference]: Finished difference Result 2699 states and 3496 transitions. [2018-11-18 23:35:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3496 transitions. [2018-11-18 23:35:30,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:30,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:30,576 INFO L74 IsIncluded]: Start isIncluded. First operand 2377 states. Second operand 2699 states. [2018-11-18 23:35:30,576 INFO L87 Difference]: Start difference. First operand 2377 states. Second operand 2699 states. [2018-11-18 23:35:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:30,807 INFO L93 Difference]: Finished difference Result 2699 states and 3496 transitions. [2018-11-18 23:35:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3496 transitions. [2018-11-18 23:35:30,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:30,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:30,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:30,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-18 23:35:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-11-18 23:35:31,019 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-11-18 23:35:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:31,019 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-11-18 23:35:31,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-11-18 23:35:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:35:31,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:31,022 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, 1, 1, 1, 1, 1] [2018-11-18 23:35:31,023 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:31,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-11-18 23:35:31,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:31,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:31,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:31,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {49609#true} call ULTIMATE.init(); {49609#true} is VALID [2018-11-18 23:35:31,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {49609#true} assume true; {49609#true} is VALID [2018-11-18 23:35:31,113 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {49609#true} {49609#true} #164#return; {49609#true} is VALID [2018-11-18 23:35:31,113 INFO L256 TraceCheckUtils]: 3: Hoare triple {49609#true} call #t~ret9 := main(); {49609#true} is VALID [2018-11-18 23:35:31,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {49609#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {49609#true} is VALID [2018-11-18 23:35:31,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {49609#true} assume true; {49609#true} is VALID [2018-11-18 23:35:31,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {49609#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {49609#true} is VALID [2018-11-18 23:35:31,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {49609#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {49609#true} is VALID [2018-11-18 23:35:31,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {49609#true} assume !(0 != ~p1~0); {49609#true} is VALID [2018-11-18 23:35:31,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {49609#true} assume !(0 != ~p2~0); {49609#true} is VALID [2018-11-18 23:35:31,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {49609#true} assume !(0 != ~p3~0); {49609#true} is VALID [2018-11-18 23:35:31,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {49609#true} assume !(0 != ~p4~0); {49609#true} is VALID [2018-11-18 23:35:31,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {49609#true} assume !(0 != ~p5~0); {49609#true} is VALID [2018-11-18 23:35:31,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {49609#true} assume !(0 != ~p6~0); {49609#true} is VALID [2018-11-18 23:35:31,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {49609#true} assume !(0 != ~p7~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {49611#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {49611#(= main_~p7~0 0)} assume !(0 != ~p1~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {49611#(= main_~p7~0 0)} assume !(0 != ~p2~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {49611#(= main_~p7~0 0)} assume !(0 != ~p3~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {49611#(= main_~p7~0 0)} assume !(0 != ~p4~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {49611#(= main_~p7~0 0)} assume !(0 != ~p5~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {49611#(= main_~p7~0 0)} assume !(0 != ~p6~0); {49611#(= main_~p7~0 0)} is VALID [2018-11-18 23:35:31,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {49611#(= main_~p7~0 0)} assume 0 != ~p7~0; {49610#false} is VALID [2018-11-18 23:35:31,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {49610#false} assume 1 != ~lk7~0; {49610#false} is VALID [2018-11-18 23:35:31,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {49610#false} assume !false; {49610#false} is VALID [2018-11-18 23:35:31,126 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:35:31,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:31,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:31,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:35:31,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:31,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:31,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:31,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:31,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:31,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:31,155 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-11-18 23:35:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:33,487 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-11-18 23:35:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:33,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 23:35:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-18 23:35:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-18 23:35:33,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-18 23:35:33,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:34,050 INFO L225 Difference]: With dead ends: 5389 [2018-11-18 23:35:34,050 INFO L226 Difference]: Without dead ends: 3083 [2018-11-18 23:35:34,053 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:35:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-18 23:35:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-11-18 23:35:35,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:35,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3083 states. Second operand 3081 states. [2018-11-18 23:35:35,599 INFO L74 IsIncluded]: Start isIncluded. First operand 3083 states. Second operand 3081 states. [2018-11-18 23:35:35,599 INFO L87 Difference]: Start difference. First operand 3083 states. Second operand 3081 states. [2018-11-18 23:35:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:35,955 INFO L93 Difference]: Finished difference Result 3083 states and 3784 transitions. [2018-11-18 23:35:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3784 transitions. [2018-11-18 23:35:35,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:35,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:35,958 INFO L74 IsIncluded]: Start isIncluded. First operand 3081 states. Second operand 3083 states. [2018-11-18 23:35:35,958 INFO L87 Difference]: Start difference. First operand 3081 states. Second operand 3083 states. [2018-11-18 23:35:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:36,314 INFO L93 Difference]: Finished difference Result 3083 states and 3784 transitions. [2018-11-18 23:35:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3784 transitions. [2018-11-18 23:35:36,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:36,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:36,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:36,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-11-18 23:35:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-11-18 23:35:36,714 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-11-18 23:35:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:36,715 INFO L480 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-11-18 23:35:36,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-11-18 23:35:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:35:36,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:36,717 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, 1, 1, 1, 1, 1, 1] [2018-11-18 23:35:36,717 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:36,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-11-18 23:35:36,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:36,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:36,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {64584#true} call ULTIMATE.init(); {64584#true} is VALID [2018-11-18 23:35:36,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {64584#true} assume true; {64584#true} is VALID [2018-11-18 23:35:36,865 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {64584#true} {64584#true} #164#return; {64584#true} is VALID [2018-11-18 23:35:36,865 INFO L256 TraceCheckUtils]: 3: Hoare triple {64584#true} call #t~ret9 := main(); {64584#true} is VALID [2018-11-18 23:35:36,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {64584#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {64584#true} assume true; {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {64584#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {64584#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {64584#true} assume !(0 != ~p1~0); {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {64584#true} assume !(0 != ~p2~0); {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {64584#true} assume !(0 != ~p3~0); {64584#true} is VALID [2018-11-18 23:35:36,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {64584#true} assume !(0 != ~p4~0); {64584#true} is VALID [2018-11-18 23:35:36,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {64584#true} assume !(0 != ~p5~0); {64584#true} is VALID [2018-11-18 23:35:36,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {64584#true} assume !(0 != ~p6~0); {64584#true} is VALID [2018-11-18 23:35:36,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {64584#true} assume 0 != ~p7~0;~lk7~0 := 1; {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {64586#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {64586#(not (= main_~p7~0 0))} is VALID [2018-11-18 23:35:36,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {64586#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {64585#false} is VALID [2018-11-18 23:35:36,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {64585#false} assume 0 != ~p8~0; {64585#false} is VALID [2018-11-18 23:35:36,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {64585#false} assume 1 != ~lk8~0; {64585#false} is VALID [2018-11-18 23:35:36,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {64585#false} assume !false; {64585#false} is VALID [2018-11-18 23:35:36,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:35:36,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:36,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:36,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 23:35:36,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:36,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:36,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:36,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:36,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:36,896 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-11-18 23:35:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:39,287 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-11-18 23:35:39,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:39,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 23:35:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-18 23:35:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-18 23:35:39,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-18 23:35:39,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:39,875 INFO L225 Difference]: With dead ends: 4621 [2018-11-18 23:35:39,875 INFO L226 Difference]: Without dead ends: 3147 [2018-11-18 23:35:39,878 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:35:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-11-18 23:35:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-11-18 23:35:42,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:42,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3147 states. Second operand 3145 states. [2018-11-18 23:35:42,029 INFO L74 IsIncluded]: Start isIncluded. First operand 3147 states. Second operand 3145 states. [2018-11-18 23:35:42,029 INFO L87 Difference]: Start difference. First operand 3147 states. Second operand 3145 states. [2018-11-18 23:35:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:42,396 INFO L93 Difference]: Finished difference Result 3147 states and 3784 transitions. [2018-11-18 23:35:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3784 transitions. [2018-11-18 23:35:42,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:42,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:42,399 INFO L74 IsIncluded]: Start isIncluded. First operand 3145 states. Second operand 3147 states. [2018-11-18 23:35:42,400 INFO L87 Difference]: Start difference. First operand 3145 states. Second operand 3147 states. [2018-11-18 23:35:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:42,778 INFO L93 Difference]: Finished difference Result 3147 states and 3784 transitions. [2018-11-18 23:35:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3784 transitions. [2018-11-18 23:35:42,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:42,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:42,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:42,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-18 23:35:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-11-18 23:35:43,157 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-11-18 23:35:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:43,157 INFO L480 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-11-18 23:35:43,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-11-18 23:35:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:35:43,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:43,160 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, 1, 1, 1, 1, 1, 1] [2018-11-18 23:35:43,160 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:43,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-11-18 23:35:43,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:43,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:43,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:43,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {78983#true} call ULTIMATE.init(); {78983#true} is VALID [2018-11-18 23:35:43,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {78983#true} assume true; {78983#true} is VALID [2018-11-18 23:35:43,373 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {78983#true} {78983#true} #164#return; {78983#true} is VALID [2018-11-18 23:35:43,373 INFO L256 TraceCheckUtils]: 3: Hoare triple {78983#true} call #t~ret9 := main(); {78983#true} is VALID [2018-11-18 23:35:43,373 INFO L273 TraceCheckUtils]: 4: Hoare triple {78983#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {78983#true} is VALID [2018-11-18 23:35:43,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {78983#true} assume true; {78983#true} is VALID [2018-11-18 23:35:43,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {78983#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {78983#true} is VALID [2018-11-18 23:35:43,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {78983#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {78983#true} is VALID [2018-11-18 23:35:43,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {78983#true} assume !(0 != ~p1~0); {78983#true} is VALID [2018-11-18 23:35:43,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {78983#true} assume !(0 != ~p2~0); {78983#true} is VALID [2018-11-18 23:35:43,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {78983#true} assume !(0 != ~p3~0); {78983#true} is VALID [2018-11-18 23:35:43,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {78983#true} assume !(0 != ~p4~0); {78983#true} is VALID [2018-11-18 23:35:43,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {78983#true} assume !(0 != ~p5~0); {78983#true} is VALID [2018-11-18 23:35:43,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {78983#true} assume !(0 != ~p6~0); {78983#true} is VALID [2018-11-18 23:35:43,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {78983#true} assume !(0 != ~p7~0); {78983#true} is VALID [2018-11-18 23:35:43,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {78983#true} assume 0 != ~p8~0;~lk8~0 := 1; {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {78985#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {78985#(= main_~lk8~0 1)} assume 0 != ~p8~0; {78985#(= main_~lk8~0 1)} is VALID [2018-11-18 23:35:43,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {78985#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {78984#false} is VALID [2018-11-18 23:35:43,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {78984#false} assume !false; {78984#false} is VALID [2018-11-18 23:35:43,502 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:35:43,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:43,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:43,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 23:35:43,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:43,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:43,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:43,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:43,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:43,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:43,567 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-11-18 23:35:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:47,583 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-11-18 23:35:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:35:47,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 23:35:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:35:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-18 23:35:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:35:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-18 23:35:47,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2018-11-18 23:35:47,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:48,794 INFO L225 Difference]: With dead ends: 5131 [2018-11-18 23:35:48,794 INFO L226 Difference]: Without dead ends: 5129 [2018-11-18 23:35:48,796 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:35:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-11-18 23:35:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-11-18 23:35:50,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:35:50,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5129 states. Second operand 4745 states. [2018-11-18 23:35:50,742 INFO L74 IsIncluded]: Start isIncluded. First operand 5129 states. Second operand 4745 states. [2018-11-18 23:35:50,742 INFO L87 Difference]: Start difference. First operand 5129 states. Second operand 4745 states. [2018-11-18 23:35:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:51,669 INFO L93 Difference]: Finished difference Result 5129 states and 5959 transitions. [2018-11-18 23:35:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 5959 transitions. [2018-11-18 23:35:51,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:51,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:51,675 INFO L74 IsIncluded]: Start isIncluded. First operand 4745 states. Second operand 5129 states. [2018-11-18 23:35:51,675 INFO L87 Difference]: Start difference. First operand 4745 states. Second operand 5129 states. [2018-11-18 23:35:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:35:52,648 INFO L93 Difference]: Finished difference Result 5129 states and 5959 transitions. [2018-11-18 23:35:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 5959 transitions. [2018-11-18 23:35:52,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:35:52,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:35:52,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:35:52,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:35:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-11-18 23:35:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-11-18 23:35:53,573 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-11-18 23:35:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:35:53,573 INFO L480 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-11-18 23:35:53,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:35:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-11-18 23:35:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:35:53,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:35:53,579 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, 1, 1, 1, 1, 1, 1] [2018-11-18 23:35:53,579 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:35:53,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:35:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-11-18 23:35:53,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:35:53,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:35:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:35:53,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:35:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:35:53,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {99519#true} call ULTIMATE.init(); {99519#true} is VALID [2018-11-18 23:35:53,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {99519#true} assume true; {99519#true} is VALID [2018-11-18 23:35:53,807 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {99519#true} {99519#true} #164#return; {99519#true} is VALID [2018-11-18 23:35:53,807 INFO L256 TraceCheckUtils]: 3: Hoare triple {99519#true} call #t~ret9 := main(); {99519#true} is VALID [2018-11-18 23:35:53,807 INFO L273 TraceCheckUtils]: 4: Hoare triple {99519#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {99519#true} is VALID [2018-11-18 23:35:53,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {99519#true} assume true; {99519#true} is VALID [2018-11-18 23:35:53,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {99519#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {99519#true} is VALID [2018-11-18 23:35:53,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {99519#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {99519#true} is VALID [2018-11-18 23:35:53,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {99519#true} assume !(0 != ~p1~0); {99519#true} is VALID [2018-11-18 23:35:53,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {99519#true} assume !(0 != ~p2~0); {99519#true} is VALID [2018-11-18 23:35:53,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {99519#true} assume !(0 != ~p3~0); {99519#true} is VALID [2018-11-18 23:35:53,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {99519#true} assume !(0 != ~p4~0); {99519#true} is VALID [2018-11-18 23:35:53,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {99519#true} assume !(0 != ~p5~0); {99519#true} is VALID [2018-11-18 23:35:53,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {99519#true} assume !(0 != ~p6~0); {99519#true} is VALID [2018-11-18 23:35:53,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {99519#true} assume !(0 != ~p7~0); {99519#true} is VALID [2018-11-18 23:35:53,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {99519#true} assume !(0 != ~p8~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p1~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p2~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p3~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p4~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p5~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p6~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {99521#(= main_~p8~0 0)} assume !(0 != ~p7~0); {99521#(= main_~p8~0 0)} is VALID [2018-11-18 23:35:53,864 INFO L273 TraceCheckUtils]: 23: Hoare triple {99521#(= main_~p8~0 0)} assume 0 != ~p8~0; {99520#false} is VALID [2018-11-18 23:35:53,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {99520#false} assume 1 != ~lk8~0; {99520#false} is VALID [2018-11-18 23:35:53,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {99520#false} assume !false; {99520#false} is VALID [2018-11-18 23:35:53,865 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:35:53,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:35:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:35:53,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 23:35:53,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:35:53,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:35:53,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:35:53,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:35:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:35:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:35:53,887 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-11-18 23:36:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:36:01,493 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-11-18 23:36:01,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:36:01,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 23:36:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:36:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:36:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-18 23:36:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:36:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-18 23:36:01,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-18 23:36:01,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:36:01,632 INFO L225 Difference]: With dead ends: 10633 [2018-11-18 23:36:01,632 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:36:01,647 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:36:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:36:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:36:01,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:36:01,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:36:01,647 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:36:01,648 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:36:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:36:01,648 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:36:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:36:01,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:36:01,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:36:01,648 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:36:01,649 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:36:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:36:01,649 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:36:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:36:01,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:36:01,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:36:01,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:36:01,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:36:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:36:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:36:01,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-18 23:36:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:36:01,650 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:36:01,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:36:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:36:01,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:36:01,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:36:01,781 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:36:01,782 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,782 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-18 23:36:01,783 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,784 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,785 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-18 23:36:01,786 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-18 23:36:01,788 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-18 23:36:01,789 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 23:36:01,790 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-18 23:36:01,791 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-18 23:36:01,792 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-18 23:36:01,792 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:36:01,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:36:01 BoogieIcfgContainer [2018-11-18 23:36:01,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:36:01,799 INFO L168 Benchmark]: Toolchain (without parser) took 58679.00 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -882.2 MB). Peak memory consumption was 262.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:36:01,800 INFO L168 Benchmark]: CDTParser took 0.25 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:36:01,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.51 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:36:01,801 INFO L168 Benchmark]: Boogie Preprocessor took 48.20 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:36:01,802 INFO L168 Benchmark]: RCFGBuilder took 928.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-18 23:36:01,802 INFO L168 Benchmark]: TraceAbstraction took 57326.13 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 420.0 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -141.1 MB). Peak memory consumption was 278.9 MB. Max. memory is 7.1 GB. [2018-11-18 23:36:01,805 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.25 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 370.51 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 48.20 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 928.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57326.13 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 420.0 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -141.1 MB). Peak memory consumption was 278.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 39 locations, 1 error locations. SAFE Result, 57.2s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 33.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, 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: 17.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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, 3.6s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...