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_15_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:42:30,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:42:30,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:42:30,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:42:30,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:42:30,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:42:30,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:42:30,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:42:30,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:42:30,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:42:30,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:42:30,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:42:30,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:42:30,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:42:30,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:42:30,610 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:42:30,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:42:30,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:42:30,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:42:30,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:42:30,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:42:30,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:42:30,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:42:30,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:42:30,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:42:30,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:42:30,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:42:30,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:42:30,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:42:30,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:42:30,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:42:30,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:42:30,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:42:30,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:42:30,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:42:30,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:42:30,637 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:42:30,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:42:30,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:42:30,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:42:30,666 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:42:30,667 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:42:30,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:42:30,667 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:42:30,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:42:30,668 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:42:30,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:42:30,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:42:30,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:42:30,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:42:30,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:42:30,669 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:42:30,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:42:30,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:42:30,669 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:42:30,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:42:30,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:42:30,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:42:30,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:42:30,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:42:30,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:42:30,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:42:30,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:42:30,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:42:30,671 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:42:30,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:42:30,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:42:30,672 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:42:30,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:42:30,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:42:30,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:42:30,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:42:30,755 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:42:30,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:30,826 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d2ebe7f/f65e8d1e6f1a4d139f7167aa71b0bfbe/FLAGcd23cf7ca [2018-11-23 12:42:31,256 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:42:31,257 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:31,267 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d2ebe7f/f65e8d1e6f1a4d139f7167aa71b0bfbe/FLAGcd23cf7ca [2018-11-23 12:42:31,622 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d2ebe7f/f65e8d1e6f1a4d139f7167aa71b0bfbe [2018-11-23 12:42:31,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:42:31,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:42:31,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:31,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:42:31,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:42:31,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:31" (1/1) ... [2018-11-23 12:42:31,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a75136c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:31, skipping insertion in model container [2018-11-23 12:42:31,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:31" (1/1) ... [2018-11-23 12:42:31,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:42:31,683 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:42:31,929 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:31,935 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:42:32,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:32,026 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:42:32,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32 WrapperNode [2018-11-23 12:42:32,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:32,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:32,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:42:32,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:42:32,037 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:42:32" (1/1) ... [2018-11-23 12:42:32,046 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:42:32" (1/1) ... [2018-11-23 12:42:32,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:32,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:42:32,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:42:32,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:42:32,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (1/1) ... [2018-11-23 12:42:32,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:42:32,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:42:32,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:42:32,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:42:32,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (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:42:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:42:32,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:42:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:42:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:42:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:42:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:42:33,401 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:42:33,401 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:42:33,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:33 BoogieIcfgContainer [2018-11-23 12:42:33,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:42:33,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:42:33,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:42:33,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:42:33,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:42:31" (1/3) ... [2018-11-23 12:42:33,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfe6b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:33, skipping insertion in model container [2018-11-23 12:42:33,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:32" (2/3) ... [2018-11-23 12:42:33,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfe6b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:33, skipping insertion in model container [2018-11-23 12:42:33,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:33" (3/3) ... [2018-11-23 12:42:33,413 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:33,424 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:42:33,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:42:33,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:42:33,485 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:42:33,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:42:33,486 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:42:33,486 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:42:33,487 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:42:33,487 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:42:33,487 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:42:33,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:42:33,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:42:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 12:42:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:33,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:33,516 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:42:33,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:33,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-11-23 12:42:33,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:33,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:33,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:33,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {62#true} is VALID [2018-11-23 12:42:33,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-23 12:42:33,895 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {62#true} {62#true} #282#return; {62#true} is VALID [2018-11-23 12:42:33,895 INFO L256 TraceCheckUtils]: 3: Hoare triple {62#true} call #t~ret16 := main(); {62#true} is VALID [2018-11-23 12:42:33,896 INFO L273 TraceCheckUtils]: 4: Hoare triple {62#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {62#true} is VALID [2018-11-23 12:42:33,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {62#true} is VALID [2018-11-23 12:42:33,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {62#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {62#true} is VALID [2018-11-23 12:42:33,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {62#true} assume 0 != ~p1~0;~lk1~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,917 INFO L273 TraceCheckUtils]: 12: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {64#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {64#(= main_~lk1~0 1)} assume 0 != ~p1~0; {64#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:33,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {64#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {63#false} is VALID [2018-11-23 12:42:33,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {63#false} assume !false; {63#false} is VALID [2018-11-23 12:42:33,951 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:33,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:33,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:33,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:33,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:33,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:34,036 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:42:34,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:34,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:34,047 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-23 12:42:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,145 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-11-23 12:42:35,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:35,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-23 12:42:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-23 12:42:35,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 210 transitions. [2018-11-23 12:42:35,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:35,669 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:42:35,669 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 12:42:35,673 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:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 12:42:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-11-23 12:42:35,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:35,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 70 states. [2018-11-23 12:42:35,730 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 70 states. [2018-11-23 12:42:35,730 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 70 states. [2018-11-23 12:42:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,741 INFO L93 Difference]: Finished difference Result 102 states and 188 transitions. [2018-11-23 12:42:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 188 transitions. [2018-11-23 12:42:35,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:35,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:35,743 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 102 states. [2018-11-23 12:42:35,744 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 102 states. [2018-11-23 12:42:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,754 INFO L93 Difference]: Finished difference Result 102 states and 188 transitions. [2018-11-23 12:42:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 188 transitions. [2018-11-23 12:42:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:35,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:35,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:35,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:42:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-11-23 12:42:35,764 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-11-23 12:42:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:35,764 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-11-23 12:42:35,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-11-23 12:42:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:35,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:35,766 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:42:35,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:35,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-11-23 12:42:35,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:35,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:35,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:35,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:35,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {476#true} call ULTIMATE.init(); {476#true} is VALID [2018-11-23 12:42:35,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {476#true} assume true; {476#true} is VALID [2018-11-23 12:42:35,914 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {476#true} {476#true} #282#return; {476#true} is VALID [2018-11-23 12:42:35,914 INFO L256 TraceCheckUtils]: 3: Hoare triple {476#true} call #t~ret16 := main(); {476#true} is VALID [2018-11-23 12:42:35,915 INFO L273 TraceCheckUtils]: 4: Hoare triple {476#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {476#true} is VALID [2018-11-23 12:42:35,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {476#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {476#true} is VALID [2018-11-23 12:42:35,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {476#true} is VALID [2018-11-23 12:42:35,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {476#true} assume !(0 != ~p1~0); {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {478#(= main_~p1~0 0)} assume !(0 != ~p8~0); {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {478#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:35,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {478#(= main_~p1~0 0)} assume 0 != ~p1~0; {477#false} is VALID [2018-11-23 12:42:35,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {477#false} assume 1 != ~lk1~0; {477#false} is VALID [2018-11-23 12:42:35,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {477#false} assume !false; {477#false} is VALID [2018-11-23 12:42:35,969 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:35,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:35,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:35,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:35,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:35,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:36,020 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:42:36,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:36,021 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-11-23 12:42:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:36,287 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-11-23 12:42:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:36,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2018-11-23 12:42:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2018-11-23 12:42:36,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 281 transitions. [2018-11-23 12:42:36,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:36,714 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:42:36,715 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 12:42:36,716 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:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 12:42:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-23 12:42:36,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:36,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2018-11-23 12:42:36,769 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2018-11-23 12:42:36,769 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2018-11-23 12:42:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:36,774 INFO L93 Difference]: Finished difference Result 102 states and 186 transitions. [2018-11-23 12:42:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 186 transitions. [2018-11-23 12:42:36,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:36,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:36,776 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2018-11-23 12:42:36,776 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2018-11-23 12:42:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:36,782 INFO L93 Difference]: Finished difference Result 102 states and 186 transitions. [2018-11-23 12:42:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 186 transitions. [2018-11-23 12:42:36,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:36,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:36,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:36,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:42:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-11-23 12:42:36,790 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-11-23 12:42:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:36,790 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-11-23 12:42:36,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-11-23 12:42:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:36,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:36,792 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:42:36,793 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:36,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-11-23 12:42:36,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:36,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:36,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {969#true} call ULTIMATE.init(); {969#true} is VALID [2018-11-23 12:42:36,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {969#true} assume true; {969#true} is VALID [2018-11-23 12:42:36,877 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {969#true} {969#true} #282#return; {969#true} is VALID [2018-11-23 12:42:36,877 INFO L256 TraceCheckUtils]: 3: Hoare triple {969#true} call #t~ret16 := main(); {969#true} is VALID [2018-11-23 12:42:36,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {969#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {969#true} is VALID [2018-11-23 12:42:36,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {969#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {969#true} is VALID [2018-11-23 12:42:36,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {969#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {969#true} is VALID [2018-11-23 12:42:36,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {969#true} assume 0 != ~p1~0;~lk1~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {971#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {971#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:36,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {971#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {970#false} is VALID [2018-11-23 12:42:36,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {970#false} assume 0 != ~p2~0; {970#false} is VALID [2018-11-23 12:42:36,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {970#false} assume 1 != ~lk2~0; {970#false} is VALID [2018-11-23 12:42:36,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {970#false} assume !false; {970#false} is VALID [2018-11-23 12:42:36,941 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:36,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:36,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:36,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:36,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:36,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:36,976 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:42:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:36,978 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-11-23 12:42:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,280 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-11-23 12:42:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:37,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2018-11-23 12:42:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2018-11-23 12:42:37,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 276 transitions. [2018-11-23 12:42:37,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:37,590 INFO L225 Difference]: With dead ends: 153 [2018-11-23 12:42:37,590 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:42:37,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:42:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:42:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:42:37,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:37,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:42:37,625 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:42:37,625 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:42:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,630 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2018-11-23 12:42:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 188 transitions. [2018-11-23 12:42:37,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:37,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:37,631 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:42:37,631 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:42:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,637 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2018-11-23 12:42:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 188 transitions. [2018-11-23 12:42:37,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:37,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:37,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:37,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:42:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-11-23 12:42:37,643 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-11-23 12:42:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:37,644 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-11-23 12:42:37,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-11-23 12:42:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:37,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:37,645 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:42:37,645 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:37,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:37,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-11-23 12:42:37,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:37,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:37,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:37,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:37,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:37,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2018-11-23 12:42:37,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {1459#true} assume true; {1459#true} is VALID [2018-11-23 12:42:37,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1459#true} {1459#true} #282#return; {1459#true} is VALID [2018-11-23 12:42:37,741 INFO L256 TraceCheckUtils]: 3: Hoare triple {1459#true} call #t~ret16 := main(); {1459#true} is VALID [2018-11-23 12:42:37,741 INFO L273 TraceCheckUtils]: 4: Hoare triple {1459#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {1459#true} is VALID [2018-11-23 12:42:37,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {1459#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1459#true} is VALID [2018-11-23 12:42:37,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {1459#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1459#true} is VALID [2018-11-23 12:42:37,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {1459#true} assume !(0 != ~p1~0); {1459#true} is VALID [2018-11-23 12:42:37,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {1459#true} assume 0 != ~p2~0;~lk2~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {1461#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {1461#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1461#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:37,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {1461#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1460#false} is VALID [2018-11-23 12:42:37,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2018-11-23 12:42:37,765 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:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:37,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:37,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:37,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:37,819 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:42:37,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:37,820 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-11-23 12:42:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:38,139 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-11-23 12:42:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:38,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:42:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:42:38,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 12:42:38,369 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:42:38,375 INFO L225 Difference]: With dead ends: 196 [2018-11-23 12:42:38,375 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 12:42:38,376 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:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 12:42:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-11-23 12:42:38,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:38,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 136 states. [2018-11-23 12:42:38,413 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 136 states. [2018-11-23 12:42:38,413 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 136 states. [2018-11-23 12:42:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:38,421 INFO L93 Difference]: Finished difference Result 194 states and 357 transitions. [2018-11-23 12:42:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 357 transitions. [2018-11-23 12:42:38,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:38,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:38,423 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 194 states. [2018-11-23 12:42:38,423 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 194 states. [2018-11-23 12:42:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:38,432 INFO L93 Difference]: Finished difference Result 194 states and 357 transitions. [2018-11-23 12:42:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 357 transitions. [2018-11-23 12:42:38,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:38,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:38,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:38,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:42:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-11-23 12:42:38,439 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-11-23 12:42:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:38,440 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-11-23 12:42:38,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-11-23 12:42:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:38,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:38,441 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:42:38,441 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:38,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-11-23 12:42:38,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:38,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:38,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:38,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:38,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2204#true} is VALID [2018-11-23 12:42:38,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {2204#true} assume true; {2204#true} is VALID [2018-11-23 12:42:38,534 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2204#true} {2204#true} #282#return; {2204#true} is VALID [2018-11-23 12:42:38,534 INFO L256 TraceCheckUtils]: 3: Hoare triple {2204#true} call #t~ret16 := main(); {2204#true} is VALID [2018-11-23 12:42:38,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {2204#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {2204#true} is VALID [2018-11-23 12:42:38,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {2204#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2204#true} is VALID [2018-11-23 12:42:38,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {2204#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2204#true} is VALID [2018-11-23 12:42:38,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {2204#true} assume !(0 != ~p1~0); {2204#true} is VALID [2018-11-23 12:42:38,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {2204#true} assume !(0 != ~p2~0); {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#(= main_~p2~0 0)} assume !(0 != ~p8~0); {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2206#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:38,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#(= main_~p2~0 0)} assume 0 != ~p2~0; {2205#false} is VALID [2018-11-23 12:42:38,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {2205#false} assume 1 != ~lk2~0; {2205#false} is VALID [2018-11-23 12:42:38,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {2205#false} assume !false; {2205#false} is VALID [2018-11-23 12:42:38,573 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:38,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:38,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:38,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:38,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:38,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:38,601 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:42:38,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:38,603 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-11-23 12:42:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:39,215 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-11-23 12:42:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:39,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2018-11-23 12:42:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2018-11-23 12:42:39,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 278 transitions. [2018-11-23 12:42:39,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:39,665 INFO L225 Difference]: With dead ends: 324 [2018-11-23 12:42:39,666 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 12:42:39,667 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:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 12:42:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-11-23 12:42:39,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:39,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 194 states. [2018-11-23 12:42:39,696 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 194 states. [2018-11-23 12:42:39,696 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 194 states. [2018-11-23 12:42:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:39,705 INFO L93 Difference]: Finished difference Result 196 states and 355 transitions. [2018-11-23 12:42:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 355 transitions. [2018-11-23 12:42:39,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:39,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:39,706 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 196 states. [2018-11-23 12:42:39,706 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 196 states. [2018-11-23 12:42:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:39,715 INFO L93 Difference]: Finished difference Result 196 states and 355 transitions. [2018-11-23 12:42:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 355 transitions. [2018-11-23 12:42:39,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:39,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:39,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:39,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-23 12:42:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-11-23 12:42:39,724 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-11-23 12:42:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:39,725 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-11-23 12:42:39,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-11-23 12:42:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:39,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:39,726 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:42:39,726 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:39,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-11-23 12:42:39,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:39,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {3143#true} call ULTIMATE.init(); {3143#true} is VALID [2018-11-23 12:42:39,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {3143#true} assume true; {3143#true} is VALID [2018-11-23 12:42:39,969 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3143#true} {3143#true} #282#return; {3143#true} is VALID [2018-11-23 12:42:39,969 INFO L256 TraceCheckUtils]: 3: Hoare triple {3143#true} call #t~ret16 := main(); {3143#true} is VALID [2018-11-23 12:42:39,970 INFO L273 TraceCheckUtils]: 4: Hoare triple {3143#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {3143#true} is VALID [2018-11-23 12:42:39,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {3143#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3143#true} is VALID [2018-11-23 12:42:39,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {3143#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3143#true} is VALID [2018-11-23 12:42:39,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {3143#true} assume !(0 != ~p1~0); {3143#true} is VALID [2018-11-23 12:42:39,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {3143#true} assume 0 != ~p2~0;~lk2~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:39,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {3145#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {3145#(not (= main_~p2~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {3145#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {3145#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:40,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {3145#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {3144#false} is VALID [2018-11-23 12:42:40,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {3144#false} assume 0 != ~p3~0; {3144#false} is VALID [2018-11-23 12:42:40,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {3144#false} assume 1 != ~lk3~0; {3144#false} is VALID [2018-11-23 12:42:40,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {3144#false} assume !false; {3144#false} is VALID [2018-11-23 12:42:40,118 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:40,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:40,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:40,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:40,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:40,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:40,147 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:42:40,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:40,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:40,148 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-11-23 12:42:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:40,470 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-11-23 12:42:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:40,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2018-11-23 12:42:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2018-11-23 12:42:40,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2018-11-23 12:42:40,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:40,764 INFO L225 Difference]: With dead ends: 291 [2018-11-23 12:42:40,764 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 12:42:40,765 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:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 12:42:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-23 12:42:40,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:40,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 196 states. [2018-11-23 12:42:40,801 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 196 states. [2018-11-23 12:42:40,802 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 196 states. [2018-11-23 12:42:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:40,810 INFO L93 Difference]: Finished difference Result 198 states and 355 transitions. [2018-11-23 12:42:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 355 transitions. [2018-11-23 12:42:40,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:40,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 198 states. [2018-11-23 12:42:40,811 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 198 states. [2018-11-23 12:42:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:40,818 INFO L93 Difference]: Finished difference Result 198 states and 355 transitions. [2018-11-23 12:42:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 355 transitions. [2018-11-23 12:42:40,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:40,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:40,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:40,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 12:42:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-11-23 12:42:40,842 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-11-23 12:42:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:40,843 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-11-23 12:42:40,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-11-23 12:42:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:40,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:40,844 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:42:40,844 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:40,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-11-23 12:42:40,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:40,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:40,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:41,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {4055#true} call ULTIMATE.init(); {4055#true} is VALID [2018-11-23 12:42:41,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {4055#true} assume true; {4055#true} is VALID [2018-11-23 12:42:41,103 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4055#true} {4055#true} #282#return; {4055#true} is VALID [2018-11-23 12:42:41,103 INFO L256 TraceCheckUtils]: 3: Hoare triple {4055#true} call #t~ret16 := main(); {4055#true} is VALID [2018-11-23 12:42:41,103 INFO L273 TraceCheckUtils]: 4: Hoare triple {4055#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {4055#true} is VALID [2018-11-23 12:42:41,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {4055#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {4055#true} is VALID [2018-11-23 12:42:41,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {4055#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4055#true} is VALID [2018-11-23 12:42:41,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {4055#true} assume !(0 != ~p1~0); {4055#true} is VALID [2018-11-23 12:42:41,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {4055#true} assume !(0 != ~p2~0); {4055#true} is VALID [2018-11-23 12:42:41,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {4055#true} assume 0 != ~p3~0;~lk3~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {4057#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {4057#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {4057#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {4057#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4057#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:41,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {4057#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4056#false} is VALID [2018-11-23 12:42:41,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {4056#false} assume !false; {4056#false} is VALID [2018-11-23 12:42:41,204 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:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:41,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:41,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:41,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:41,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:41,277 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:42:41,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:41,278 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-11-23 12:42:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:41,627 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-11-23 12:42:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:41,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2018-11-23 12:42:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2018-11-23 12:42:41,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2018-11-23 12:42:42,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:42,408 INFO L225 Difference]: With dead ends: 372 [2018-11-23 12:42:42,408 INFO L226 Difference]: Without dead ends: 370 [2018-11-23 12:42:42,409 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:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-23 12:42:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-11-23 12:42:42,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:42,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand 264 states. [2018-11-23 12:42:42,434 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand 264 states. [2018-11-23 12:42:42,435 INFO L87 Difference]: Start difference. First operand 370 states. Second operand 264 states. [2018-11-23 12:42:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,445 INFO L93 Difference]: Finished difference Result 370 states and 675 transitions. [2018-11-23 12:42:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 675 transitions. [2018-11-23 12:42:42,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:42,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:42,447 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 370 states. [2018-11-23 12:42:42,447 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 370 states. [2018-11-23 12:42:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,457 INFO L93 Difference]: Finished difference Result 370 states and 675 transitions. [2018-11-23 12:42:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 675 transitions. [2018-11-23 12:42:42,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:42,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:42,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:42,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 12:42:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-11-23 12:42:42,466 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-11-23 12:42:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:42,467 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-11-23 12:42:42,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-11-23 12:42:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:42,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:42,468 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:42:42,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:42,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-11-23 12:42:42,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:42,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:42,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:42,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {5462#true} call ULTIMATE.init(); {5462#true} is VALID [2018-11-23 12:42:42,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {5462#true} assume true; {5462#true} is VALID [2018-11-23 12:42:42,700 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5462#true} {5462#true} #282#return; {5462#true} is VALID [2018-11-23 12:42:42,700 INFO L256 TraceCheckUtils]: 3: Hoare triple {5462#true} call #t~ret16 := main(); {5462#true} is VALID [2018-11-23 12:42:42,700 INFO L273 TraceCheckUtils]: 4: Hoare triple {5462#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {5462#true} is VALID [2018-11-23 12:42:42,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {5462#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5462#true} is VALID [2018-11-23 12:42:42,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {5462#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {5462#true} is VALID [2018-11-23 12:42:42,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {5462#true} assume !(0 != ~p1~0); {5462#true} is VALID [2018-11-23 12:42:42,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {5462#true} assume !(0 != ~p2~0); {5462#true} is VALID [2018-11-23 12:42:42,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {5462#true} assume !(0 != ~p3~0); {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {5464#(= main_~p3~0 0)} assume !(0 != ~p8~0); {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {5464#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {5464#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5464#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:42,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {5464#(= main_~p3~0 0)} assume 0 != ~p3~0; {5463#false} is VALID [2018-11-23 12:42:42,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {5463#false} assume 1 != ~lk3~0; {5463#false} is VALID [2018-11-23 12:42:42,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {5463#false} assume !false; {5463#false} is VALID [2018-11-23 12:42:42,904 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:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:42,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:42,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:42,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:42,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:43,038 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:42:43,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:43,039 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-11-23 12:42:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:43,738 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-11-23 12:42:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:43,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2018-11-23 12:42:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2018-11-23 12:42:43,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 275 transitions. [2018-11-23 12:42:44,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:44,532 INFO L225 Difference]: With dead ends: 632 [2018-11-23 12:42:44,533 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 12:42:44,534 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:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 12:42:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-11-23 12:42:44,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:44,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand 376 states. [2018-11-23 12:42:44,740 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand 376 states. [2018-11-23 12:42:44,740 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 376 states. [2018-11-23 12:42:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,753 INFO L93 Difference]: Finished difference Result 378 states and 675 transitions. [2018-11-23 12:42:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 675 transitions. [2018-11-23 12:42:44,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,755 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand 378 states. [2018-11-23 12:42:44,755 INFO L87 Difference]: Start difference. First operand 376 states. Second operand 378 states. [2018-11-23 12:42:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,766 INFO L93 Difference]: Finished difference Result 378 states and 675 transitions. [2018-11-23 12:42:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 675 transitions. [2018-11-23 12:42:44,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:44,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-23 12:42:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-11-23 12:42:44,782 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-11-23 12:42:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:44,783 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-11-23 12:42:44,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-11-23 12:42:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:44,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:44,784 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:44,784 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:44,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-11-23 12:42:44,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:44,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:45,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {7265#true} call ULTIMATE.init(); {7265#true} is VALID [2018-11-23 12:42:45,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {7265#true} assume true; {7265#true} is VALID [2018-11-23 12:42:45,031 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7265#true} {7265#true} #282#return; {7265#true} is VALID [2018-11-23 12:42:45,031 INFO L256 TraceCheckUtils]: 3: Hoare triple {7265#true} call #t~ret16 := main(); {7265#true} is VALID [2018-11-23 12:42:45,031 INFO L273 TraceCheckUtils]: 4: Hoare triple {7265#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {7265#true} is VALID [2018-11-23 12:42:45,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {7265#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {7265#true} is VALID [2018-11-23 12:42:45,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {7265#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {7265#true} is VALID [2018-11-23 12:42:45,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {7265#true} assume !(0 != ~p1~0); {7265#true} is VALID [2018-11-23 12:42:45,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {7265#true} assume !(0 != ~p2~0); {7265#true} is VALID [2018-11-23 12:42:45,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {7265#true} assume 0 != ~p3~0;~lk3~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {7267#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {7267#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {7267#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {7267#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7267#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:45,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {7267#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7266#false} is VALID [2018-11-23 12:42:45,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {7266#false} assume 0 != ~p4~0; {7266#false} is VALID [2018-11-23 12:42:45,179 INFO L273 TraceCheckUtils]: 26: Hoare triple {7266#false} assume 1 != ~lk4~0; {7266#false} is VALID [2018-11-23 12:42:45,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {7266#false} assume !false; {7266#false} is VALID [2018-11-23 12:42:45,180 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:45,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:45,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:45,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:45,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:45,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:45,243 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:45,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:45,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:45,244 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-11-23 12:42:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,494 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-11-23 12:42:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:45,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2018-11-23 12:42:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2018-11-23 12:42:45,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 270 transitions. [2018-11-23 12:42:46,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,221 INFO L225 Difference]: With dead ends: 564 [2018-11-23 12:42:46,222 INFO L226 Difference]: Without dead ends: 382 [2018-11-23 12:42:46,223 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:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-23 12:42:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-11-23 12:42:46,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:46,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand 380 states. [2018-11-23 12:42:46,280 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand 380 states. [2018-11-23 12:42:46,281 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 380 states. [2018-11-23 12:42:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,292 INFO L93 Difference]: Finished difference Result 382 states and 675 transitions. [2018-11-23 12:42:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 675 transitions. [2018-11-23 12:42:46,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,293 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand 382 states. [2018-11-23 12:42:46,293 INFO L87 Difference]: Start difference. First operand 380 states. Second operand 382 states. [2018-11-23 12:42:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,304 INFO L93 Difference]: Finished difference Result 382 states and 675 transitions. [2018-11-23 12:42:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 675 transitions. [2018-11-23 12:42:46,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:46,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-23 12:42:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-11-23 12:42:46,316 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-11-23 12:42:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:46,316 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-11-23 12:42:46,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-11-23 12:42:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:46,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:46,317 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:46,317 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:46,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-11-23 12:42:46,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:46,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2018-11-23 12:42:46,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {9012#true} assume true; {9012#true} is VALID [2018-11-23 12:42:46,407 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9012#true} {9012#true} #282#return; {9012#true} is VALID [2018-11-23 12:42:46,407 INFO L256 TraceCheckUtils]: 3: Hoare triple {9012#true} call #t~ret16 := main(); {9012#true} is VALID [2018-11-23 12:42:46,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {9012#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {9012#true} is VALID [2018-11-23 12:42:46,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {9012#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {9012#true} is VALID [2018-11-23 12:42:46,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {9012#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {9012#true} is VALID [2018-11-23 12:42:46,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {9012#true} assume !(0 != ~p1~0); {9012#true} is VALID [2018-11-23 12:42:46,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {9012#true} assume !(0 != ~p2~0); {9012#true} is VALID [2018-11-23 12:42:46,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {9012#true} assume !(0 != ~p3~0); {9012#true} is VALID [2018-11-23 12:42:46,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {9012#true} assume 0 != ~p4~0;~lk4~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {9014#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {9014#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {9014#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {9014#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {9014#(= main_~lk4~0 1)} assume 0 != ~p4~0; {9014#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:46,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {9014#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {9013#false} is VALID [2018-11-23 12:42:46,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2018-11-23 12:42:46,434 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:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:46,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,458 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:46,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,459 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-11-23 12:42:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,297 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-11-23 12:42:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:47,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2018-11-23 12:42:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2018-11-23 12:42:47,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 178 transitions. [2018-11-23 12:42:47,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,510 INFO L225 Difference]: With dead ends: 716 [2018-11-23 12:42:47,510 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 12:42:47,511 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:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 12:42:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-11-23 12:42:47,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand 520 states. [2018-11-23 12:42:47,601 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand 520 states. [2018-11-23 12:42:47,601 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 520 states. [2018-11-23 12:42:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,626 INFO L93 Difference]: Finished difference Result 714 states and 1279 transitions. [2018-11-23 12:42:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1279 transitions. [2018-11-23 12:42:47,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,628 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand 714 states. [2018-11-23 12:42:47,628 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 714 states. [2018-11-23 12:42:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,654 INFO L93 Difference]: Finished difference Result 714 states and 1279 transitions. [2018-11-23 12:42:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1279 transitions. [2018-11-23 12:42:47,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 12:42:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-11-23 12:42:47,672 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-11-23 12:42:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,673 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-11-23 12:42:47,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-11-23 12:42:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:47,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,674 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:47,674 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-11-23 12:42:47,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {11719#true} call ULTIMATE.init(); {11719#true} is VALID [2018-11-23 12:42:47,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {11719#true} assume true; {11719#true} is VALID [2018-11-23 12:42:47,794 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11719#true} {11719#true} #282#return; {11719#true} is VALID [2018-11-23 12:42:47,794 INFO L256 TraceCheckUtils]: 3: Hoare triple {11719#true} call #t~ret16 := main(); {11719#true} is VALID [2018-11-23 12:42:47,795 INFO L273 TraceCheckUtils]: 4: Hoare triple {11719#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {11719#true} is VALID [2018-11-23 12:42:47,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {11719#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {11719#true} is VALID [2018-11-23 12:42:47,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {11719#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {11719#true} is VALID [2018-11-23 12:42:47,795 INFO L273 TraceCheckUtils]: 7: Hoare triple {11719#true} assume !(0 != ~p1~0); {11719#true} is VALID [2018-11-23 12:42:47,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {11719#true} assume !(0 != ~p2~0); {11719#true} is VALID [2018-11-23 12:42:47,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {11719#true} assume !(0 != ~p3~0); {11719#true} is VALID [2018-11-23 12:42:47,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {11719#true} assume !(0 != ~p4~0); {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {11721#(= main_~p4~0 0)} assume !(0 != ~p8~0); {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,804 INFO L273 TraceCheckUtils]: 22: Hoare triple {11721#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {11721#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {11721#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11721#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:47,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {11721#(= main_~p4~0 0)} assume 0 != ~p4~0; {11720#false} is VALID [2018-11-23 12:42:47,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {11720#false} assume 1 != ~lk4~0; {11720#false} is VALID [2018-11-23 12:42:47,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {11720#false} assume !false; {11720#false} is VALID [2018-11-23 12:42:47,808 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:47,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:47,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,842 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:47,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,843 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-11-23 12:42:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,806 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-11-23 12:42:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2018-11-23 12:42:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2018-11-23 12:42:48,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 272 transitions. [2018-11-23 12:42:49,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:49,060 INFO L225 Difference]: With dead ends: 1244 [2018-11-23 12:42:49,060 INFO L226 Difference]: Without dead ends: 738 [2018-11-23 12:42:49,062 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:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-23 12:42:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-23 12:42:49,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:49,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 738 states. Second operand 736 states. [2018-11-23 12:42:49,471 INFO L74 IsIncluded]: Start isIncluded. First operand 738 states. Second operand 736 states. [2018-11-23 12:42:49,471 INFO L87 Difference]: Start difference. First operand 738 states. Second operand 736 states. [2018-11-23 12:42:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,495 INFO L93 Difference]: Finished difference Result 738 states and 1287 transitions. [2018-11-23 12:42:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1287 transitions. [2018-11-23 12:42:49,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,497 INFO L74 IsIncluded]: Start isIncluded. First operand 736 states. Second operand 738 states. [2018-11-23 12:42:49,497 INFO L87 Difference]: Start difference. First operand 736 states. Second operand 738 states. [2018-11-23 12:42:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,526 INFO L93 Difference]: Finished difference Result 738 states and 1287 transitions. [2018-11-23 12:42:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1287 transitions. [2018-11-23 12:42:49,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:49,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-23 12:42:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-11-23 12:42:49,554 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-11-23 12:42:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:49,555 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-11-23 12:42:49,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-11-23 12:42:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:49,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:49,556 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:49,556 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:49,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-11-23 12:42:49,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:49,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {15234#true} call ULTIMATE.init(); {15234#true} is VALID [2018-11-23 12:42:49,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {15234#true} assume true; {15234#true} is VALID [2018-11-23 12:42:49,781 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15234#true} {15234#true} #282#return; {15234#true} is VALID [2018-11-23 12:42:49,781 INFO L256 TraceCheckUtils]: 3: Hoare triple {15234#true} call #t~ret16 := main(); {15234#true} is VALID [2018-11-23 12:42:49,781 INFO L273 TraceCheckUtils]: 4: Hoare triple {15234#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {15234#true} is VALID [2018-11-23 12:42:49,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {15234#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {15234#true} is VALID [2018-11-23 12:42:49,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {15234#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {15234#true} is VALID [2018-11-23 12:42:49,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {15234#true} assume !(0 != ~p1~0); {15234#true} is VALID [2018-11-23 12:42:49,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {15234#true} assume !(0 != ~p2~0); {15234#true} is VALID [2018-11-23 12:42:49,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {15234#true} assume !(0 != ~p3~0); {15234#true} is VALID [2018-11-23 12:42:49,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {15234#true} assume 0 != ~p4~0;~lk4~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {15236#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {15236#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {15236#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {15236#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {15236#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {15236#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:49,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {15236#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {15235#false} is VALID [2018-11-23 12:42:49,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {15235#false} assume 0 != ~p5~0; {15235#false} is VALID [2018-11-23 12:42:49,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {15235#false} assume 1 != ~lk5~0; {15235#false} is VALID [2018-11-23 12:42:49,910 INFO L273 TraceCheckUtils]: 28: Hoare triple {15235#false} assume !false; {15235#false} is VALID [2018-11-23 12:42:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:49,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:49,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:49,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:49,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:49,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:49,934 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:49,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:49,935 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-11-23 12:42:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,251 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-11-23 12:42:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:50,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2018-11-23 12:42:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2018-11-23 12:42:50,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 267 transitions. [2018-11-23 12:42:50,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,523 INFO L225 Difference]: With dead ends: 1104 [2018-11-23 12:42:50,523 INFO L226 Difference]: Without dead ends: 746 [2018-11-23 12:42:50,524 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:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-23 12:42:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-11-23 12:42:50,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:50,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand 744 states. [2018-11-23 12:42:50,645 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand 744 states. [2018-11-23 12:42:50,645 INFO L87 Difference]: Start difference. First operand 746 states. Second operand 744 states. [2018-11-23 12:42:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,671 INFO L93 Difference]: Finished difference Result 746 states and 1287 transitions. [2018-11-23 12:42:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1287 transitions. [2018-11-23 12:42:50,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,673 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand 746 states. [2018-11-23 12:42:50,673 INFO L87 Difference]: Start difference. First operand 744 states. Second operand 746 states. [2018-11-23 12:42:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,705 INFO L93 Difference]: Finished difference Result 746 states and 1287 transitions. [2018-11-23 12:42:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1287 transitions. [2018-11-23 12:42:50,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:50,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-23 12:42:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-11-23 12:42:50,735 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-11-23 12:42:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:50,735 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-11-23 12:42:50,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-11-23 12:42:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:50,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:50,736 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:50,736 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:50,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-11-23 12:42:50,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:50,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:50,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {18633#true} call ULTIMATE.init(); {18633#true} is VALID [2018-11-23 12:42:50,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {18633#true} assume true; {18633#true} is VALID [2018-11-23 12:42:50,823 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18633#true} {18633#true} #282#return; {18633#true} is VALID [2018-11-23 12:42:50,824 INFO L256 TraceCheckUtils]: 3: Hoare triple {18633#true} call #t~ret16 := main(); {18633#true} is VALID [2018-11-23 12:42:50,824 INFO L273 TraceCheckUtils]: 4: Hoare triple {18633#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {18633#true} is VALID [2018-11-23 12:42:50,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {18633#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {18633#true} is VALID [2018-11-23 12:42:50,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {18633#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {18633#true} is VALID [2018-11-23 12:42:50,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {18633#true} assume !(0 != ~p1~0); {18633#true} is VALID [2018-11-23 12:42:50,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {18633#true} assume !(0 != ~p2~0); {18633#true} is VALID [2018-11-23 12:42:50,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {18633#true} assume !(0 != ~p3~0); {18633#true} is VALID [2018-11-23 12:42:50,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {18633#true} assume !(0 != ~p4~0); {18633#true} is VALID [2018-11-23 12:42:50,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {18633#true} assume 0 != ~p5~0;~lk5~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {18635#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {18635#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {18635#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {18635#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {18635#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {18635#(= main_~lk5~0 1)} assume 0 != ~p5~0; {18635#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:50,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {18635#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18634#false} is VALID [2018-11-23 12:42:50,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {18634#false} assume !false; {18634#false} is VALID [2018-11-23 12:42:50,836 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:50,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:50,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:50,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:50,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:50,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:50,872 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:50,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:50,873 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-11-23 12:42:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,354 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-11-23 12:42:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:51,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:42:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:42:51,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 12:42:51,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:51,623 INFO L225 Difference]: With dead ends: 1388 [2018-11-23 12:42:51,623 INFO L226 Difference]: Without dead ends: 1386 [2018-11-23 12:42:51,623 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:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-11-23 12:42:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-11-23 12:42:51,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:51,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1386 states. Second operand 1032 states. [2018-11-23 12:42:51,776 INFO L74 IsIncluded]: Start isIncluded. First operand 1386 states. Second operand 1032 states. [2018-11-23 12:42:51,777 INFO L87 Difference]: Start difference. First operand 1386 states. Second operand 1032 states. [2018-11-23 12:42:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,865 INFO L93 Difference]: Finished difference Result 1386 states and 2423 transitions. [2018-11-23 12:42:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2423 transitions. [2018-11-23 12:42:51,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,868 INFO L74 IsIncluded]: Start isIncluded. First operand 1032 states. Second operand 1386 states. [2018-11-23 12:42:51,868 INFO L87 Difference]: Start difference. First operand 1032 states. Second operand 1386 states. [2018-11-23 12:42:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,939 INFO L93 Difference]: Finished difference Result 1386 states and 2423 transitions. [2018-11-23 12:42:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2423 transitions. [2018-11-23 12:42:51,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:51,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-23 12:42:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-11-23 12:42:51,975 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-11-23 12:42:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:51,975 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-11-23 12:42:51,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-11-23 12:42:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:51,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:51,976 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:51,976 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:51,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-11-23 12:42:51,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:51,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:52,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {23892#true} call ULTIMATE.init(); {23892#true} is VALID [2018-11-23 12:42:52,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {23892#true} assume true; {23892#true} is VALID [2018-11-23 12:42:52,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23892#true} {23892#true} #282#return; {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L256 TraceCheckUtils]: 3: Hoare triple {23892#true} call #t~ret16 := main(); {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L273 TraceCheckUtils]: 4: Hoare triple {23892#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {23892#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {23892#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {23892#true} assume !(0 != ~p1~0); {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {23892#true} assume !(0 != ~p2~0); {23892#true} is VALID [2018-11-23 12:42:52,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {23892#true} assume !(0 != ~p3~0); {23892#true} is VALID [2018-11-23 12:42:52,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {23892#true} assume !(0 != ~p4~0); {23892#true} is VALID [2018-11-23 12:42:52,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {23892#true} assume !(0 != ~p5~0); {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {23894#(= main_~p5~0 0)} assume !(0 != ~p8~0); {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {23894#(= main_~p5~0 0)} assume !(0 != ~p1~0); {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {23894#(= main_~p5~0 0)} assume !(0 != ~p2~0); {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {23894#(= main_~p5~0 0)} assume !(0 != ~p3~0); {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {23894#(= main_~p5~0 0)} assume !(0 != ~p4~0); {23894#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:52,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {23894#(= main_~p5~0 0)} assume 0 != ~p5~0; {23893#false} is VALID [2018-11-23 12:42:52,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {23893#false} assume 1 != ~lk5~0; {23893#false} is VALID [2018-11-23 12:42:52,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {23893#false} assume !false; {23893#false} is VALID [2018-11-23 12:42:52,092 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,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:52,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:52,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:52,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:52,116 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,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:52,117 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-11-23 12:42:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,658 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-11-23 12:42:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:52,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2018-11-23 12:42:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2018-11-23 12:42:52,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 269 transitions. [2018-11-23 12:42:52,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,989 INFO L225 Difference]: With dead ends: 2460 [2018-11-23 12:42:52,989 INFO L226 Difference]: Without dead ends: 1450 [2018-11-23 12:42:52,990 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:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-11-23 12:42:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-11-23 12:42:53,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:53,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1450 states. Second operand 1448 states. [2018-11-23 12:42:53,307 INFO L74 IsIncluded]: Start isIncluded. First operand 1450 states. Second operand 1448 states. [2018-11-23 12:42:53,307 INFO L87 Difference]: Start difference. First operand 1450 states. Second operand 1448 states. [2018-11-23 12:42:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,375 INFO L93 Difference]: Finished difference Result 1450 states and 2455 transitions. [2018-11-23 12:42:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2455 transitions. [2018-11-23 12:42:53,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,377 INFO L74 IsIncluded]: Start isIncluded. First operand 1448 states. Second operand 1450 states. [2018-11-23 12:42:53,377 INFO L87 Difference]: Start difference. First operand 1448 states. Second operand 1450 states. [2018-11-23 12:42:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,459 INFO L93 Difference]: Finished difference Result 1450 states and 2455 transitions. [2018-11-23 12:42:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2455 transitions. [2018-11-23 12:42:53,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:53,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-11-23 12:42:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-11-23 12:42:53,531 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-11-23 12:42:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:53,531 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-11-23 12:42:53,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-11-23 12:42:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:42:53,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:53,532 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, 1] [2018-11-23 12:42:53,532 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:53,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-11-23 12:42:53,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:53,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:53,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:53,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:53,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:53,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {30799#true} call ULTIMATE.init(); {30799#true} is VALID [2018-11-23 12:42:53,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {30799#true} assume true; {30799#true} is VALID [2018-11-23 12:42:53,772 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30799#true} {30799#true} #282#return; {30799#true} is VALID [2018-11-23 12:42:53,772 INFO L256 TraceCheckUtils]: 3: Hoare triple {30799#true} call #t~ret16 := main(); {30799#true} is VALID [2018-11-23 12:42:53,772 INFO L273 TraceCheckUtils]: 4: Hoare triple {30799#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {30799#true} is VALID [2018-11-23 12:42:53,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {30799#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {30799#true} is VALID [2018-11-23 12:42:53,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {30799#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {30799#true} is VALID [2018-11-23 12:42:53,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {30799#true} assume !(0 != ~p1~0); {30799#true} is VALID [2018-11-23 12:42:53,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {30799#true} assume !(0 != ~p2~0); {30799#true} is VALID [2018-11-23 12:42:53,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {30799#true} assume !(0 != ~p3~0); {30799#true} is VALID [2018-11-23 12:42:53,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {30799#true} assume !(0 != ~p4~0); {30799#true} is VALID [2018-11-23 12:42:53,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {30799#true} assume 0 != ~p5~0;~lk5~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {30801#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {30801#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {30801#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {30801#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {30801#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {30801#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {30801#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:53,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {30801#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30800#false} is VALID [2018-11-23 12:42:53,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {30800#false} assume 0 != ~p6~0; {30800#false} is VALID [2018-11-23 12:42:53,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {30800#false} assume 1 != ~lk6~0; {30800#false} is VALID [2018-11-23 12:42:53,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {30800#false} assume !false; {30800#false} is VALID [2018-11-23 12:42:53,977 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:53,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:53,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:53,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:53,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:53,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:54,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:54,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:54,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:54,188 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-11-23 12:42:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,956 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-11-23 12:42:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:54,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2018-11-23 12:42:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2018-11-23 12:42:54,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 264 transitions. [2018-11-23 12:42:55,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:55,279 INFO L225 Difference]: With dead ends: 2172 [2018-11-23 12:42:55,279 INFO L226 Difference]: Without dead ends: 1466 [2018-11-23 12:42:55,280 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:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-11-23 12:42:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-11-23 12:42:55,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:55,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1466 states. Second operand 1464 states. [2018-11-23 12:42:55,868 INFO L74 IsIncluded]: Start isIncluded. First operand 1466 states. Second operand 1464 states. [2018-11-23 12:42:55,868 INFO L87 Difference]: Start difference. First operand 1466 states. Second operand 1464 states. [2018-11-23 12:42:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:55,936 INFO L93 Difference]: Finished difference Result 1466 states and 2455 transitions. [2018-11-23 12:42:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2455 transitions. [2018-11-23 12:42:55,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:55,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:55,937 INFO L74 IsIncluded]: Start isIncluded. First operand 1464 states. Second operand 1466 states. [2018-11-23 12:42:55,937 INFO L87 Difference]: Start difference. First operand 1464 states. Second operand 1466 states. [2018-11-23 12:42:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:56,007 INFO L93 Difference]: Finished difference Result 1466 states and 2455 transitions. [2018-11-23 12:42:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2455 transitions. [2018-11-23 12:42:56,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:56,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:56,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:56,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-11-23 12:42:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-11-23 12:42:56,070 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-11-23 12:42:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:56,070 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-11-23 12:42:56,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-11-23 12:42:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:42:56,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:56,072 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, 1] [2018-11-23 12:42:56,072 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:56,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-11-23 12:42:56,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:56,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:56,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:56,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:56,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:56,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {37466#true} call ULTIMATE.init(); {37466#true} is VALID [2018-11-23 12:42:56,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {37466#true} assume true; {37466#true} is VALID [2018-11-23 12:42:56,238 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {37466#true} {37466#true} #282#return; {37466#true} is VALID [2018-11-23 12:42:56,238 INFO L256 TraceCheckUtils]: 3: Hoare triple {37466#true} call #t~ret16 := main(); {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 4: Hoare triple {37466#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {37466#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {37466#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {37466#true} assume !(0 != ~p1~0); {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {37466#true} assume !(0 != ~p2~0); {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {37466#true} assume !(0 != ~p3~0); {37466#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {37466#true} assume !(0 != ~p4~0); {37466#true} is VALID [2018-11-23 12:42:56,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {37466#true} assume !(0 != ~p5~0); {37466#true} is VALID [2018-11-23 12:42:56,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {37466#true} assume 0 != ~p6~0;~lk6~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {37468#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {37468#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {37468#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {37468#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {37468#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {37468#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {37468#(= main_~lk6~0 1)} assume 0 != ~p6~0; {37468#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:56,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {37468#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {37467#false} is VALID [2018-11-23 12:42:56,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {37467#false} assume !false; {37467#false} is VALID [2018-11-23 12:42:56,253 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:56,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:56,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:56,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:56,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:56,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:56,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:56,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:56,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:56,289 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-11-23 12:42:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,313 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-11-23 12:42:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:57,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 12:42:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 12:42:57,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2018-11-23 12:42:57,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:57,717 INFO L225 Difference]: With dead ends: 2700 [2018-11-23 12:42:57,718 INFO L226 Difference]: Without dead ends: 2698 [2018-11-23 12:42:57,719 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:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-23 12:42:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-11-23 12:42:58,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:58,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2698 states. Second operand 2056 states. [2018-11-23 12:42:58,071 INFO L74 IsIncluded]: Start isIncluded. First operand 2698 states. Second operand 2056 states. [2018-11-23 12:42:58,072 INFO L87 Difference]: Start difference. First operand 2698 states. Second operand 2056 states. [2018-11-23 12:42:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:58,272 INFO L93 Difference]: Finished difference Result 2698 states and 4583 transitions. [2018-11-23 12:42:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4583 transitions. [2018-11-23 12:42:58,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:58,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:58,274 INFO L74 IsIncluded]: Start isIncluded. First operand 2056 states. Second operand 2698 states. [2018-11-23 12:42:58,274 INFO L87 Difference]: Start difference. First operand 2056 states. Second operand 2698 states. [2018-11-23 12:42:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:58,487 INFO L93 Difference]: Finished difference Result 2698 states and 4583 transitions. [2018-11-23 12:42:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4583 transitions. [2018-11-23 12:42:58,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:58,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:58,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:58,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-23 12:42:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-11-23 12:42:58,660 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-11-23 12:42:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:58,660 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-11-23 12:42:58,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-11-23 12:42:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:42:58,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:58,662 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, 1] [2018-11-23 12:42:58,662 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:58,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-11-23 12:42:58,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:58,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:58,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:58,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:58,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:58,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {47733#true} call ULTIMATE.init(); {47733#true} is VALID [2018-11-23 12:42:58,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {47733#true} assume true; {47733#true} is VALID [2018-11-23 12:42:58,864 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {47733#true} {47733#true} #282#return; {47733#true} is VALID [2018-11-23 12:42:58,864 INFO L256 TraceCheckUtils]: 3: Hoare triple {47733#true} call #t~ret16 := main(); {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {47733#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {47733#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {47733#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {47733#true} assume !(0 != ~p1~0); {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {47733#true} assume !(0 != ~p2~0); {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {47733#true} assume !(0 != ~p3~0); {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {47733#true} assume !(0 != ~p4~0); {47733#true} is VALID [2018-11-23 12:42:58,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {47733#true} assume !(0 != ~p5~0); {47733#true} is VALID [2018-11-23 12:42:58,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {47733#true} assume !(0 != ~p6~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {47735#(= main_~p6~0 0)} assume !(0 != ~p8~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {47735#(= main_~p6~0 0)} assume !(0 != ~p1~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {47735#(= main_~p6~0 0)} assume !(0 != ~p2~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {47735#(= main_~p6~0 0)} assume !(0 != ~p3~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {47735#(= main_~p6~0 0)} assume !(0 != ~p4~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {47735#(= main_~p6~0 0)} assume !(0 != ~p5~0); {47735#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:58,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {47735#(= main_~p6~0 0)} assume 0 != ~p6~0; {47734#false} is VALID [2018-11-23 12:42:58,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {47734#false} assume 1 != ~lk6~0; {47734#false} is VALID [2018-11-23 12:42:58,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {47734#false} assume !false; {47734#false} is VALID [2018-11-23 12:42:58,877 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:58,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:58,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:58,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:58,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:58,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:58,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:58,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:58,905 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-11-23 12:43:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,848 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-11-23 12:43:00,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:00,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2018-11-23 12:43:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2018-11-23 12:43:00,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 266 transitions. [2018-11-23 12:43:01,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:01,405 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 12:43:01,405 INFO L226 Difference]: Without dead ends: 2858 [2018-11-23 12:43:01,408 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:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-11-23 12:43:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-11-23 12:43:01,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:01,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2858 states. Second operand 2856 states. [2018-11-23 12:43:01,932 INFO L74 IsIncluded]: Start isIncluded. First operand 2858 states. Second operand 2856 states. [2018-11-23 12:43:01,933 INFO L87 Difference]: Start difference. First operand 2858 states. Second operand 2856 states. [2018-11-23 12:43:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,215 INFO L93 Difference]: Finished difference Result 2858 states and 4679 transitions. [2018-11-23 12:43:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4679 transitions. [2018-11-23 12:43:02,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,218 INFO L74 IsIncluded]: Start isIncluded. First operand 2856 states. Second operand 2858 states. [2018-11-23 12:43:02,219 INFO L87 Difference]: Start difference. First operand 2856 states. Second operand 2858 states. [2018-11-23 12:43:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,438 INFO L93 Difference]: Finished difference Result 2858 states and 4679 transitions. [2018-11-23 12:43:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4679 transitions. [2018-11-23 12:43:02,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:02,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-11-23 12:43:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-11-23 12:43:02,689 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-11-23 12:43:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:02,690 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-11-23 12:43:02,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-11-23 12:43:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:02,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:02,692 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, 1, 1] [2018-11-23 12:43:02,692 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:02,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-11-23 12:43:02,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:02,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:02,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {61360#true} call ULTIMATE.init(); {61360#true} is VALID [2018-11-23 12:43:02,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {61360#true} assume true; {61360#true} is VALID [2018-11-23 12:43:02,765 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {61360#true} {61360#true} #282#return; {61360#true} is VALID [2018-11-23 12:43:02,765 INFO L256 TraceCheckUtils]: 3: Hoare triple {61360#true} call #t~ret16 := main(); {61360#true} is VALID [2018-11-23 12:43:02,765 INFO L273 TraceCheckUtils]: 4: Hoare triple {61360#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {61360#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {61360#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {61360#true} assume !(0 != ~p1~0); {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {61360#true} assume !(0 != ~p2~0); {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {61360#true} assume !(0 != ~p3~0); {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {61360#true} assume !(0 != ~p4~0); {61360#true} is VALID [2018-11-23 12:43:02,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {61360#true} assume !(0 != ~p5~0); {61360#true} is VALID [2018-11-23 12:43:02,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {61360#true} assume 0 != ~p6~0;~lk6~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,776 INFO L273 TraceCheckUtils]: 21: Hoare triple {61362#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {61362#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:02,797 INFO L273 TraceCheckUtils]: 27: Hoare triple {61362#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {61361#false} is VALID [2018-11-23 12:43:02,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {61361#false} assume 0 != ~p7~0; {61361#false} is VALID [2018-11-23 12:43:02,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {61361#false} assume 1 != ~lk7~0; {61361#false} is VALID [2018-11-23 12:43:02,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {61361#false} assume !false; {61361#false} is VALID [2018-11-23 12:43:02,798 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:02,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:02,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:02,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:02,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:02,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:02,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:02,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:02,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:02,825 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-11-23 12:43:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:04,384 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-11-23 12:43:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:04,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2018-11-23 12:43:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2018-11-23 12:43:04,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2018-11-23 12:43:04,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:05,024 INFO L225 Difference]: With dead ends: 4284 [2018-11-23 12:43:05,024 INFO L226 Difference]: Without dead ends: 2890 [2018-11-23 12:43:05,027 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:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-23 12:43:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-11-23 12:43:05,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:05,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2890 states. Second operand 2888 states. [2018-11-23 12:43:05,789 INFO L74 IsIncluded]: Start isIncluded. First operand 2890 states. Second operand 2888 states. [2018-11-23 12:43:05,789 INFO L87 Difference]: Start difference. First operand 2890 states. Second operand 2888 states. [2018-11-23 12:43:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,015 INFO L93 Difference]: Finished difference Result 2890 states and 4679 transitions. [2018-11-23 12:43:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4679 transitions. [2018-11-23 12:43:06,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,018 INFO L74 IsIncluded]: Start isIncluded. First operand 2888 states. Second operand 2890 states. [2018-11-23 12:43:06,018 INFO L87 Difference]: Start difference. First operand 2888 states. Second operand 2890 states. [2018-11-23 12:43:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,245 INFO L93 Difference]: Finished difference Result 2890 states and 4679 transitions. [2018-11-23 12:43:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4679 transitions. [2018-11-23 12:43:06,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:06,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-11-23 12:43:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-11-23 12:43:06,517 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-11-23 12:43:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:06,518 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-11-23 12:43:06,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-11-23 12:43:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:06,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:06,519 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, 1, 1] [2018-11-23 12:43:06,519 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:06,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-11-23 12:43:06,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:06,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:06,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {74491#true} call ULTIMATE.init(); {74491#true} is VALID [2018-11-23 12:43:06,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {74491#true} assume true; {74491#true} is VALID [2018-11-23 12:43:06,611 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {74491#true} {74491#true} #282#return; {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L256 TraceCheckUtils]: 3: Hoare triple {74491#true} call #t~ret16 := main(); {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L273 TraceCheckUtils]: 4: Hoare triple {74491#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {74491#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {74491#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {74491#true} assume !(0 != ~p1~0); {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {74491#true} assume !(0 != ~p2~0); {74491#true} is VALID [2018-11-23 12:43:06,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {74491#true} assume !(0 != ~p3~0); {74491#true} is VALID [2018-11-23 12:43:06,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {74491#true} assume !(0 != ~p4~0); {74491#true} is VALID [2018-11-23 12:43:06,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {74491#true} assume !(0 != ~p5~0); {74491#true} is VALID [2018-11-23 12:43:06,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {74491#true} assume !(0 != ~p6~0); {74491#true} is VALID [2018-11-23 12:43:06,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {74491#true} assume 0 != ~p7~0;~lk7~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {74493#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {74493#(= main_~lk7~0 1)} assume 0 != ~p7~0; {74493#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:06,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {74493#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {74492#false} is VALID [2018-11-23 12:43:06,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {74492#false} assume !false; {74492#false} is VALID [2018-11-23 12:43:06,644 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:06,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:06,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:06,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:06,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:06,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:06,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:06,673 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-11-23 12:43:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,114 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-11-23 12:43:09,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:09,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2018-11-23 12:43:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2018-11-23 12:43:09,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 166 transitions. [2018-11-23 12:43:09,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:10,492 INFO L225 Difference]: With dead ends: 5260 [2018-11-23 12:43:10,493 INFO L226 Difference]: Without dead ends: 5258 [2018-11-23 12:43:10,495 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:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-23 12:43:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-11-23 12:43:11,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:11,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5258 states. Second operand 4104 states. [2018-11-23 12:43:11,411 INFO L74 IsIncluded]: Start isIncluded. First operand 5258 states. Second operand 4104 states. [2018-11-23 12:43:11,412 INFO L87 Difference]: Start difference. First operand 5258 states. Second operand 4104 states. [2018-11-23 12:43:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,421 INFO L93 Difference]: Finished difference Result 5258 states and 8647 transitions. [2018-11-23 12:43:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8647 transitions. [2018-11-23 12:43:12,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:12,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:12,428 INFO L74 IsIncluded]: Start isIncluded. First operand 4104 states. Second operand 5258 states. [2018-11-23 12:43:12,428 INFO L87 Difference]: Start difference. First operand 4104 states. Second operand 5258 states. [2018-11-23 12:43:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,464 INFO L93 Difference]: Finished difference Result 5258 states and 8647 transitions. [2018-11-23 12:43:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8647 transitions. [2018-11-23 12:43:13,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:13,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 12:43:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-11-23 12:43:14,122 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-11-23 12:43:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:14,123 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-11-23 12:43:14,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-11-23 12:43:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:14,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:14,125 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, 1, 1] [2018-11-23 12:43:14,126 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:14,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-11-23 12:43:14,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:14,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:14,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:14,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:14,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:14,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {94582#true} call ULTIMATE.init(); {94582#true} is VALID [2018-11-23 12:43:14,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {94582#true} assume true; {94582#true} is VALID [2018-11-23 12:43:14,259 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {94582#true} {94582#true} #282#return; {94582#true} is VALID [2018-11-23 12:43:14,259 INFO L256 TraceCheckUtils]: 3: Hoare triple {94582#true} call #t~ret16 := main(); {94582#true} is VALID [2018-11-23 12:43:14,259 INFO L273 TraceCheckUtils]: 4: Hoare triple {94582#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {94582#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {94582#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {94582#true} assume !(0 != ~p1~0); {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {94582#true} assume !(0 != ~p2~0); {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {94582#true} assume !(0 != ~p3~0); {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {94582#true} assume !(0 != ~p4~0); {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {94582#true} assume !(0 != ~p5~0); {94582#true} is VALID [2018-11-23 12:43:14,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {94582#true} assume !(0 != ~p6~0); {94582#true} is VALID [2018-11-23 12:43:14,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {94582#true} assume !(0 != ~p7~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p8~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p1~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p2~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p3~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p4~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p5~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {94584#(= main_~p7~0 0)} assume !(0 != ~p6~0); {94584#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:14,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {94584#(= main_~p7~0 0)} assume 0 != ~p7~0; {94583#false} is VALID [2018-11-23 12:43:14,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {94583#false} assume 1 != ~lk7~0; {94583#false} is VALID [2018-11-23 12:43:14,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {94583#false} assume !false; {94583#false} is VALID [2018-11-23 12:43:14,272 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:14,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:14,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:14,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:14,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:14,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:14,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:14,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:14,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:14,299 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-11-23 12:43:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:19,078 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-11-23 12:43:19,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:19,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2018-11-23 12:43:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2018-11-23 12:43:19,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 263 transitions. [2018-11-23 12:43:19,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:20,957 INFO L225 Difference]: With dead ends: 9676 [2018-11-23 12:43:20,957 INFO L226 Difference]: Without dead ends: 5642 [2018-11-23 12:43:20,963 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:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-11-23 12:43:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-11-23 12:43:22,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:22,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5642 states. Second operand 5640 states. [2018-11-23 12:43:22,207 INFO L74 IsIncluded]: Start isIncluded. First operand 5642 states. Second operand 5640 states. [2018-11-23 12:43:22,207 INFO L87 Difference]: Start difference. First operand 5642 states. Second operand 5640 states. [2018-11-23 12:43:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:23,376 INFO L93 Difference]: Finished difference Result 5642 states and 8903 transitions. [2018-11-23 12:43:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8903 transitions. [2018-11-23 12:43:23,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:23,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:23,382 INFO L74 IsIncluded]: Start isIncluded. First operand 5640 states. Second operand 5642 states. [2018-11-23 12:43:23,382 INFO L87 Difference]: Start difference. First operand 5640 states. Second operand 5642 states. [2018-11-23 12:43:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:24,559 INFO L93 Difference]: Finished difference Result 5642 states and 8903 transitions. [2018-11-23 12:43:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8903 transitions. [2018-11-23 12:43:24,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:24,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:24,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:24,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-11-23 12:43:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-11-23 12:43:25,879 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-11-23 12:43:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-11-23 12:43:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-11-23 12:43:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:43:25,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:25,881 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, 1, 1, 1] [2018-11-23 12:43:25,882 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:25,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-11-23 12:43:25,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:25,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {121521#true} call ULTIMATE.init(); {121521#true} is VALID [2018-11-23 12:43:25,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {121521#true} assume true; {121521#true} is VALID [2018-11-23 12:43:25,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {121521#true} {121521#true} #282#return; {121521#true} is VALID [2018-11-23 12:43:25,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {121521#true} call #t~ret16 := main(); {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 4: Hoare triple {121521#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {121521#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {121521#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {121521#true} assume !(0 != ~p1~0); {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {121521#true} assume !(0 != ~p2~0); {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {121521#true} assume !(0 != ~p3~0); {121521#true} is VALID [2018-11-23 12:43:25,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {121521#true} assume !(0 != ~p4~0); {121521#true} is VALID [2018-11-23 12:43:25,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {121521#true} assume !(0 != ~p5~0); {121521#true} is VALID [2018-11-23 12:43:25,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {121521#true} assume !(0 != ~p6~0); {121521#true} is VALID [2018-11-23 12:43:25,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {121521#true} assume 0 != ~p7~0;~lk7~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {121523#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {121523#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:25,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {121523#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121522#false} is VALID [2018-11-23 12:43:25,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {121522#false} assume 0 != ~p8~0; {121522#false} is VALID [2018-11-23 12:43:25,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {121522#false} assume 1 != ~lk8~0; {121522#false} is VALID [2018-11-23 12:43:25,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {121522#false} assume !false; {121522#false} is VALID [2018-11-23 12:43:25,995 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:25,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:25,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:25,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:43:25,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:25,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:26,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:26,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:26,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:26,184 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-11-23 12:43:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:31,069 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-11-23 12:43:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:31,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:43:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2018-11-23 12:43:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2018-11-23 12:43:31,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 258 transitions. [2018-11-23 12:43:31,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:32,823 INFO L225 Difference]: With dead ends: 8460 [2018-11-23 12:43:32,823 INFO L226 Difference]: Without dead ends: 5706 [2018-11-23 12:43:32,828 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:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-11-23 12:43:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-11-23 12:43:34,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:34,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5706 states. Second operand 5704 states. [2018-11-23 12:43:34,674 INFO L74 IsIncluded]: Start isIncluded. First operand 5706 states. Second operand 5704 states. [2018-11-23 12:43:34,674 INFO L87 Difference]: Start difference. First operand 5706 states. Second operand 5704 states. [2018-11-23 12:43:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:35,864 INFO L93 Difference]: Finished difference Result 5706 states and 8903 transitions. [2018-11-23 12:43:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 8903 transitions. [2018-11-23 12:43:35,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:35,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:35,868 INFO L74 IsIncluded]: Start isIncluded. First operand 5704 states. Second operand 5706 states. [2018-11-23 12:43:35,868 INFO L87 Difference]: Start difference. First operand 5704 states. Second operand 5706 states. [2018-11-23 12:43:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:37,068 INFO L93 Difference]: Finished difference Result 5706 states and 8903 transitions. [2018-11-23 12:43:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 8903 transitions. [2018-11-23 12:43:37,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:37,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:37,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:37,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-11-23 12:43:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-11-23 12:43:38,357 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-11-23 12:43:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:38,357 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-11-23 12:43:38,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-11-23 12:43:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:43:38,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:38,359 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, 1, 1, 1] [2018-11-23 12:43:38,360 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:38,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-11-23 12:43:38,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:38,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:38,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {147436#true} call ULTIMATE.init(); {147436#true} is VALID [2018-11-23 12:43:38,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {147436#true} assume true; {147436#true} is VALID [2018-11-23 12:43:38,402 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {147436#true} {147436#true} #282#return; {147436#true} is VALID [2018-11-23 12:43:38,402 INFO L256 TraceCheckUtils]: 3: Hoare triple {147436#true} call #t~ret16 := main(); {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 4: Hoare triple {147436#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {147436#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {147436#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {147436#true} assume !(0 != ~p1~0); {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {147436#true} assume !(0 != ~p2~0); {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {147436#true} assume !(0 != ~p3~0); {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {147436#true} assume !(0 != ~p4~0); {147436#true} is VALID [2018-11-23 12:43:38,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {147436#true} assume !(0 != ~p5~0); {147436#true} is VALID [2018-11-23 12:43:38,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {147436#true} assume !(0 != ~p6~0); {147436#true} is VALID [2018-11-23 12:43:38,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {147436#true} assume !(0 != ~p7~0); {147436#true} is VALID [2018-11-23 12:43:38,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {147436#true} assume !(0 != ~p8~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p1~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p2~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p3~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p4~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p5~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p6~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {147438#(= main_~p8~0 0)} assume !(0 != ~p7~0); {147438#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:38,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {147438#(= main_~p8~0 0)} assume 0 != ~p8~0; {147437#false} is VALID [2018-11-23 12:43:38,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {147437#false} assume 1 != ~lk8~0; {147437#false} is VALID [2018-11-23 12:43:38,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {147437#false} assume !false; {147437#false} is VALID [2018-11-23 12:43:38,421 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:38,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:38,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:38,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:43:38,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:38,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:38,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:38,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:38,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:38,455 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-11-23 12:43:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:54,207 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-11-23 12:43:54,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:54,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:43:54,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2018-11-23 12:43:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2018-11-23 12:43:54,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2018-11-23 12:43:54,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:59,572 INFO L225 Difference]: With dead ends: 16716 [2018-11-23 12:43:59,572 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 12:43:59,579 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:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 12:44:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-11-23 12:44:03,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:03,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11146 states. Second operand 11144 states. [2018-11-23 12:44:03,113 INFO L74 IsIncluded]: Start isIncluded. First operand 11146 states. Second operand 11144 states. [2018-11-23 12:44:03,113 INFO L87 Difference]: Start difference. First operand 11146 states. Second operand 11144 states. [2018-11-23 12:44:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:07,813 INFO L93 Difference]: Finished difference Result 11146 states and 17031 transitions. [2018-11-23 12:44:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 17031 transitions. [2018-11-23 12:44:07,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:07,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:07,820 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 11146 states. [2018-11-23 12:44:07,820 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 11146 states. [2018-11-23 12:44:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:12,703 INFO L93 Difference]: Finished difference Result 11146 states and 17031 transitions. [2018-11-23 12:44:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 17031 transitions. [2018-11-23 12:44:12,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:12,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:12,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:12,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 12:44:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-11-23 12:44:17,881 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-11-23 12:44:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:17,881 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-11-23 12:44:17,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-11-23 12:44:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:44:17,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:17,886 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, 1, 1, 1] [2018-11-23 12:44:17,886 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:17,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-11-23 12:44:17,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:17,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:17,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:17,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {198247#true} call ULTIMATE.init(); {198247#true} is VALID [2018-11-23 12:44:17,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {198247#true} assume true; {198247#true} is VALID [2018-11-23 12:44:17,944 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {198247#true} {198247#true} #282#return; {198247#true} is VALID [2018-11-23 12:44:17,944 INFO L256 TraceCheckUtils]: 3: Hoare triple {198247#true} call #t~ret16 := main(); {198247#true} is VALID [2018-11-23 12:44:17,944 INFO L273 TraceCheckUtils]: 4: Hoare triple {198247#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {198247#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {198247#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {198247#true} assume !(0 != ~p1~0); {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {198247#true} assume !(0 != ~p2~0); {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {198247#true} assume !(0 != ~p3~0); {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {198247#true} assume !(0 != ~p4~0); {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {198247#true} assume !(0 != ~p5~0); {198247#true} is VALID [2018-11-23 12:44:17,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {198247#true} assume !(0 != ~p6~0); {198247#true} is VALID [2018-11-23 12:44:17,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {198247#true} assume !(0 != ~p7~0); {198247#true} is VALID [2018-11-23 12:44:17,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {198247#true} assume 0 != ~p8~0;~lk8~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {198249#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {198249#(= main_~lk8~0 1)} assume 0 != ~p8~0; {198249#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:17,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {198249#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {198248#false} is VALID [2018-11-23 12:44:17,961 INFO L273 TraceCheckUtils]: 31: Hoare triple {198248#false} assume !false; {198248#false} is VALID [2018-11-23 12:44:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:44:17,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:17,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:44:17,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:17,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:17,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:17,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:17,990 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-11-23 12:44:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:31,247 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-11-23 12:44:31,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:31,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:44:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-23 12:44:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-23 12:44:31,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2018-11-23 12:44:31,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:39,970 INFO L225 Difference]: With dead ends: 13196 [2018-11-23 12:44:39,970 INFO L226 Difference]: Without dead ends: 13194 [2018-11-23 12:44:39,975 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:44:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-11-23 12:44:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-11-23 12:44:42,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:42,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13194 states. Second operand 11144 states. [2018-11-23 12:44:42,910 INFO L74 IsIncluded]: Start isIncluded. First operand 13194 states. Second operand 11144 states. [2018-11-23 12:44:42,911 INFO L87 Difference]: Start difference. First operand 13194 states. Second operand 11144 states. [2018-11-23 12:44:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:50,190 INFO L93 Difference]: Finished difference Result 13194 states and 20743 transitions. [2018-11-23 12:44:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13194 states and 20743 transitions. [2018-11-23 12:44:50,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:50,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:50,200 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 13194 states. [2018-11-23 12:44:50,200 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 13194 states. [2018-11-23 12:44:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:57,628 INFO L93 Difference]: Finished difference Result 13194 states and 20743 transitions. [2018-11-23 12:44:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 13194 states and 20743 transitions. [2018-11-23 12:44:57,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:57,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:57,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:57,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 12:45:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-11-23 12:45:03,245 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-11-23 12:45:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:45:03,246 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-11-23 12:45:03,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:45:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-11-23 12:45:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:45:03,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:45:03,250 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, 1, 1, 1, 1] [2018-11-23 12:45:03,250 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:45:03,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:45:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-11-23 12:45:03,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:45:03,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:45:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:45:03,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:45:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:45:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:45:03,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {249634#true} call ULTIMATE.init(); {249634#true} is VALID [2018-11-23 12:45:03,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {249634#true} assume true; {249634#true} is VALID [2018-11-23 12:45:03,320 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {249634#true} {249634#true} #282#return; {249634#true} is VALID [2018-11-23 12:45:03,320 INFO L256 TraceCheckUtils]: 3: Hoare triple {249634#true} call #t~ret16 := main(); {249634#true} is VALID [2018-11-23 12:45:03,320 INFO L273 TraceCheckUtils]: 4: Hoare triple {249634#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;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {249634#true} is VALID [2018-11-23 12:45:03,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {249634#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {249634#true} is VALID [2018-11-23 12:45:03,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {249634#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {249634#true} is VALID [2018-11-23 12:45:03,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {249634#true} assume !(0 != ~p1~0); {249634#true} is VALID [2018-11-23 12:45:03,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {249634#true} assume !(0 != ~p2~0); {249634#true} is VALID [2018-11-23 12:45:03,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {249634#true} assume !(0 != ~p3~0); {249634#true} is VALID [2018-11-23 12:45:03,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {249634#true} assume !(0 != ~p4~0); {249634#true} is VALID [2018-11-23 12:45:03,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {249634#true} assume !(0 != ~p5~0); {249634#true} is VALID [2018-11-23 12:45:03,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {249634#true} assume !(0 != ~p6~0); {249634#true} is VALID [2018-11-23 12:45:03,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {249634#true} assume !(0 != ~p7~0); {249634#true} is VALID [2018-11-23 12:45:03,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {249634#true} assume !(0 != ~p8~0); {249634#true} is VALID [2018-11-23 12:45:03,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {249634#true} assume 0 != ~p9~0;~lk9~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {249636#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,352 INFO L273 TraceCheckUtils]: 30: Hoare triple {249636#(= main_~lk9~0 1)} assume 0 != ~p9~0; {249636#(= main_~lk9~0 1)} is VALID [2018-11-23 12:45:03,352 INFO L273 TraceCheckUtils]: 31: Hoare triple {249636#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {249635#false} is VALID [2018-11-23 12:45:03,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {249635#false} assume !false; {249635#false} is VALID [2018-11-23 12:45:03,353 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:45:03,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:45:03,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:45:03,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:45:03,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:45:03,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:45:03,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:45:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:45:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:45:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:45:03,385 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-11-23 12:45:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:26,419 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-11-23 12:45:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:45:26,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 12:45:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:45:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:45:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:45:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:45:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:45:26,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 12:45:26,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:45:43,374 INFO L225 Difference]: With dead ends: 19852 [2018-11-23 12:45:43,375 INFO L226 Difference]: Without dead ends: 19850 [2018-11-23 12:45:43,378 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:45:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-11-23 12:45:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-11-23 12:45:47,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:45:47,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19850 states. Second operand 16264 states. [2018-11-23 12:45:47,923 INFO L74 IsIncluded]: Start isIncluded. First operand 19850 states. Second operand 16264 states. [2018-11-23 12:45:47,923 INFO L87 Difference]: Start difference. First operand 19850 states. Second operand 16264 states.