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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:41:11,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:41:11,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:41:11,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:41:11,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:41:11,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:41:11,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:41:11,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:41:11,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:41:11,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:41:11,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:41:11,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:41:11,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:41:11,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:41:11,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:41:11,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:41:11,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:41:11,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:41:11,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:41:11,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:41:11,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:41:11,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:41:11,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:41:11,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:41:11,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:41:11,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:41:11,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:41:11,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:41:11,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:41:11,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:41:11,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:41:11,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:41:11,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:41:11,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:41:11,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:41:11,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:41:11,698 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-23 12:41:11,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:41:11,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:41:11,719 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:41:11,719 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:41:11,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:41:11,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:41:11,720 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:41:11,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:41:11,720 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:41:11,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:41:11,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:41:11,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:41:11,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:41:11,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:41:11,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:41:11,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:41:11,722 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:41:11,722 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:41:11,722 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:41:11,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:41:11,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:41:11,723 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:41:11,723 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:41:11,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:41:11,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:41:11,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:41:11,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:41:11,724 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:41:11,724 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:41:11,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:41:11,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:41:11,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:41:11,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:41:11,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:41:11,797 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:41:11,797 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:41:11,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:11,860 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaddb1e16/7e5fc7a412244b70bf2c8a6c675f839a/FLAG052ee0df7 [2018-11-23 12:41:12,305 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:41:12,306 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:12,314 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaddb1e16/7e5fc7a412244b70bf2c8a6c675f839a/FLAG052ee0df7 [2018-11-23 12:41:12,670 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaddb1e16/7e5fc7a412244b70bf2c8a6c675f839a [2018-11-23 12:41:12,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:41:12,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:41:12,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:12,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:41:12,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:41:12,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:12" (1/1) ... [2018-11-23 12:41:12,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e55024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:12, skipping insertion in model container [2018-11-23 12:41:12,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:12" (1/1) ... [2018-11-23 12:41:12,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:41:12,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:41:13,018 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:13,024 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:41:13,058 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:13,077 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:41:13,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13 WrapperNode [2018-11-23 12:41:13,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:13,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:13,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:41:13,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:41:13,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:13,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:41:13,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:41:13,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:41:13,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (1/1) ... [2018-11-23 12:41:13,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:41:13,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:41:13,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:41:13,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:41:13,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (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-23 12:41:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:41:13,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:41:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:41:13,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:41:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:41:13,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:41:14,321 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:41:14,322 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:41:14,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:14 BoogieIcfgContainer [2018-11-23 12:41:14,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:41:14,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:41:14,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:41:14,327 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:41:14,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:41:12" (1/3) ... [2018-11-23 12:41:14,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fb62c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:14, skipping insertion in model container [2018-11-23 12:41:14,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:13" (2/3) ... [2018-11-23 12:41:14,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fb62c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:14, skipping insertion in model container [2018-11-23 12:41:14,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:14" (3/3) ... [2018-11-23 12:41:14,332 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:14,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:41:14,349 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:41:14,364 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:41:14,395 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:41:14,396 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:41:14,396 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:41:14,396 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:41:14,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:41:14,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:41:14,398 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:41:14,398 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:41:14,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:41:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 12:41:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:41:14,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:14,427 INFO L402 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-23 12:41:14,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-11-23 12:41:14,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:14,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:14,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2018-11-23 12:41:14,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2018-11-23 12:41:14,668 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2018-11-23 12:41:14,669 INFO L256 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret12 := main(); {50#true} is VALID [2018-11-23 12:41:14,669 INFO L273 TraceCheckUtils]: 4: Hoare triple {50#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {50#true} is VALID [2018-11-23 12:41:14,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {50#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {50#true} is VALID [2018-11-23 12:41:14,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {50#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {50#true} is VALID [2018-11-23 12:41:14,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#true} assume 0 != ~p1~0;~lk1~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {52#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {52#(= main_~lk1~0 1)} assume 0 != ~p1~0; {52#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:14,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {52#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {51#false} is VALID [2018-11-23 12:41:14,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {51#false} assume !false; {51#false} is VALID [2018-11-23 12:41:14,721 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-23 12:41:14,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:14,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:14,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:14,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:14,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:14,813 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-23 12:41:14,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:14,825 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-23 12:41:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:15,755 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-11-23 12:41:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:15,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:41:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:41:15,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 12:41:16,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:16,281 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:41:16,281 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:41:16,285 INFO L631 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-23 12:41:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:41:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-11-23 12:41:16,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:16,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 54 states. [2018-11-23 12:41:16,339 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 54 states. [2018-11-23 12:41:16,339 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 54 states. [2018-11-23 12:41:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:16,349 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2018-11-23 12:41:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2018-11-23 12:41:16,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:16,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:16,351 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 78 states. [2018-11-23 12:41:16,351 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 78 states. [2018-11-23 12:41:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:16,359 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2018-11-23 12:41:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2018-11-23 12:41:16,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:16,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:16,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:16,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:41:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-11-23 12:41:16,368 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-11-23 12:41:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:16,369 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-11-23 12:41:16,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-11-23 12:41:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:41:16,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:16,371 INFO L402 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-23 12:41:16,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:16,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-11-23 12:41:16,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:16,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:16,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2018-11-23 12:41:16,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-23 12:41:16,486 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {376#true} {376#true} #214#return; {376#true} is VALID [2018-11-23 12:41:16,486 INFO L256 TraceCheckUtils]: 3: Hoare triple {376#true} call #t~ret12 := main(); {376#true} is VALID [2018-11-23 12:41:16,486 INFO L273 TraceCheckUtils]: 4: Hoare triple {376#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {376#true} is VALID [2018-11-23 12:41:16,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {376#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {376#true} is VALID [2018-11-23 12:41:16,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {376#true} is VALID [2018-11-23 12:41:16,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {376#true} assume !(0 != ~p1~0); {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {378#(= main_~p1~0 0)} assume !(0 != ~p8~0); {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {378#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:16,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {378#(= main_~p1~0 0)} assume 0 != ~p1~0; {377#false} is VALID [2018-11-23 12:41:16,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {377#false} assume 1 != ~lk1~0; {377#false} is VALID [2018-11-23 12:41:16,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {377#false} assume !false; {377#false} is VALID [2018-11-23 12:41:16,505 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-23 12:41:16,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:16,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:16,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:16,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:16,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:16,548 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-23 12:41:16,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:16,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:16,549 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-11-23 12:41:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:16,941 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-11-23 12:41:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:16,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 12:41:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 12:41:16,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2018-11-23 12:41:17,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:17,347 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:41:17,347 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:41:17,348 INFO L631 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-23 12:41:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:41:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 12:41:17,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:17,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 12:41:17,372 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 12:41:17,372 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 12:41:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:17,377 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2018-11-23 12:41:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2018-11-23 12:41:17,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:17,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:17,379 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 12:41:17,379 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 12:41:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:17,384 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2018-11-23 12:41:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2018-11-23 12:41:17,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:17,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:17,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:17,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:41:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-11-23 12:41:17,391 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-11-23 12:41:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:17,391 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-11-23 12:41:17,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-11-23 12:41:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:17,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:17,393 INFO L402 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-23 12:41:17,393 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:17,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-11-23 12:41:17,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:17,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:17,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {757#true} is VALID [2018-11-23 12:41:17,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2018-11-23 12:41:17,491 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #214#return; {757#true} is VALID [2018-11-23 12:41:17,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {757#true} call #t~ret12 := main(); {757#true} is VALID [2018-11-23 12:41:17,492 INFO L273 TraceCheckUtils]: 4: Hoare triple {757#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {757#true} is VALID [2018-11-23 12:41:17,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {757#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {757#true} is VALID [2018-11-23 12:41:17,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {757#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {757#true} is VALID [2018-11-23 12:41:17,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {757#true} assume 0 != ~p1~0;~lk1~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {759#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {759#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {759#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:17,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {759#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {758#false} is VALID [2018-11-23 12:41:17,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {758#false} assume 0 != ~p2~0; {758#false} is VALID [2018-11-23 12:41:17,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {758#false} assume 1 != ~lk2~0; {758#false} is VALID [2018-11-23 12:41:17,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {758#false} assume !false; {758#false} is VALID [2018-11-23 12:41:17,514 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-23 12:41:17,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:17,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:17,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:17,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:17,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:17,565 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-23 12:41:17,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:17,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:17,567 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-11-23 12:41:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:17,773 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-11-23 12:41:17,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:17,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 12:41:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 12:41:17,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2018-11-23 12:41:18,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:18,115 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:41:18,116 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:41:18,116 INFO L631 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-23 12:41:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:41:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-23 12:41:18,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:18,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2018-11-23 12:41:18,141 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2018-11-23 12:41:18,141 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2018-11-23 12:41:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,146 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2018-11-23 12:41:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2018-11-23 12:41:18,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:18,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:18,147 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2018-11-23 12:41:18,147 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2018-11-23 12:41:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,152 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2018-11-23 12:41:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2018-11-23 12:41:18,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:18,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:18,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:18,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:41:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-23 12:41:18,158 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-11-23 12:41:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:18,158 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-23 12:41:18,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-23 12:41:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:18,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:18,160 INFO L402 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-23 12:41:18,160 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:18,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-11-23 12:41:18,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:18,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:18,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:18,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {1139#true} call ULTIMATE.init(); {1139#true} is VALID [2018-11-23 12:41:18,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {1139#true} assume true; {1139#true} is VALID [2018-11-23 12:41:18,262 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1139#true} {1139#true} #214#return; {1139#true} is VALID [2018-11-23 12:41:18,263 INFO L256 TraceCheckUtils]: 3: Hoare triple {1139#true} call #t~ret12 := main(); {1139#true} is VALID [2018-11-23 12:41:18,263 INFO L273 TraceCheckUtils]: 4: Hoare triple {1139#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1139#true} is VALID [2018-11-23 12:41:18,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {1139#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1139#true} is VALID [2018-11-23 12:41:18,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {1139#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1139#true} is VALID [2018-11-23 12:41:18,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {1139#true} assume !(0 != ~p1~0); {1139#true} is VALID [2018-11-23 12:41:18,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {1139#true} assume 0 != ~p2~0;~lk2~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {1141#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {1141#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {1141#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1141#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:18,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {1141#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1140#false} is VALID [2018-11-23 12:41:18,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {1140#false} assume !false; {1140#false} is VALID [2018-11-23 12:41:18,284 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-23 12:41:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:18,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:18,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:18,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:18,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:18,309 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-23 12:41:18,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:18,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:18,310 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-11-23 12:41:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,483 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-11-23 12:41:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:18,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:41:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:41:18,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 12:41:18,654 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-23 12:41:18,659 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:41:18,659 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:41:18,660 INFO L631 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-23 12:41:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:41:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-11-23 12:41:18,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:18,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 104 states. [2018-11-23 12:41:18,692 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 104 states. [2018-11-23 12:41:18,692 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 104 states. [2018-11-23 12:41:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,699 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2018-11-23 12:41:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2018-11-23 12:41:18,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:18,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:18,701 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 146 states. [2018-11-23 12:41:18,701 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 146 states. [2018-11-23 12:41:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,710 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2018-11-23 12:41:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2018-11-23 12:41:18,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:18,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:18,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:18,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:41:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-11-23 12:41:18,720 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-11-23 12:41:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:18,720 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-11-23 12:41:18,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-11-23 12:41:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:18,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:18,721 INFO L402 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-23 12:41:18,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:18,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-11-23 12:41:18,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:18,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:18,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {1708#true} call ULTIMATE.init(); {1708#true} is VALID [2018-11-23 12:41:18,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {1708#true} assume true; {1708#true} is VALID [2018-11-23 12:41:18,788 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1708#true} {1708#true} #214#return; {1708#true} is VALID [2018-11-23 12:41:18,788 INFO L256 TraceCheckUtils]: 3: Hoare triple {1708#true} call #t~ret12 := main(); {1708#true} is VALID [2018-11-23 12:41:18,789 INFO L273 TraceCheckUtils]: 4: Hoare triple {1708#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1708#true} is VALID [2018-11-23 12:41:18,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {1708#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1708#true} is VALID [2018-11-23 12:41:18,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {1708#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1708#true} is VALID [2018-11-23 12:41:18,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {1708#true} assume !(0 != ~p1~0); {1708#true} is VALID [2018-11-23 12:41:18,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {1708#true} assume !(0 != ~p2~0); {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {1710#(= main_~p2~0 0)} assume !(0 != ~p8~0); {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {1710#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1710#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:18,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {1710#(= main_~p2~0 0)} assume 0 != ~p2~0; {1709#false} is VALID [2018-11-23 12:41:18,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {1709#false} assume 1 != ~lk2~0; {1709#false} is VALID [2018-11-23 12:41:18,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {1709#false} assume !false; {1709#false} is VALID [2018-11-23 12:41:18,811 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-23 12:41:18,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:18,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:18,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:18,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:18,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:18,844 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-23 12:41:18,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:18,845 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-11-23 12:41:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:19,016 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-11-23 12:41:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:19,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2018-11-23 12:41:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2018-11-23 12:41:19,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2018-11-23 12:41:19,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:19,590 INFO L225 Difference]: With dead ends: 244 [2018-11-23 12:41:19,591 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:41:19,591 INFO L631 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-23 12:41:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:41:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-23 12:41:19,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:19,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-23 12:41:19,625 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-23 12:41:19,625 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-23 12:41:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:19,631 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2018-11-23 12:41:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2018-11-23 12:41:19,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:19,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:19,633 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-23 12:41:19,633 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-23 12:41:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:19,639 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2018-11-23 12:41:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2018-11-23 12:41:19,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:19,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:19,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:19,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:41:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-11-23 12:41:19,646 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-11-23 12:41:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:19,646 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-11-23 12:41:19,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-11-23 12:41:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:19,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:19,647 INFO L402 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-23 12:41:19,648 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:19,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-11-23 12:41:19,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:19,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:19,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2423#true} is VALID [2018-11-23 12:41:19,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {2423#true} assume true; {2423#true} is VALID [2018-11-23 12:41:19,729 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2423#true} {2423#true} #214#return; {2423#true} is VALID [2018-11-23 12:41:19,729 INFO L256 TraceCheckUtils]: 3: Hoare triple {2423#true} call #t~ret12 := main(); {2423#true} is VALID [2018-11-23 12:41:19,729 INFO L273 TraceCheckUtils]: 4: Hoare triple {2423#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {2423#true} is VALID [2018-11-23 12:41:19,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {2423#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2423#true} is VALID [2018-11-23 12:41:19,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {2423#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {2423#true} is VALID [2018-11-23 12:41:19,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {2423#true} assume !(0 != ~p1~0); {2423#true} is VALID [2018-11-23 12:41:19,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {2423#true} assume 0 != ~p2~0;~lk2~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {2425#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {2425#(not (= main_~p2~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {2425#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {2425#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:19,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {2425#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {2424#false} is VALID [2018-11-23 12:41:19,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {2424#false} assume 0 != ~p3~0; {2424#false} is VALID [2018-11-23 12:41:19,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {2424#false} assume 1 != ~lk3~0; {2424#false} is VALID [2018-11-23 12:41:19,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2018-11-23 12:41:19,755 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-23 12:41:19,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:19,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:19,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:19,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:19,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:19,791 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-23 12:41:19,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:19,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:19,793 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-11-23 12:41:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:20,067 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-11-23 12:41:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:20,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2018-11-23 12:41:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2018-11-23 12:41:20,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2018-11-23 12:41:20,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:20,459 INFO L225 Difference]: With dead ends: 219 [2018-11-23 12:41:20,459 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:41:20,460 INFO L631 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-23 12:41:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:41:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-23 12:41:20,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:20,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2018-11-23 12:41:20,529 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2018-11-23 12:41:20,529 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2018-11-23 12:41:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:20,535 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2018-11-23 12:41:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2018-11-23 12:41:20,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:20,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:20,536 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2018-11-23 12:41:20,536 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2018-11-23 12:41:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:20,542 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2018-11-23 12:41:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2018-11-23 12:41:20,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:20,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:20,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:20,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 12:41:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-11-23 12:41:20,548 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-11-23 12:41:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:20,549 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-11-23 12:41:20,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-11-23 12:41:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:20,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:20,550 INFO L402 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-23 12:41:20,550 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:20,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-11-23 12:41:20,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:20,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:20,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {3119#true} call ULTIMATE.init(); {3119#true} is VALID [2018-11-23 12:41:20,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {3119#true} assume true; {3119#true} is VALID [2018-11-23 12:41:20,810 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3119#true} {3119#true} #214#return; {3119#true} is VALID [2018-11-23 12:41:20,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {3119#true} call #t~ret12 := main(); {3119#true} is VALID [2018-11-23 12:41:20,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {3119#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {3119#true} is VALID [2018-11-23 12:41:20,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {3119#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3119#true} is VALID [2018-11-23 12:41:20,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {3119#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {3119#true} is VALID [2018-11-23 12:41:20,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {3119#true} assume !(0 != ~p1~0); {3119#true} is VALID [2018-11-23 12:41:20,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#true} assume !(0 != ~p2~0); {3119#true} is VALID [2018-11-23 12:41:20,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {3119#true} assume 0 != ~p3~0;~lk3~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {3121#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {3121#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {3121#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {3121#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3121#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:20,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {3121#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3120#false} is VALID [2018-11-23 12:41:20,970 INFO L273 TraceCheckUtils]: 22: Hoare triple {3120#false} assume !false; {3120#false} is VALID [2018-11-23 12:41:20,971 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-23 12:41:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:20,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:20,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:20,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:20,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:21,176 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-23 12:41:21,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:21,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:21,177 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-11-23 12:41:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:21,385 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-11-23 12:41:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:21,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:41:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:41:21,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 12:41:21,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:21,530 INFO L225 Difference]: With dead ends: 276 [2018-11-23 12:41:21,531 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 12:41:21,531 INFO L631 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-23 12:41:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 12:41:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-11-23 12:41:21,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:21,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 200 states. [2018-11-23 12:41:21,601 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 200 states. [2018-11-23 12:41:21,601 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 200 states. [2018-11-23 12:41:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:21,613 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2018-11-23 12:41:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2018-11-23 12:41:21,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:21,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:21,614 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 274 states. [2018-11-23 12:41:21,614 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 274 states. [2018-11-23 12:41:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:21,624 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2018-11-23 12:41:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2018-11-23 12:41:21,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:21,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:21,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:21,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 12:41:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-11-23 12:41:21,632 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-11-23 12:41:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:21,632 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-11-23 12:41:21,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-11-23 12:41:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:21,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:21,633 INFO L402 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-23 12:41:21,634 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:21,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-11-23 12:41:21,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:21,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:21,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:21,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {4174#true} call ULTIMATE.init(); {4174#true} is VALID [2018-11-23 12:41:21,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {4174#true} assume true; {4174#true} is VALID [2018-11-23 12:41:21,720 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4174#true} {4174#true} #214#return; {4174#true} is VALID [2018-11-23 12:41:21,720 INFO L256 TraceCheckUtils]: 3: Hoare triple {4174#true} call #t~ret12 := main(); {4174#true} is VALID [2018-11-23 12:41:21,721 INFO L273 TraceCheckUtils]: 4: Hoare triple {4174#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {4174#true} is VALID [2018-11-23 12:41:21,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {4174#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4174#true} is VALID [2018-11-23 12:41:21,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {4174#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {4174#true} is VALID [2018-11-23 12:41:21,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {4174#true} assume !(0 != ~p1~0); {4174#true} is VALID [2018-11-23 12:41:21,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#true} assume !(0 != ~p2~0); {4174#true} is VALID [2018-11-23 12:41:21,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {4174#true} assume !(0 != ~p3~0); {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {4176#(= main_~p3~0 0)} assume !(0 != ~p8~0); {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {4176#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {4176#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4176#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:21,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {4176#(= main_~p3~0 0)} assume 0 != ~p3~0; {4175#false} is VALID [2018-11-23 12:41:21,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {4175#false} assume 1 != ~lk3~0; {4175#false} is VALID [2018-11-23 12:41:21,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {4175#false} assume !false; {4175#false} is VALID [2018-11-23 12:41:21,730 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-23 12:41:21,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:21,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:21,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:21,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:21,769 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-23 12:41:21,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:21,770 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-11-23 12:41:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:22,050 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-11-23 12:41:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:22,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2018-11-23 12:41:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2018-11-23 12:41:22,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2018-11-23 12:41:22,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:22,659 INFO L225 Difference]: With dead ends: 472 [2018-11-23 12:41:22,659 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 12:41:22,661 INFO L631 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-23 12:41:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 12:41:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-11-23 12:41:22,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:22,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 280 states. [2018-11-23 12:41:22,819 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 280 states. [2018-11-23 12:41:22,819 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 280 states. [2018-11-23 12:41:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:22,827 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2018-11-23 12:41:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2018-11-23 12:41:22,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:22,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:22,828 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand 282 states. [2018-11-23 12:41:22,829 INFO L87 Difference]: Start difference. First operand 280 states. Second operand 282 states. [2018-11-23 12:41:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:22,837 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2018-11-23 12:41:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2018-11-23 12:41:22,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:22,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:22,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:22,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-23 12:41:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-11-23 12:41:22,846 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-11-23 12:41:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:22,846 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-11-23 12:41:22,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-11-23 12:41:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:41:22,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:22,847 INFO L402 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-23 12:41:22,848 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:22,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-11-23 12:41:22,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:22,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:23,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5529#true} is VALID [2018-11-23 12:41:23,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {5529#true} assume true; {5529#true} is VALID [2018-11-23 12:41:23,068 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5529#true} {5529#true} #214#return; {5529#true} is VALID [2018-11-23 12:41:23,068 INFO L256 TraceCheckUtils]: 3: Hoare triple {5529#true} call #t~ret12 := main(); {5529#true} is VALID [2018-11-23 12:41:23,068 INFO L273 TraceCheckUtils]: 4: Hoare triple {5529#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {5529#true} is VALID [2018-11-23 12:41:23,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {5529#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {5529#true} is VALID [2018-11-23 12:41:23,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {5529#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {5529#true} is VALID [2018-11-23 12:41:23,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {5529#true} assume !(0 != ~p1~0); {5529#true} is VALID [2018-11-23 12:41:23,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {5529#true} assume !(0 != ~p2~0); {5529#true} is VALID [2018-11-23 12:41:23,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {5529#true} assume 0 != ~p3~0;~lk3~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {5531#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {5531#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {5531#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {5531#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5531#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:23,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {5531#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5530#false} is VALID [2018-11-23 12:41:23,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {5530#false} assume 0 != ~p4~0; {5530#false} is VALID [2018-11-23 12:41:23,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {5530#false} assume 1 != ~lk4~0; {5530#false} is VALID [2018-11-23 12:41:23,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2018-11-23 12:41:23,212 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-23 12:41:23,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:23,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:23,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:23,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:23,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:23,450 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-23 12:41:23,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:23,451 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-11-23 12:41:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:23,814 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-11-23 12:41:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:23,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 12:41:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 12:41:23,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2018-11-23 12:41:24,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:24,730 INFO L225 Difference]: With dead ends: 420 [2018-11-23 12:41:24,730 INFO L226 Difference]: Without dead ends: 286 [2018-11-23 12:41:24,731 INFO L631 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-23 12:41:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-23 12:41:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-23 12:41:24,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:24,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 284 states. [2018-11-23 12:41:24,776 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 284 states. [2018-11-23 12:41:24,776 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 284 states. [2018-11-23 12:41:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:24,783 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2018-11-23 12:41:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2018-11-23 12:41:24,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:24,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:24,785 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 286 states. [2018-11-23 12:41:24,785 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 286 states. [2018-11-23 12:41:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:24,793 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2018-11-23 12:41:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2018-11-23 12:41:24,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:24,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:24,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:24,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 12:41:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-11-23 12:41:24,802 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-11-23 12:41:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:24,802 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-11-23 12:41:24,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-11-23 12:41:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:41:24,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:24,803 INFO L402 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-23 12:41:24,803 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:24,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-11-23 12:41:24,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:24,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:25,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {6844#true} call ULTIMATE.init(); {6844#true} is VALID [2018-11-23 12:41:25,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {6844#true} assume true; {6844#true} is VALID [2018-11-23 12:41:25,041 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6844#true} {6844#true} #214#return; {6844#true} is VALID [2018-11-23 12:41:25,041 INFO L256 TraceCheckUtils]: 3: Hoare triple {6844#true} call #t~ret12 := main(); {6844#true} is VALID [2018-11-23 12:41:25,042 INFO L273 TraceCheckUtils]: 4: Hoare triple {6844#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {6844#true} is VALID [2018-11-23 12:41:25,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {6844#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6844#true} is VALID [2018-11-23 12:41:25,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {6844#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {6844#true} is VALID [2018-11-23 12:41:25,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {6844#true} assume !(0 != ~p1~0); {6844#true} is VALID [2018-11-23 12:41:25,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {6844#true} assume !(0 != ~p2~0); {6844#true} is VALID [2018-11-23 12:41:25,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {6844#true} assume !(0 != ~p3~0); {6844#true} is VALID [2018-11-23 12:41:25,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {6844#true} assume 0 != ~p4~0;~lk4~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {6846#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {6846#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {6846#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {6846#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {6846#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6846#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:25,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {6846#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6845#false} is VALID [2018-11-23 12:41:25,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {6845#false} assume !false; {6845#false} is VALID [2018-11-23 12:41:25,206 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-23 12:41:25,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:25,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:25,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:25,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:25,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:25,506 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-23 12:41:25,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:25,507 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-11-23 12:41:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:26,041 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-11-23 12:41:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:26,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 12:41:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 12:41:26,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2018-11-23 12:41:26,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:26,676 INFO L225 Difference]: With dead ends: 524 [2018-11-23 12:41:26,676 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 12:41:26,676 INFO L631 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-23 12:41:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 12:41:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-11-23 12:41:26,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:26,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 392 states. [2018-11-23 12:41:26,770 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 392 states. [2018-11-23 12:41:26,770 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 392 states. [2018-11-23 12:41:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:26,790 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2018-11-23 12:41:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2018-11-23 12:41:26,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:26,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:26,792 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 522 states. [2018-11-23 12:41:26,792 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 522 states. [2018-11-23 12:41:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:26,813 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2018-11-23 12:41:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2018-11-23 12:41:26,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:26,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:26,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:26,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 12:41:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-11-23 12:41:26,827 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-11-23 12:41:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:26,827 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-11-23 12:41:26,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-11-23 12:41:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:41:26,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:26,829 INFO L402 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-23 12:41:26,829 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:26,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-11-23 12:41:26,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:27,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2018-11-23 12:41:27,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {8847#true} assume true; {8847#true} is VALID [2018-11-23 12:41:27,051 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8847#true} {8847#true} #214#return; {8847#true} is VALID [2018-11-23 12:41:27,051 INFO L256 TraceCheckUtils]: 3: Hoare triple {8847#true} call #t~ret12 := main(); {8847#true} is VALID [2018-11-23 12:41:27,051 INFO L273 TraceCheckUtils]: 4: Hoare triple {8847#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {8847#true} is VALID [2018-11-23 12:41:27,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {8847#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8847#true} is VALID [2018-11-23 12:41:27,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {8847#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {8847#true} is VALID [2018-11-23 12:41:27,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {8847#true} assume !(0 != ~p1~0); {8847#true} is VALID [2018-11-23 12:41:27,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {8847#true} assume !(0 != ~p2~0); {8847#true} is VALID [2018-11-23 12:41:27,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {8847#true} assume !(0 != ~p3~0); {8847#true} is VALID [2018-11-23 12:41:27,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {8847#true} assume !(0 != ~p4~0); {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {8849#(= main_~p4~0 0)} assume !(0 != ~p8~0); {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {8849#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,174 INFO L273 TraceCheckUtils]: 19: Hoare triple {8849#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {8849#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8849#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:27,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {8849#(= main_~p4~0 0)} assume 0 != ~p4~0; {8848#false} is VALID [2018-11-23 12:41:27,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {8848#false} assume 1 != ~lk4~0; {8848#false} is VALID [2018-11-23 12:41:27,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2018-11-23 12:41:27,201 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-23 12:41:27,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:27,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:27,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:27,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:27,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:27,318 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-23 12:41:27,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:27,319 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-11-23 12:41:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:28,229 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-11-23 12:41:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:28,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2018-11-23 12:41:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2018-11-23 12:41:28,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 200 transitions. [2018-11-23 12:41:28,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:28,422 INFO L225 Difference]: With dead ends: 924 [2018-11-23 12:41:28,422 INFO L226 Difference]: Without dead ends: 546 [2018-11-23 12:41:28,423 INFO L631 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-23 12:41:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-23 12:41:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-11-23 12:41:28,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:28,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand 544 states. [2018-11-23 12:41:28,561 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand 544 states. [2018-11-23 12:41:28,561 INFO L87 Difference]: Start difference. First operand 546 states. Second operand 544 states. [2018-11-23 12:41:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:28,579 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2018-11-23 12:41:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2018-11-23 12:41:28,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:28,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:28,580 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand 546 states. [2018-11-23 12:41:28,581 INFO L87 Difference]: Start difference. First operand 544 states. Second operand 546 states. [2018-11-23 12:41:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:28,598 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2018-11-23 12:41:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2018-11-23 12:41:28,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:28,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:28,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:28,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-23 12:41:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-11-23 12:41:28,617 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-11-23 12:41:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:28,618 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-11-23 12:41:28,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-11-23 12:41:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:41:28,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:28,619 INFO L402 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-23 12:41:28,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:28,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-11-23 12:41:28,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:28,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:28,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:28,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:28,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:28,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {11466#true} call ULTIMATE.init(); {11466#true} is VALID [2018-11-23 12:41:28,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {11466#true} assume true; {11466#true} is VALID [2018-11-23 12:41:28,713 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11466#true} {11466#true} #214#return; {11466#true} is VALID [2018-11-23 12:41:28,714 INFO L256 TraceCheckUtils]: 3: Hoare triple {11466#true} call #t~ret12 := main(); {11466#true} is VALID [2018-11-23 12:41:28,714 INFO L273 TraceCheckUtils]: 4: Hoare triple {11466#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {11466#true} is VALID [2018-11-23 12:41:28,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {11466#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {11466#true} is VALID [2018-11-23 12:41:28,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {11466#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {11466#true} is VALID [2018-11-23 12:41:28,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {11466#true} assume !(0 != ~p1~0); {11466#true} is VALID [2018-11-23 12:41:28,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {11466#true} assume !(0 != ~p2~0); {11466#true} is VALID [2018-11-23 12:41:28,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {11466#true} assume !(0 != ~p3~0); {11466#true} is VALID [2018-11-23 12:41:28,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {11466#true} assume 0 != ~p4~0;~lk4~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {11468#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {11468#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {11468#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {11468#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {11468#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {11468#(not (= main_~p4~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {11468#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {11468#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {11468#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {11468#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {11468#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:28,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {11468#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {11467#false} is VALID [2018-11-23 12:41:28,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {11467#false} assume 0 != ~p5~0; {11467#false} is VALID [2018-11-23 12:41:28,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {11467#false} assume 1 != ~lk5~0; {11467#false} is VALID [2018-11-23 12:41:28,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {11467#false} assume !false; {11467#false} is VALID [2018-11-23 12:41:28,724 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-23 12:41:28,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:28,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:28,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:28,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:28,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:28,792 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-23 12:41:28,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:28,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:28,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:28,794 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-11-23 12:41:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:29,016 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-11-23 12:41:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:29,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2018-11-23 12:41:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2018-11-23 12:41:29,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2018-11-23 12:41:29,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:29,205 INFO L225 Difference]: With dead ends: 816 [2018-11-23 12:41:29,205 INFO L226 Difference]: Without dead ends: 554 [2018-11-23 12:41:29,206 INFO L631 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-23 12:41:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-23 12:41:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-11-23 12:41:29,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:29,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand 552 states. [2018-11-23 12:41:29,345 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand 552 states. [2018-11-23 12:41:29,345 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 552 states. [2018-11-23 12:41:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:29,362 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2018-11-23 12:41:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2018-11-23 12:41:29,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:29,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:29,364 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand 554 states. [2018-11-23 12:41:29,364 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 554 states. [2018-11-23 12:41:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:29,382 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2018-11-23 12:41:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2018-11-23 12:41:29,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:29,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:29,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:29,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 12:41:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-11-23 12:41:29,403 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-11-23 12:41:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:29,403 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-11-23 12:41:29,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-11-23 12:41:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:41:29,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:29,405 INFO L402 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-23 12:41:29,405 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:29,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-11-23 12:41:29,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:29,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:29,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:29,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {14001#true} call ULTIMATE.init(); {14001#true} is VALID [2018-11-23 12:41:29,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {14001#true} assume true; {14001#true} is VALID [2018-11-23 12:41:29,620 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14001#true} {14001#true} #214#return; {14001#true} is VALID [2018-11-23 12:41:29,621 INFO L256 TraceCheckUtils]: 3: Hoare triple {14001#true} call #t~ret12 := main(); {14001#true} is VALID [2018-11-23 12:41:29,621 INFO L273 TraceCheckUtils]: 4: Hoare triple {14001#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {14001#true} is VALID [2018-11-23 12:41:29,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {14001#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {14001#true} is VALID [2018-11-23 12:41:29,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {14001#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {14001#true} is VALID [2018-11-23 12:41:29,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {14001#true} assume !(0 != ~p1~0); {14001#true} is VALID [2018-11-23 12:41:29,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {14001#true} assume !(0 != ~p2~0); {14001#true} is VALID [2018-11-23 12:41:29,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {14001#true} assume !(0 != ~p3~0); {14001#true} is VALID [2018-11-23 12:41:29,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {14001#true} assume !(0 != ~p4~0); {14001#true} is VALID [2018-11-23 12:41:29,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {14001#true} assume 0 != ~p5~0;~lk5~0 := 1; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {14003#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {14003#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {14003#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {14003#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {14003#(= main_~lk5~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {14003#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {14003#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {14003#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {14003#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {14003#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {14003#(= main_~lk5~0 1)} assume 0 != ~p5~0; {14003#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:29,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {14003#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {14002#false} is VALID [2018-11-23 12:41:29,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {14002#false} assume !false; {14002#false} is VALID [2018-11-23 12:41:29,635 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-23 12:41:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:29,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:29,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:29,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:29,659 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-23 12:41:29,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:29,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:29,660 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-11-23 12:41:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:29,995 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-11-23 12:41:29,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:29,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:41:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:41:29,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 12:41:30,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:30,169 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 12:41:30,169 INFO L226 Difference]: Without dead ends: 1002 [2018-11-23 12:41:30,170 INFO L631 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-23 12:41:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-23 12:41:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-11-23 12:41:30,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:30,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1002 states. Second operand 776 states. [2018-11-23 12:41:30,663 INFO L74 IsIncluded]: Start isIncluded. First operand 1002 states. Second operand 776 states. [2018-11-23 12:41:30,663 INFO L87 Difference]: Start difference. First operand 1002 states. Second operand 776 states. [2018-11-23 12:41:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:30,699 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2018-11-23 12:41:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2018-11-23 12:41:30,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:30,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:30,700 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 1002 states. [2018-11-23 12:41:30,700 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 1002 states. [2018-11-23 12:41:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:30,736 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2018-11-23 12:41:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2018-11-23 12:41:30,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:30,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:30,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:30,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 12:41:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-11-23 12:41:30,769 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-11-23 12:41:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:30,770 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-11-23 12:41:30,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-11-23 12:41:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:41:30,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:30,771 INFO L402 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-23 12:41:30,771 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:30,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-11-23 12:41:30,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:30,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:30,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {17852#true} call ULTIMATE.init(); {17852#true} is VALID [2018-11-23 12:41:30,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {17852#true} assume true; {17852#true} is VALID [2018-11-23 12:41:30,836 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17852#true} {17852#true} #214#return; {17852#true} is VALID [2018-11-23 12:41:30,836 INFO L256 TraceCheckUtils]: 3: Hoare triple {17852#true} call #t~ret12 := main(); {17852#true} is VALID [2018-11-23 12:41:30,837 INFO L273 TraceCheckUtils]: 4: Hoare triple {17852#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {17852#true} is VALID [2018-11-23 12:41:30,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {17852#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {17852#true} is VALID [2018-11-23 12:41:30,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {17852#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {17852#true} is VALID [2018-11-23 12:41:30,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {17852#true} assume !(0 != ~p1~0); {17852#true} is VALID [2018-11-23 12:41:30,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {17852#true} assume !(0 != ~p2~0); {17852#true} is VALID [2018-11-23 12:41:30,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {17852#true} assume !(0 != ~p3~0); {17852#true} is VALID [2018-11-23 12:41:30,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {17852#true} assume !(0 != ~p4~0); {17852#true} is VALID [2018-11-23 12:41:30,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {17852#true} assume !(0 != ~p5~0); {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {17854#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {17854#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {17854#(= main_~p5~0 0)} assume !(0 != ~p8~0); {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {17854#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {17854#(= main_~p5~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {17854#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {17854#(= main_~p5~0 0)} assume !(0 != ~p1~0); {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {17854#(= main_~p5~0 0)} assume !(0 != ~p2~0); {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {17854#(= main_~p5~0 0)} assume !(0 != ~p3~0); {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {17854#(= main_~p5~0 0)} assume !(0 != ~p4~0); {17854#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:30,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {17854#(= main_~p5~0 0)} assume 0 != ~p5~0; {17853#false} is VALID [2018-11-23 12:41:30,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {17853#false} assume 1 != ~lk5~0; {17853#false} is VALID [2018-11-23 12:41:30,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {17853#false} assume !false; {17853#false} is VALID [2018-11-23 12:41:30,891 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-23 12:41:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:30,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:30,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:30,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:30,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:30,915 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-23 12:41:30,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:30,917 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-11-23 12:41:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:31,383 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-11-23 12:41:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:31,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-23 12:41:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-23 12:41:31,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2018-11-23 12:41:31,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:31,638 INFO L225 Difference]: With dead ends: 1820 [2018-11-23 12:41:31,638 INFO L226 Difference]: Without dead ends: 1066 [2018-11-23 12:41:31,640 INFO L631 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-23 12:41:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-23 12:41:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-11-23 12:41:31,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:31,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand 1064 states. [2018-11-23 12:41:31,918 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand 1064 states. [2018-11-23 12:41:31,918 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand 1064 states. [2018-11-23 12:41:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:31,966 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2018-11-23 12:41:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2018-11-23 12:41:31,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:31,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:31,968 INFO L74 IsIncluded]: Start isIncluded. First operand 1064 states. Second operand 1066 states. [2018-11-23 12:41:31,968 INFO L87 Difference]: Start difference. First operand 1064 states. Second operand 1066 states. [2018-11-23 12:41:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:32,027 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2018-11-23 12:41:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2018-11-23 12:41:32,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:32,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:32,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:32,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-23 12:41:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-11-23 12:41:32,071 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-11-23 12:41:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:32,071 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-11-23 12:41:32,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-11-23 12:41:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:41:32,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:32,073 INFO L402 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-23 12:41:32,073 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:32,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-11-23 12:41:32,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:32,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {22967#true} call ULTIMATE.init(); {22967#true} is VALID [2018-11-23 12:41:32,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {22967#true} assume true; {22967#true} is VALID [2018-11-23 12:41:32,140 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22967#true} {22967#true} #214#return; {22967#true} is VALID [2018-11-23 12:41:32,141 INFO L256 TraceCheckUtils]: 3: Hoare triple {22967#true} call #t~ret12 := main(); {22967#true} is VALID [2018-11-23 12:41:32,141 INFO L273 TraceCheckUtils]: 4: Hoare triple {22967#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {22967#true} is VALID [2018-11-23 12:41:32,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {22967#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {22967#true} is VALID [2018-11-23 12:41:32,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {22967#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {22967#true} is VALID [2018-11-23 12:41:32,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {22967#true} assume !(0 != ~p1~0); {22967#true} is VALID [2018-11-23 12:41:32,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {22967#true} assume !(0 != ~p2~0); {22967#true} is VALID [2018-11-23 12:41:32,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {22967#true} assume !(0 != ~p3~0); {22967#true} is VALID [2018-11-23 12:41:32,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {22967#true} assume !(0 != ~p4~0); {22967#true} is VALID [2018-11-23 12:41:32,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {22967#true} assume 0 != ~p5~0;~lk5~0 := 1; {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {22969#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {22969#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {22969#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {22969#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {22969#(not (= main_~p5~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {22969#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {22969#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {22969#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {22969#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {22969#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {22969#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:32,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {22969#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {22968#false} is VALID [2018-11-23 12:41:32,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {22968#false} assume 0 != ~p6~0; {22968#false} is VALID [2018-11-23 12:41:32,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {22968#false} assume 1 != ~lk6~0; {22968#false} is VALID [2018-11-23 12:41:32,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {22968#false} assume !false; {22968#false} is VALID [2018-11-23 12:41:32,164 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-23 12:41:32,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:32,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:32,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:32,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:32,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:32,195 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-23 12:41:32,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:32,197 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-11-23 12:41:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:32,729 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-11-23 12:41:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:32,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2018-11-23 12:41:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2018-11-23 12:41:32,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2018-11-23 12:41:32,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:32,983 INFO L225 Difference]: With dead ends: 1596 [2018-11-23 12:41:32,984 INFO L226 Difference]: Without dead ends: 1082 [2018-11-23 12:41:32,985 INFO L631 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-23 12:41:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-11-23 12:41:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-11-23 12:41:34,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:34,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1082 states. Second operand 1080 states. [2018-11-23 12:41:34,153 INFO L74 IsIncluded]: Start isIncluded. First operand 1082 states. Second operand 1080 states. [2018-11-23 12:41:34,154 INFO L87 Difference]: Start difference. First operand 1082 states. Second operand 1080 states. [2018-11-23 12:41:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:34,197 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2018-11-23 12:41:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2018-11-23 12:41:34,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:34,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:34,198 INFO L74 IsIncluded]: Start isIncluded. First operand 1080 states. Second operand 1082 states. [2018-11-23 12:41:34,199 INFO L87 Difference]: Start difference. First operand 1080 states. Second operand 1082 states. [2018-11-23 12:41:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:34,240 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2018-11-23 12:41:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2018-11-23 12:41:34,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:34,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:34,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:34,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-11-23 12:41:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-11-23 12:41:34,294 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-11-23 12:41:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:34,294 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-11-23 12:41:34,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-11-23 12:41:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:41:34,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:34,295 INFO L402 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-23 12:41:34,295 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:34,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-11-23 12:41:34,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:34,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:34,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {27906#true} call ULTIMATE.init(); {27906#true} is VALID [2018-11-23 12:41:34,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {27906#true} assume true; {27906#true} is VALID [2018-11-23 12:41:34,528 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27906#true} {27906#true} #214#return; {27906#true} is VALID [2018-11-23 12:41:34,529 INFO L256 TraceCheckUtils]: 3: Hoare triple {27906#true} call #t~ret12 := main(); {27906#true} is VALID [2018-11-23 12:41:34,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {27906#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {27906#true} is VALID [2018-11-23 12:41:34,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {27906#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {27906#true} is VALID [2018-11-23 12:41:34,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {27906#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {27906#true} is VALID [2018-11-23 12:41:34,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {27906#true} assume !(0 != ~p1~0); {27906#true} is VALID [2018-11-23 12:41:34,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {27906#true} assume !(0 != ~p2~0); {27906#true} is VALID [2018-11-23 12:41:34,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {27906#true} assume !(0 != ~p3~0); {27906#true} is VALID [2018-11-23 12:41:34,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {27906#true} assume !(0 != ~p4~0); {27906#true} is VALID [2018-11-23 12:41:34,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {27906#true} assume !(0 != ~p5~0); {27906#true} is VALID [2018-11-23 12:41:34,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {27906#true} assume 0 != ~p6~0;~lk6~0 := 1; {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {27908#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {27908#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {27908#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {27908#(= main_~lk6~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {27908#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {27908#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {27908#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {27908#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {27908#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {27908#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {27908#(= main_~lk6~0 1)} assume 0 != ~p6~0; {27908#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:34,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {27908#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {27907#false} is VALID [2018-11-23 12:41:34,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {27907#false} assume !false; {27907#false} is VALID [2018-11-23 12:41:34,547 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-23 12:41:34,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:34,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:34,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:34,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:34,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:34,571 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-23 12:41:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:34,572 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-11-23 12:41:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:35,368 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-11-23 12:41:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:35,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:41:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:41:35,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 12:41:35,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:35,650 INFO L225 Difference]: With dead ends: 1932 [2018-11-23 12:41:35,651 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 12:41:35,652 INFO L631 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-23 12:41:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 12:41:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-11-23 12:41:35,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:35,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1544 states. [2018-11-23 12:41:35,977 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1544 states. [2018-11-23 12:41:35,977 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1544 states. [2018-11-23 12:41:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:36,095 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2018-11-23 12:41:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2018-11-23 12:41:36,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:36,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:36,097 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1930 states. [2018-11-23 12:41:36,097 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1930 states. [2018-11-23 12:41:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:36,219 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2018-11-23 12:41:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2018-11-23 12:41:36,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:36,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:36,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:36,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 12:41:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-11-23 12:41:36,299 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-11-23 12:41:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:36,299 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-11-23 12:41:36,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-11-23 12:41:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:41:36,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:36,301 INFO L402 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-23 12:41:36,301 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:36,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-11-23 12:41:36,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:36,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:36,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:36,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {35357#true} call ULTIMATE.init(); {35357#true} is VALID [2018-11-23 12:41:36,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {35357#true} assume true; {35357#true} is VALID [2018-11-23 12:41:36,418 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35357#true} {35357#true} #214#return; {35357#true} is VALID [2018-11-23 12:41:36,418 INFO L256 TraceCheckUtils]: 3: Hoare triple {35357#true} call #t~ret12 := main(); {35357#true} is VALID [2018-11-23 12:41:36,418 INFO L273 TraceCheckUtils]: 4: Hoare triple {35357#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {35357#true} is VALID [2018-11-23 12:41:36,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {35357#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {35357#true} is VALID [2018-11-23 12:41:36,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {35357#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {35357#true} is VALID [2018-11-23 12:41:36,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {35357#true} assume !(0 != ~p1~0); {35357#true} is VALID [2018-11-23 12:41:36,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {35357#true} assume !(0 != ~p2~0); {35357#true} is VALID [2018-11-23 12:41:36,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {35357#true} assume !(0 != ~p3~0); {35357#true} is VALID [2018-11-23 12:41:36,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {35357#true} assume !(0 != ~p4~0); {35357#true} is VALID [2018-11-23 12:41:36,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {35357#true} assume !(0 != ~p5~0); {35357#true} is VALID [2018-11-23 12:41:36,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {35357#true} assume !(0 != ~p6~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {35359#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {35359#(= main_~p6~0 0)} assume !(0 != ~p8~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {35359#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {35359#(= main_~p6~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {35359#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {35359#(= main_~p6~0 0)} assume !(0 != ~p1~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {35359#(= main_~p6~0 0)} assume !(0 != ~p2~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {35359#(= main_~p6~0 0)} assume !(0 != ~p3~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {35359#(= main_~p6~0 0)} assume !(0 != ~p4~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {35359#(= main_~p6~0 0)} assume !(0 != ~p5~0); {35359#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:36,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {35359#(= main_~p6~0 0)} assume 0 != ~p6~0; {35358#false} is VALID [2018-11-23 12:41:36,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {35358#false} assume 1 != ~lk6~0; {35358#false} is VALID [2018-11-23 12:41:36,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {35358#false} assume !false; {35358#false} is VALID [2018-11-23 12:41:36,431 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-23 12:41:36,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:36,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:36,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:36,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:36,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:36,456 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-23 12:41:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:36,457 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-11-23 12:41:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:37,845 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-11-23 12:41:37,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:37,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-23 12:41:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-23 12:41:37,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2018-11-23 12:41:38,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:38,233 INFO L225 Difference]: With dead ends: 3596 [2018-11-23 12:41:38,234 INFO L226 Difference]: Without dead ends: 2090 [2018-11-23 12:41:38,236 INFO L631 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-23 12:41:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-11-23 12:41:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-11-23 12:41:38,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:38,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2090 states. Second operand 2088 states. [2018-11-23 12:41:38,873 INFO L74 IsIncluded]: Start isIncluded. First operand 2090 states. Second operand 2088 states. [2018-11-23 12:41:38,873 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 2088 states. [2018-11-23 12:41:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:39,003 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2018-11-23 12:41:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2018-11-23 12:41:39,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:39,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:39,005 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand 2090 states. [2018-11-23 12:41:39,005 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand 2090 states. [2018-11-23 12:41:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:39,128 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2018-11-23 12:41:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2018-11-23 12:41:39,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:39,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:39,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:39,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-23 12:41:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-11-23 12:41:39,307 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-11-23 12:41:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:39,307 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-11-23 12:41:39,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-11-23 12:41:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:41:39,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:39,309 INFO L402 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, 1] [2018-11-23 12:41:39,309 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:39,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-11-23 12:41:39,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:39,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:39,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {45400#true} call ULTIMATE.init(); {45400#true} is VALID [2018-11-23 12:41:39,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {45400#true} assume true; {45400#true} is VALID [2018-11-23 12:41:39,519 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {45400#true} {45400#true} #214#return; {45400#true} is VALID [2018-11-23 12:41:39,519 INFO L256 TraceCheckUtils]: 3: Hoare triple {45400#true} call #t~ret12 := main(); {45400#true} is VALID [2018-11-23 12:41:39,520 INFO L273 TraceCheckUtils]: 4: Hoare triple {45400#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {45400#true} is VALID [2018-11-23 12:41:39,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {45400#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {45400#true} is VALID [2018-11-23 12:41:39,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {45400#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {45400#true} is VALID [2018-11-23 12:41:39,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {45400#true} assume !(0 != ~p1~0); {45400#true} is VALID [2018-11-23 12:41:39,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {45400#true} assume !(0 != ~p2~0); {45400#true} is VALID [2018-11-23 12:41:39,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {45400#true} assume !(0 != ~p3~0); {45400#true} is VALID [2018-11-23 12:41:39,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {45400#true} assume !(0 != ~p4~0); {45400#true} is VALID [2018-11-23 12:41:39,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {45400#true} assume !(0 != ~p5~0); {45400#true} is VALID [2018-11-23 12:41:39,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {45400#true} assume 0 != ~p6~0;~lk6~0 := 1; {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {45402#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {45402#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {45402#(not (= main_~p6~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {45402#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {45402#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:39,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {45402#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {45401#false} is VALID [2018-11-23 12:41:39,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {45401#false} assume 0 != ~p7~0; {45401#false} is VALID [2018-11-23 12:41:39,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {45401#false} assume 1 != ~lk7~0; {45401#false} is VALID [2018-11-23 12:41:39,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {45401#false} assume !false; {45401#false} is VALID [2018-11-23 12:41:39,564 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-23 12:41:39,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:39,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:39,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:39,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:39,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:39,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:39,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:39,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:39,590 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-11-23 12:41:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:41,045 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-11-23 12:41:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:41,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 12:41:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 12:41:41,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-23 12:41:41,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:41,423 INFO L225 Difference]: With dead ends: 3132 [2018-11-23 12:41:41,423 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 12:41:41,425 INFO L631 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-23 12:41:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 12:41:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-11-23 12:41:42,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:42,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 2120 states. [2018-11-23 12:41:42,424 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 2120 states. [2018-11-23 12:41:42,425 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 2120 states. [2018-11-23 12:41:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:42,553 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2018-11-23 12:41:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2018-11-23 12:41:42,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:42,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:42,555 INFO L74 IsIncluded]: Start isIncluded. First operand 2120 states. Second operand 2122 states. [2018-11-23 12:41:42,556 INFO L87 Difference]: Start difference. First operand 2120 states. Second operand 2122 states. [2018-11-23 12:41:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:42,681 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2018-11-23 12:41:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2018-11-23 12:41:42,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:42,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:42,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:42,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-23 12:41:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-11-23 12:41:42,825 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-11-23 12:41:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:42,825 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-11-23 12:41:42,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-11-23 12:41:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:41:42,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:42,827 INFO L402 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, 1] [2018-11-23 12:41:42,827 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:42,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-11-23 12:41:42,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:42,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:42,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {55075#true} call ULTIMATE.init(); {55075#true} is VALID [2018-11-23 12:41:42,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {55075#true} assume true; {55075#true} is VALID [2018-11-23 12:41:42,979 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {55075#true} {55075#true} #214#return; {55075#true} is VALID [2018-11-23 12:41:42,980 INFO L256 TraceCheckUtils]: 3: Hoare triple {55075#true} call #t~ret12 := main(); {55075#true} is VALID [2018-11-23 12:41:42,980 INFO L273 TraceCheckUtils]: 4: Hoare triple {55075#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {55075#true} is VALID [2018-11-23 12:41:42,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {55075#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {55075#true} is VALID [2018-11-23 12:41:42,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {55075#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {55075#true} is VALID [2018-11-23 12:41:42,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {55075#true} assume !(0 != ~p1~0); {55075#true} is VALID [2018-11-23 12:41:42,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {55075#true} assume !(0 != ~p2~0); {55075#true} is VALID [2018-11-23 12:41:42,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {55075#true} assume !(0 != ~p3~0); {55075#true} is VALID [2018-11-23 12:41:42,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {55075#true} assume !(0 != ~p4~0); {55075#true} is VALID [2018-11-23 12:41:42,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {55075#true} assume !(0 != ~p5~0); {55075#true} is VALID [2018-11-23 12:41:42,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {55075#true} assume !(0 != ~p6~0); {55075#true} is VALID [2018-11-23 12:41:42,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {55075#true} assume 0 != ~p7~0;~lk7~0 := 1; {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {55077#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {55077#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {55077#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:42,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:43,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:43,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {55077#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:43,004 INFO L273 TraceCheckUtils]: 24: Hoare triple {55077#(= main_~lk7~0 1)} assume 0 != ~p7~0; {55077#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:43,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {55077#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {55076#false} is VALID [2018-11-23 12:41:43,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {55076#false} assume !false; {55076#false} is VALID [2018-11-23 12:41:43,005 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-23 12:41:43,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:43,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:43,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:43,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:43,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:43,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:43,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:43,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:43,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:43,038 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-11-23 12:41:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:44,620 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-11-23 12:41:44,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:44,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 12:41:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 12:41:44,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2018-11-23 12:41:44,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:45,242 INFO L225 Difference]: With dead ends: 3724 [2018-11-23 12:41:45,242 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 12:41:45,243 INFO L631 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-23 12:41:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 12:41:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-11-23 12:41:45,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:45,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3080 states. [2018-11-23 12:41:45,848 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3080 states. [2018-11-23 12:41:45,848 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3080 states. [2018-11-23 12:41:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:46,332 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2018-11-23 12:41:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2018-11-23 12:41:46,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:46,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:46,336 INFO L74 IsIncluded]: Start isIncluded. First operand 3080 states. Second operand 3722 states. [2018-11-23 12:41:46,336 INFO L87 Difference]: Start difference. First operand 3080 states. Second operand 3722 states. [2018-11-23 12:41:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:46,859 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2018-11-23 12:41:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2018-11-23 12:41:46,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:46,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:46,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:46,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-11-23 12:41:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-11-23 12:41:47,242 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-11-23 12:41:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:47,243 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-11-23 12:41:47,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-11-23 12:41:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:41:47,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:47,245 INFO L402 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, 1] [2018-11-23 12:41:47,245 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:47,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-11-23 12:41:47,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:47,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:47,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {69534#true} call ULTIMATE.init(); {69534#true} is VALID [2018-11-23 12:41:47,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {69534#true} assume true; {69534#true} is VALID [2018-11-23 12:41:47,338 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {69534#true} {69534#true} #214#return; {69534#true} is VALID [2018-11-23 12:41:47,338 INFO L256 TraceCheckUtils]: 3: Hoare triple {69534#true} call #t~ret12 := main(); {69534#true} is VALID [2018-11-23 12:41:47,338 INFO L273 TraceCheckUtils]: 4: Hoare triple {69534#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {69534#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {69534#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {69534#true} assume !(0 != ~p1~0); {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {69534#true} assume !(0 != ~p2~0); {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {69534#true} assume !(0 != ~p3~0); {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {69534#true} assume !(0 != ~p4~0); {69534#true} is VALID [2018-11-23 12:41:47,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {69534#true} assume !(0 != ~p5~0); {69534#true} is VALID [2018-11-23 12:41:47,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {69534#true} assume !(0 != ~p6~0); {69534#true} is VALID [2018-11-23 12:41:47,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {69534#true} assume !(0 != ~p7~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p8~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {69536#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {69536#(= main_~p7~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {69536#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p1~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p2~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p3~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p4~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p5~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {69536#(= main_~p7~0 0)} assume !(0 != ~p6~0); {69536#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:47,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {69536#(= main_~p7~0 0)} assume 0 != ~p7~0; {69535#false} is VALID [2018-11-23 12:41:47,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {69535#false} assume 1 != ~lk7~0; {69535#false} is VALID [2018-11-23 12:41:47,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {69535#false} assume !false; {69535#false} is VALID [2018-11-23 12:41:47,352 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-23 12:41:47,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:47,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:47,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:47,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:47,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:47,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:47,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:47,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:47,377 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-11-23 12:41:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:51,807 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-11-23 12:41:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:51,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 12:41:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 12:41:51,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-23 12:41:51,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:52,625 INFO L225 Difference]: With dead ends: 7116 [2018-11-23 12:41:52,625 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 12:41:52,630 INFO L631 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-23 12:41:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 12:41:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-11-23 12:41:54,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:54,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 4104 states. [2018-11-23 12:41:54,206 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 4104 states. [2018-11-23 12:41:54,206 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 4104 states. [2018-11-23 12:41:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:54,814 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2018-11-23 12:41:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2018-11-23 12:41:54,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:54,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:54,819 INFO L74 IsIncluded]: Start isIncluded. First operand 4104 states. Second operand 4106 states. [2018-11-23 12:41:54,819 INFO L87 Difference]: Start difference. First operand 4104 states. Second operand 4106 states. [2018-11-23 12:41:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:55,447 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2018-11-23 12:41:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2018-11-23 12:41:55,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:55,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:55,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:55,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 12:41:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-11-23 12:41:56,132 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-11-23 12:41:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:56,132 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-11-23 12:41:56,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-11-23 12:41:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:41:56,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:56,135 INFO L402 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, 1, 1] [2018-11-23 12:41:56,135 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:56,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:56,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-11-23 12:41:56,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:56,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:56,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:56,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {89305#true} call ULTIMATE.init(); {89305#true} is VALID [2018-11-23 12:41:56,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {89305#true} assume true; {89305#true} is VALID [2018-11-23 12:41:56,222 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {89305#true} {89305#true} #214#return; {89305#true} is VALID [2018-11-23 12:41:56,222 INFO L256 TraceCheckUtils]: 3: Hoare triple {89305#true} call #t~ret12 := main(); {89305#true} is VALID [2018-11-23 12:41:56,222 INFO L273 TraceCheckUtils]: 4: Hoare triple {89305#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {89305#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {89305#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {89305#true} assume !(0 != ~p1~0); {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {89305#true} assume !(0 != ~p2~0); {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {89305#true} assume !(0 != ~p3~0); {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {89305#true} assume !(0 != ~p4~0); {89305#true} is VALID [2018-11-23 12:41:56,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {89305#true} assume !(0 != ~p5~0); {89305#true} is VALID [2018-11-23 12:41:56,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {89305#true} assume !(0 != ~p6~0); {89305#true} is VALID [2018-11-23 12:41:56,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {89305#true} assume 0 != ~p7~0;~lk7~0 := 1; {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {89307#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {89307#(not (= main_~p7~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {89307#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {89307#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:56,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {89307#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {89306#false} is VALID [2018-11-23 12:41:56,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {89306#false} assume 0 != ~p8~0; {89306#false} is VALID [2018-11-23 12:41:56,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {89306#false} assume 1 != ~lk8~0; {89306#false} is VALID [2018-11-23 12:41:56,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {89306#false} assume !false; {89306#false} is VALID [2018-11-23 12:41:56,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-23 12:41:56,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:56,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:41:56,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:56,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:56,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:56,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:56,267 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-11-23 12:41:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:58,871 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-11-23 12:41:58,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:58,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:41:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:41:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:41:58,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 12:41:59,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:59,866 INFO L225 Difference]: With dead ends: 6156 [2018-11-23 12:41:59,866 INFO L226 Difference]: Without dead ends: 4170 [2018-11-23 12:41:59,870 INFO L631 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-23 12:41:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-23 12:42:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-11-23 12:42:01,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:01,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4170 states. Second operand 4168 states. [2018-11-23 12:42:01,405 INFO L74 IsIncluded]: Start isIncluded. First operand 4170 states. Second operand 4168 states. [2018-11-23 12:42:01,406 INFO L87 Difference]: Start difference. First operand 4170 states. Second operand 4168 states. [2018-11-23 12:42:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,040 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2018-11-23 12:42:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2018-11-23 12:42:02,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:02,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:02,045 INFO L74 IsIncluded]: Start isIncluded. First operand 4168 states. Second operand 4170 states. [2018-11-23 12:42:02,045 INFO L87 Difference]: Start difference. First operand 4168 states. Second operand 4170 states. [2018-11-23 12:42:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,707 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2018-11-23 12:42:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2018-11-23 12:42:02,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:02,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:02,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:02,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-11-23 12:42:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-11-23 12:42:03,398 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-11-23 12:42:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:03,399 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-11-23 12:42:03,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-11-23 12:42:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:03,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:03,402 INFO L402 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, 1, 1] [2018-11-23 12:42:03,402 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-11-23 12:42:03,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:03,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {108308#true} call ULTIMATE.init(); {108308#true} is VALID [2018-11-23 12:42:03,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {108308#true} assume true; {108308#true} is VALID [2018-11-23 12:42:03,491 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108308#true} {108308#true} #214#return; {108308#true} is VALID [2018-11-23 12:42:03,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {108308#true} call #t~ret12 := main(); {108308#true} is VALID [2018-11-23 12:42:03,491 INFO L273 TraceCheckUtils]: 4: Hoare triple {108308#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {108308#true} is VALID [2018-11-23 12:42:03,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {108308#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {108308#true} is VALID [2018-11-23 12:42:03,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {108308#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {108308#true} is VALID [2018-11-23 12:42:03,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {108308#true} assume !(0 != ~p1~0); {108308#true} is VALID [2018-11-23 12:42:03,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {108308#true} assume !(0 != ~p2~0); {108308#true} is VALID [2018-11-23 12:42:03,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {108308#true} assume !(0 != ~p3~0); {108308#true} is VALID [2018-11-23 12:42:03,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {108308#true} assume !(0 != ~p4~0); {108308#true} is VALID [2018-11-23 12:42:03,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {108308#true} assume !(0 != ~p5~0); {108308#true} is VALID [2018-11-23 12:42:03,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {108308#true} assume !(0 != ~p6~0); {108308#true} is VALID [2018-11-23 12:42:03,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {108308#true} assume !(0 != ~p7~0); {108308#true} is VALID [2018-11-23 12:42:03,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {108308#true} assume !(0 != ~p8~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {108310#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {108310#(= main_~p8~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {108310#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p1~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p2~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p3~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p4~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p5~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p6~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {108310#(= main_~p8~0 0)} assume !(0 != ~p7~0); {108310#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:03,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {108310#(= main_~p8~0 0)} assume 0 != ~p8~0; {108309#false} is VALID [2018-11-23 12:42:03,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {108309#false} assume 1 != ~lk8~0; {108309#false} is VALID [2018-11-23 12:42:03,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {108309#false} assume !false; {108309#false} is VALID [2018-11-23 12:42:03,519 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-23 12:42:03,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:03,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:03,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:03,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:03,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:03,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:03,553 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-11-23 12:42:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:12,439 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-11-23 12:42:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:12,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 12:42:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-23 12:42:12,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-23 12:42:12,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:15,416 INFO L225 Difference]: With dead ends: 12108 [2018-11-23 12:42:15,416 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 12:42:15,421 INFO L631 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-23 12:42:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 12:42:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-11-23 12:42:18,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:18,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 8072 states. [2018-11-23 12:42:18,636 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 8072 states. [2018-11-23 12:42:18,636 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 8072 states. [2018-11-23 12:42:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:21,090 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2018-11-23 12:42:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2018-11-23 12:42:21,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:21,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:21,096 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 8074 states. [2018-11-23 12:42:21,096 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 8074 states. [2018-11-23 12:42:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:23,618 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2018-11-23 12:42:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2018-11-23 12:42:23,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:23,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:23,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:23,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 12:42:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-11-23 12:42:26,443 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-11-23 12:42:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:26,444 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-11-23 12:42:26,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-11-23 12:42:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:26,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:26,447 INFO L402 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, 1, 1] [2018-11-23 12:42:26,447 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:26,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-11-23 12:42:26,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:26,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:26,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {145295#true} call ULTIMATE.init(); {145295#true} is VALID [2018-11-23 12:42:26,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {145295#true} assume true; {145295#true} is VALID [2018-11-23 12:42:26,659 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {145295#true} {145295#true} #214#return; {145295#true} is VALID [2018-11-23 12:42:26,659 INFO L256 TraceCheckUtils]: 3: Hoare triple {145295#true} call #t~ret12 := main(); {145295#true} is VALID [2018-11-23 12:42:26,659 INFO L273 TraceCheckUtils]: 4: Hoare triple {145295#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {145295#true} is VALID [2018-11-23 12:42:26,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {145295#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {145295#true} is VALID [2018-11-23 12:42:26,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {145295#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {145295#true} is VALID [2018-11-23 12:42:26,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {145295#true} assume !(0 != ~p1~0); {145295#true} is VALID [2018-11-23 12:42:26,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {145295#true} assume !(0 != ~p2~0); {145295#true} is VALID [2018-11-23 12:42:26,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {145295#true} assume !(0 != ~p3~0); {145295#true} is VALID [2018-11-23 12:42:26,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {145295#true} assume !(0 != ~p4~0); {145295#true} is VALID [2018-11-23 12:42:26,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {145295#true} assume !(0 != ~p5~0); {145295#true} is VALID [2018-11-23 12:42:26,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {145295#true} assume !(0 != ~p6~0); {145295#true} is VALID [2018-11-23 12:42:26,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {145295#true} assume !(0 != ~p7~0); {145295#true} is VALID [2018-11-23 12:42:26,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {145295#true} assume 0 != ~p8~0;~lk8~0 := 1; {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {145297#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {145297#(= main_~lk8~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {145297#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {145297#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {145297#(= main_~lk8~0 1)} assume 0 != ~p8~0; {145297#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:26,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {145297#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {145296#false} is VALID [2018-11-23 12:42:26,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {145296#false} assume !false; {145296#false} is VALID [2018-11-23 12:42:26,778 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-23 12:42:26,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:26,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:26,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:26,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:26,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:26,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:26,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:26,805 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-11-23 12:42:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:34,634 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-11-23 12:42:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:34,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 12:42:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 12:42:34,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2018-11-23 12:42:34,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:38,466 INFO L225 Difference]: With dead ends: 9100 [2018-11-23 12:42:38,466 INFO L226 Difference]: Without dead ends: 9098 [2018-11-23 12:42:38,468 INFO L631 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-23 12:42:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-11-23 12:42:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-11-23 12:42:43,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:43,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9098 states. Second operand 8072 states. [2018-11-23 12:42:43,881 INFO L74 IsIncluded]: Start isIncluded. First operand 9098 states. Second operand 8072 states. [2018-11-23 12:42:43,882 INFO L87 Difference]: Start difference. First operand 9098 states. Second operand 8072 states. [2018-11-23 12:42:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,160 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2018-11-23 12:42:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2018-11-23 12:42:47,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,168 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 9098 states. [2018-11-23 12:42:47,169 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 9098 states. [2018-11-23 12:42:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,408 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2018-11-23 12:42:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2018-11-23 12:42:50,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:50,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 12:42:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-11-23 12:42:52,855 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-11-23 12:42:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:52,855 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-11-23 12:42:52,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-11-23 12:42:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:52,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:52,860 INFO L402 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, 1, 1, 1] [2018-11-23 12:42:52,860 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:52,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-11-23 12:42:52,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:52,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:52,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:52,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:52,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:52,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {181322#true} call ULTIMATE.init(); {181322#true} is VALID [2018-11-23 12:42:52,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {181322#true} assume true; {181322#true} is VALID [2018-11-23 12:42:52,927 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {181322#true} {181322#true} #214#return; {181322#true} is VALID [2018-11-23 12:42:52,927 INFO L256 TraceCheckUtils]: 3: Hoare triple {181322#true} call #t~ret12 := main(); {181322#true} is VALID [2018-11-23 12:42:52,927 INFO L273 TraceCheckUtils]: 4: Hoare triple {181322#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {181322#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {181322#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {181322#true} assume !(0 != ~p1~0); {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {181322#true} assume !(0 != ~p2~0); {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {181322#true} assume !(0 != ~p3~0); {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {181322#true} assume !(0 != ~p4~0); {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {181322#true} assume !(0 != ~p5~0); {181322#true} is VALID [2018-11-23 12:42:52,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {181322#true} assume !(0 != ~p6~0); {181322#true} is VALID [2018-11-23 12:42:52,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {181322#true} assume !(0 != ~p7~0); {181322#true} is VALID [2018-11-23 12:42:52,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {181322#true} assume !(0 != ~p8~0); {181322#true} is VALID [2018-11-23 12:42:52,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {181322#true} assume 0 != ~p9~0;~lk9~0 := 1; {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {181324#(= main_~lk9~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {181324#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,933 INFO L273 TraceCheckUtils]: 24: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {181324#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {181324#(= main_~lk9~0 1)} assume 0 != ~p9~0; {181324#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:52,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {181324#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {181323#false} is VALID [2018-11-23 12:42:52,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {181323#false} assume !false; {181323#false} is VALID [2018-11-23 12:42:52,936 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-23 12:42:52,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:52,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:52,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:52,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:52,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:52,964 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-11-23 12:43:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,111 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-11-23 12:43:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:09,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:43:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:43:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:43:09,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 12:43:09,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:17,496 INFO L225 Difference]: With dead ends: 13708 [2018-11-23 12:43:17,496 INFO L226 Difference]: Without dead ends: 13706 [2018-11-23 12:43:17,500 INFO L631 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-23 12:43:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-11-23 12:43:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-11-23 12:43:21,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:21,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13706 states. Second operand 12168 states. [2018-11-23 12:43:21,945 INFO L74 IsIncluded]: Start isIncluded. First operand 13706 states. Second operand 12168 states. [2018-11-23 12:43:21,945 INFO L87 Difference]: Start difference. First operand 13706 states. Second operand 12168 states. [2018-11-23 12:43:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:29,828 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2018-11-23 12:43:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2018-11-23 12:43:29,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:29,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:29,839 INFO L74 IsIncluded]: Start isIncluded. First operand 12168 states. Second operand 13706 states. [2018-11-23 12:43:29,840 INFO L87 Difference]: Start difference. First operand 12168 states. Second operand 13706 states. [2018-11-23 12:43:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:38,279 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2018-11-23 12:43:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2018-11-23 12:43:38,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:38,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:38,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:38,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-23 12:43:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-11-23 12:43:45,171 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-11-23 12:43:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:45,171 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-11-23 12:43:45,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-11-23 12:43:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:43:45,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:45,178 INFO L402 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, 1, 1, 1] [2018-11-23 12:43:45,179 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:45,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-11-23 12:43:45,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:45,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {235397#true} call ULTIMATE.init(); {235397#true} is VALID [2018-11-23 12:43:45,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {235397#true} assume true; {235397#true} is VALID [2018-11-23 12:43:45,387 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {235397#true} {235397#true} #214#return; {235397#true} is VALID [2018-11-23 12:43:45,387 INFO L256 TraceCheckUtils]: 3: Hoare triple {235397#true} call #t~ret12 := main(); {235397#true} is VALID [2018-11-23 12:43:45,387 INFO L273 TraceCheckUtils]: 4: Hoare triple {235397#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;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {235397#true} is VALID [2018-11-23 12:43:45,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {235397#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {235397#true} is VALID [2018-11-23 12:43:45,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {235397#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {235397#true} is VALID [2018-11-23 12:43:45,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {235397#true} assume !(0 != ~p1~0); {235397#true} is VALID [2018-11-23 12:43:45,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {235397#true} assume !(0 != ~p2~0); {235397#true} is VALID [2018-11-23 12:43:45,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {235397#true} assume !(0 != ~p3~0); {235397#true} is VALID [2018-11-23 12:43:45,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {235397#true} assume !(0 != ~p4~0); {235397#true} is VALID [2018-11-23 12:43:45,389 INFO L273 TraceCheckUtils]: 11: Hoare triple {235397#true} assume !(0 != ~p5~0); {235397#true} is VALID [2018-11-23 12:43:45,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {235397#true} assume !(0 != ~p6~0); {235397#true} is VALID [2018-11-23 12:43:45,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {235397#true} assume !(0 != ~p7~0); {235397#true} is VALID [2018-11-23 12:43:45,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {235397#true} assume !(0 != ~p8~0); {235397#true} is VALID [2018-11-23 12:43:45,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {235397#true} assume !(0 != ~p9~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {235399#(= main_~p9~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {235399#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p1~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p2~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p3~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p4~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p5~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p6~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p7~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {235399#(= main_~p9~0 0)} assume !(0 != ~p8~0); {235399#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:45,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {235399#(= main_~p9~0 0)} assume 0 != ~p9~0; {235398#false} is VALID [2018-11-23 12:43:45,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {235398#false} assume 1 != ~lk9~0; {235398#false} is VALID [2018-11-23 12:43:45,544 INFO L273 TraceCheckUtils]: 28: Hoare triple {235398#false} assume !false; {235398#false} is VALID [2018-11-23 12:43:45,545 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-23 12:43:45,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:45,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:45,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:43:45,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:45,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:45,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:45,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:45,821 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-11-23 12:44:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:41,152 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-11-23 12:44:41,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:41,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:44:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-23 12:44:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-23 12:44:41,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2018-11-23 12:44:41,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.