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_14_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:42:27,536 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:42:27,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:42:27,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:42:27,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:42:27,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:42:27,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:42:27,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:42:27,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:42:27,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:42:27,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:42:27,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:42:27,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:42:27,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:42:27,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:42:27,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:42:27,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:42:27,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:42:27,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:42:27,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:42:27,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:42:27,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:42:27,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:42:27,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:42:27,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:42:27,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:42:27,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:42:27,581 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:42:27,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:42:27,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:42:27,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:42:27,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:42:27,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:42:27,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:42:27,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:42:27,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:42:27,587 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:27,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:42:27,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:42:27,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:42:27,611 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:42:27,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:42:27,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:42:27,612 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:42:27,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:42:27,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:42:27,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:42:27,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:42:27,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:42:27,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:42:27,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:42:27,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:42:27,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:42:27,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:42:27,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:42:27,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:42:27,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:42:27,617 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:42:27,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:42:27,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:42:27,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:42:27,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:42:27,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:42:27,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:42:27,619 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:42:27,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:42:27,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:42:27,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:42:27,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:42:27,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:42:27,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:42:27,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:42:27,717 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:42:27,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:27,781 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfb6dd9a/b79e0ebbdb5c4301bed1f0b91f50b454/FLAGf1dc925f6 [2018-11-23 12:42:28,240 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:42:28,241 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:28,251 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfb6dd9a/b79e0ebbdb5c4301bed1f0b91f50b454/FLAGf1dc925f6 [2018-11-23 12:42:28,596 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfb6dd9a/b79e0ebbdb5c4301bed1f0b91f50b454 [2018-11-23 12:42:28,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:42:28,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:42:28,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:28,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:42:28,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:42:28,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:28" (1/1) ... [2018-11-23 12:42:28,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f57c199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:28, skipping insertion in model container [2018-11-23 12:42:28,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:28" (1/1) ... [2018-11-23 12:42:28,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:42:28,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:42:28,865 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:28,871 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:42:28,927 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:28,949 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:42:28,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:28 WrapperNode [2018-11-23 12:42:28,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:28,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:28,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:42:28,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:42:28,958 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:28" (1/1) ... [2018-11-23 12:42:28,965 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:28" (1/1) ... [2018-11-23 12:42:28,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:28,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:42:28,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:42:28,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:42:28,982 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:28" (1/1) ... [2018-11-23 12:42:28,982 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:28" (1/1) ... [2018-11-23 12:42:28,983 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:28" (1/1) ... [2018-11-23 12:42:28,984 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:28" (1/1) ... [2018-11-23 12:42:28,995 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:28" (1/1) ... [2018-11-23 12:42:29,009 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:28" (1/1) ... [2018-11-23 12:42:29,011 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:28" (1/1) ... [2018-11-23 12:42:29,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:42:29,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:42:29,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:42:29,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:42:29,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:28" (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:29,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:42:29,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:42:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:42:29,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:42:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:42:29,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:42:30,279 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:42:30,279 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:42:30,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:30 BoogieIcfgContainer [2018-11-23 12:42:30,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:42:30,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:42:30,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:42:30,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:42:30,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:42:28" (1/3) ... [2018-11-23 12:42:30,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b98d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:30, skipping insertion in model container [2018-11-23 12:42:30,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:28" (2/3) ... [2018-11-23 12:42:30,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b98d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:30, skipping insertion in model container [2018-11-23 12:42:30,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:30" (3/3) ... [2018-11-23 12:42:30,289 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:30,299 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:42:30,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:42:30,323 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:42:30,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:42:30,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:42:30,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:42:30,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:42:30,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:42:30,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:42:30,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:42:30,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:42:30,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:42:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-23 12:42:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:30,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:30,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:30,400 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:30,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-11-23 12:42:30,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:30,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:30,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-23 12:42:30,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-23 12:42:30,766 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {59#true} {59#true} #265#return; {59#true} is VALID [2018-11-23 12:42:30,767 INFO L256 TraceCheckUtils]: 3: Hoare triple {59#true} call #t~ret15 := main(); {59#true} is VALID [2018-11-23 12:42:30,767 INFO L273 TraceCheckUtils]: 4: Hoare triple {59#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;havoc ~cond~0; {59#true} is VALID [2018-11-23 12:42:30,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {59#true} is VALID [2018-11-23 12:42:30,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#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; {59#true} is VALID [2018-11-23 12:42:30,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} assume 0 != ~p1~0;~lk1~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {61#(= main_~lk1~0 1)} assume 0 != ~p1~0; {61#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:30,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {61#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {60#false} is VALID [2018-11-23 12:42:30,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-23 12:42:30,809 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:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:30,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:30,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:30,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:30,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:30,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:30,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:30,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:30,898 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-23 12:42:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:31,973 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-11-23 12:42:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:31,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 12:42:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 12:42:32,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2018-11-23 12:42:32,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:32,449 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:42:32,449 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:42:32,453 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:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:42:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-11-23 12:42:32,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:32,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 66 states. [2018-11-23 12:42:32,499 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 66 states. [2018-11-23 12:42:32,500 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 66 states. [2018-11-23 12:42:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:32,510 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2018-11-23 12:42:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2018-11-23 12:42:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:32,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 96 states. [2018-11-23 12:42:32,513 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 96 states. [2018-11-23 12:42:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:32,523 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2018-11-23 12:42:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2018-11-23 12:42:32,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:32,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:32,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:32,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:42:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-11-23 12:42:32,532 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-11-23 12:42:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:32,533 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-11-23 12:42:32,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-11-23 12:42:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:32,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:32,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:32,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:32,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-11-23 12:42:32,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:32,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:32,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:32,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:32,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:32,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {451#true} is VALID [2018-11-23 12:42:32,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {451#true} assume true; {451#true} is VALID [2018-11-23 12:42:32,666 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} #265#return; {451#true} is VALID [2018-11-23 12:42:32,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {451#true} call #t~ret15 := main(); {451#true} is VALID [2018-11-23 12:42:32,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {451#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;havoc ~cond~0; {451#true} is VALID [2018-11-23 12:42:32,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {451#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {451#true} is VALID [2018-11-23 12:42:32,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {451#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; {451#true} is VALID [2018-11-23 12:42:32,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {451#true} assume !(0 != ~p1~0); {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {453#(= main_~p1~0 0)} assume !(0 != ~p8~0); {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {453#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:32,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {453#(= main_~p1~0 0)} assume 0 != ~p1~0; {452#false} is VALID [2018-11-23 12:42:32,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {452#false} assume 1 != ~lk1~0; {452#false} is VALID [2018-11-23 12:42:32,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {452#false} assume !false; {452#false} is VALID [2018-11-23 12:42:32,729 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:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:32,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:32,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:32,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:32,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:32,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:32,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:32,792 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-11-23 12:42:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:33,125 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-11-23 12:42:33,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:33,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2018-11-23 12:42:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2018-11-23 12:42:33,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 263 transitions. [2018-11-23 12:42:33,474 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:42:33,479 INFO L225 Difference]: With dead ends: 157 [2018-11-23 12:42:33,479 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:42:33,481 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:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:42:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-23 12:42:33,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:33,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-23 12:42:33,524 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-23 12:42:33,524 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-23 12:42:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:33,530 INFO L93 Difference]: Finished difference Result 96 states and 174 transitions. [2018-11-23 12:42:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 174 transitions. [2018-11-23 12:42:33,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:33,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:33,532 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-23 12:42:33,532 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-23 12:42:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:33,538 INFO L93 Difference]: Finished difference Result 96 states and 174 transitions. [2018-11-23 12:42:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 174 transitions. [2018-11-23 12:42:33,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:33,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:33,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:33,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:42:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-11-23 12:42:33,547 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-11-23 12:42:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:33,548 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-11-23 12:42:33,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-11-23 12:42:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:33,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:33,549 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,550 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:33,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-11-23 12:42:33,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:33,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2018-11-23 12:42:33,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2018-11-23 12:42:33,653 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #265#return; {916#true} is VALID [2018-11-23 12:42:33,653 INFO L256 TraceCheckUtils]: 3: Hoare triple {916#true} call #t~ret15 := main(); {916#true} is VALID [2018-11-23 12:42:33,653 INFO L273 TraceCheckUtils]: 4: Hoare triple {916#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;havoc ~cond~0; {916#true} is VALID [2018-11-23 12:42:33,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {916#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {916#true} is VALID [2018-11-23 12:42:33,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {916#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; {916#true} is VALID [2018-11-23 12:42:33,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {916#true} assume 0 != ~p1~0;~lk1~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {918#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {918#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {918#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:33,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {918#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {917#false} is VALID [2018-11-23 12:42:33,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {917#false} assume 0 != ~p2~0; {917#false} is VALID [2018-11-23 12:42:33,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {917#false} assume 1 != ~lk2~0; {917#false} is VALID [2018-11-23 12:42:33,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {917#false} assume !false; {917#false} is VALID [2018-11-23 12:42:33,690 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,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:33,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:33,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:33,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:33,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:33,723 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:33,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:33,725 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-11-23 12:42:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:34,120 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-11-23 12:42:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:34,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2018-11-23 12:42:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2018-11-23 12:42:34,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 258 transitions. [2018-11-23 12:42:34,462 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:42:34,466 INFO L225 Difference]: With dead ends: 144 [2018-11-23 12:42:34,466 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:42:34,467 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:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:42:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 12:42:34,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:34,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-23 12:42:34,483 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-23 12:42:34,483 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-23 12:42:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:34,488 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2018-11-23 12:42:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 176 transitions. [2018-11-23 12:42:34,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:34,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:34,490 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-23 12:42:34,490 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-23 12:42:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:34,495 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2018-11-23 12:42:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 176 transitions. [2018-11-23 12:42:34,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:34,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:34,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:34,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:42:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-11-23 12:42:34,501 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-11-23 12:42:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:34,502 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-11-23 12:42:34,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-11-23 12:42:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:34,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:34,503 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:34,503 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:34,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-11-23 12:42:34,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:34,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:34,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:34,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-23 12:42:34,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-23 12:42:34,589 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #265#return; {1379#true} is VALID [2018-11-23 12:42:34,589 INFO L256 TraceCheckUtils]: 3: Hoare triple {1379#true} call #t~ret15 := main(); {1379#true} is VALID [2018-11-23 12:42:34,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {1379#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;havoc ~cond~0; {1379#true} is VALID [2018-11-23 12:42:34,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {1379#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1379#true} is VALID [2018-11-23 12:42:34,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {1379#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; {1379#true} is VALID [2018-11-23 12:42:34,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {1379#true} assume !(0 != ~p1~0); {1379#true} is VALID [2018-11-23 12:42:34,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {1379#true} assume 0 != ~p2~0;~lk2~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {1381#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {1381#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {1381#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1381#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:34,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {1381#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1380#false} is VALID [2018-11-23 12:42:34,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-23 12:42:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:34,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:34,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:34,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:34,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:34,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:34,649 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,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:34,650 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-11-23 12:42:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:34,937 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-11-23 12:42:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:34,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:42:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:42:34,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 12:42:35,167 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:35,172 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:42:35,173 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 12:42:35,173 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,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 12:42:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-11-23 12:42:35,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:35,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 128 states. [2018-11-23 12:42:35,203 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 128 states. [2018-11-23 12:42:35,203 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 128 states. [2018-11-23 12:42:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,212 INFO L93 Difference]: Finished difference Result 182 states and 333 transitions. [2018-11-23 12:42:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 333 transitions. [2018-11-23 12:42:35,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:35,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:35,213 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 182 states. [2018-11-23 12:42:35,213 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 182 states. [2018-11-23 12:42:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,221 INFO L93 Difference]: Finished difference Result 182 states and 333 transitions. [2018-11-23 12:42:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 333 transitions. [2018-11-23 12:42:35,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:35,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:35,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:35,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 12:42:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-11-23 12:42:35,228 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-11-23 12:42:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:35,229 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-11-23 12:42:35,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-11-23 12:42:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:35,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:35,230 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,230 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:35,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-11-23 12:42:35,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:35,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:35,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {2080#true} call ULTIMATE.init(); {2080#true} is VALID [2018-11-23 12:42:35,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {2080#true} assume true; {2080#true} is VALID [2018-11-23 12:42:35,332 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2080#true} {2080#true} #265#return; {2080#true} is VALID [2018-11-23 12:42:35,332 INFO L256 TraceCheckUtils]: 3: Hoare triple {2080#true} call #t~ret15 := main(); {2080#true} is VALID [2018-11-23 12:42:35,332 INFO L273 TraceCheckUtils]: 4: Hoare triple {2080#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;havoc ~cond~0; {2080#true} is VALID [2018-11-23 12:42:35,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {2080#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {2080#true} is VALID [2018-11-23 12:42:35,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {2080#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; {2080#true} is VALID [2018-11-23 12:42:35,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {2080#true} assume !(0 != ~p1~0); {2080#true} is VALID [2018-11-23 12:42:35,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {2080#true} assume !(0 != ~p2~0); {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {2082#(= main_~p2~0 0)} assume !(0 != ~p8~0); {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {2082#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2082#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:35,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {2082#(= main_~p2~0 0)} assume 0 != ~p2~0; {2081#false} is VALID [2018-11-23 12:42:35,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {2081#false} assume 1 != ~lk2~0; {2081#false} is VALID [2018-11-23 12:42:35,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {2081#false} assume !false; {2081#false} is VALID [2018-11-23 12:42:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:35,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:35,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:35,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:35,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:35,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:35,432 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:35,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:35,434 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-11-23 12:42:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:35,868 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-11-23 12:42:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:35,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2018-11-23 12:42:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2018-11-23 12:42:35,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2018-11-23 12:42:36,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:36,371 INFO L225 Difference]: With dead ends: 304 [2018-11-23 12:42:36,371 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 12:42:36,373 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,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 12:42:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-11-23 12:42:36,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:36,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 182 states. [2018-11-23 12:42:36,402 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 182 states. [2018-11-23 12:42:36,402 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 182 states. [2018-11-23 12:42:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:36,408 INFO L93 Difference]: Finished difference Result 184 states and 331 transitions. [2018-11-23 12:42:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 331 transitions. [2018-11-23 12:42:36,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:36,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:36,409 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 184 states. [2018-11-23 12:42:36,409 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 184 states. [2018-11-23 12:42:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:36,417 INFO L93 Difference]: Finished difference Result 184 states and 331 transitions. [2018-11-23 12:42:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 331 transitions. [2018-11-23 12:42:36,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:36,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:36,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:36,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-23 12:42:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-11-23 12:42:36,425 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-11-23 12:42:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:36,426 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-11-23 12:42:36,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-11-23 12:42:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:36,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:36,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:36,427 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:36,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-11-23 12:42:36,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:36,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:36,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:36,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {2963#true} call ULTIMATE.init(); {2963#true} is VALID [2018-11-23 12:42:36,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {2963#true} assume true; {2963#true} is VALID [2018-11-23 12:42:36,685 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2963#true} {2963#true} #265#return; {2963#true} is VALID [2018-11-23 12:42:36,685 INFO L256 TraceCheckUtils]: 3: Hoare triple {2963#true} call #t~ret15 := main(); {2963#true} is VALID [2018-11-23 12:42:36,685 INFO L273 TraceCheckUtils]: 4: Hoare triple {2963#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;havoc ~cond~0; {2963#true} is VALID [2018-11-23 12:42:36,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {2963#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {2963#true} is VALID [2018-11-23 12:42:36,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {2963#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; {2963#true} is VALID [2018-11-23 12:42:36,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {2963#true} assume !(0 != ~p1~0); {2963#true} is VALID [2018-11-23 12:42:36,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {2963#true} assume 0 != ~p2~0;~lk2~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {2965#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {2965#(not (= main_~p2~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {2965#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {2965#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:36,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {2965#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {2964#false} is VALID [2018-11-23 12:42:36,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {2964#false} assume 0 != ~p3~0; {2964#false} is VALID [2018-11-23 12:42:36,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {2964#false} assume 1 != ~lk3~0; {2964#false} is VALID [2018-11-23 12:42:36,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {2964#false} assume !false; {2964#false} is VALID [2018-11-23 12:42:36,783 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,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:36,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:36,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:36,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:36,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:36,812 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,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:36,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:36,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:36,813 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-11-23 12:42:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,115 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-11-23 12:42:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:37,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2018-11-23 12:42:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2018-11-23 12:42:37,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2018-11-23 12:42:37,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:37,579 INFO L225 Difference]: With dead ends: 273 [2018-11-23 12:42:37,579 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 12:42:37,580 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:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 12:42:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-23 12:42:37,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:37,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2018-11-23 12:42:37,609 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2018-11-23 12:42:37,609 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2018-11-23 12:42:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,614 INFO L93 Difference]: Finished difference Result 186 states and 331 transitions. [2018-11-23 12:42:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 331 transitions. [2018-11-23 12:42:37,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:37,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:37,615 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2018-11-23 12:42:37,615 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2018-11-23 12:42:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,620 INFO L93 Difference]: Finished difference Result 186 states and 331 transitions. [2018-11-23 12:42:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 331 transitions. [2018-11-23 12:42:37,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:37,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:37,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:37,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 12:42:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-11-23 12:42:37,627 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-11-23 12:42:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:37,627 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-11-23 12:42:37,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-11-23 12:42:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:37,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:37,628 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,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:37,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-11-23 12:42:37,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:37,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:37,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:37,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {3821#true} call ULTIMATE.init(); {3821#true} is VALID [2018-11-23 12:42:37,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {3821#true} assume true; {3821#true} is VALID [2018-11-23 12:42:37,853 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3821#true} {3821#true} #265#return; {3821#true} is VALID [2018-11-23 12:42:37,853 INFO L256 TraceCheckUtils]: 3: Hoare triple {3821#true} call #t~ret15 := main(); {3821#true} is VALID [2018-11-23 12:42:37,853 INFO L273 TraceCheckUtils]: 4: Hoare triple {3821#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;havoc ~cond~0; {3821#true} is VALID [2018-11-23 12:42:37,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {3821#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {3821#true} is VALID [2018-11-23 12:42:37,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {3821#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; {3821#true} is VALID [2018-11-23 12:42:37,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {3821#true} assume !(0 != ~p1~0); {3821#true} is VALID [2018-11-23 12:42:37,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {3821#true} assume !(0 != ~p2~0); {3821#true} is VALID [2018-11-23 12:42:37,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {3821#true} assume 0 != ~p3~0;~lk3~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {3823#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {3823#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {3823#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {3823#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3823#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:37,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {3823#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3822#false} is VALID [2018-11-23 12:42:37,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {3822#false} assume !false; {3822#false} is VALID [2018-11-23 12:42:37,888 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,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:37,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:37,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:37,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:37,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:37,966 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,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:37,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:37,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:37,967 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-11-23 12:42:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:38,221 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-11-23 12:42:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:38,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 12:42:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 12:42:38,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2018-11-23 12:42:39,058 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:39,067 INFO L225 Difference]: With dead ends: 348 [2018-11-23 12:42:39,067 INFO L226 Difference]: Without dead ends: 346 [2018-11-23 12:42:39,067 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,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-23 12:42:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-11-23 12:42:39,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:39,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand 248 states. [2018-11-23 12:42:39,120 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand 248 states. [2018-11-23 12:42:39,120 INFO L87 Difference]: Start difference. First operand 346 states. Second operand 248 states. [2018-11-23 12:42:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:39,131 INFO L93 Difference]: Finished difference Result 346 states and 627 transitions. [2018-11-23 12:42:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 627 transitions. [2018-11-23 12:42:39,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:39,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:39,133 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 346 states. [2018-11-23 12:42:39,133 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 346 states. [2018-11-23 12:42:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:39,143 INFO L93 Difference]: Finished difference Result 346 states and 627 transitions. [2018-11-23 12:42:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 627 transitions. [2018-11-23 12:42:39,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:39,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:39,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:39,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-23 12:42:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-11-23 12:42:39,151 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-11-23 12:42:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:39,152 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-11-23 12:42:39,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-11-23 12:42:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:39,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:39,153 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:39,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:39,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-11-23 12:42:39,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:39,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:39,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:39,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:39,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:39,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {5140#true} call ULTIMATE.init(); {5140#true} is VALID [2018-11-23 12:42:39,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {5140#true} assume true; {5140#true} is VALID [2018-11-23 12:42:39,379 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5140#true} {5140#true} #265#return; {5140#true} is VALID [2018-11-23 12:42:39,379 INFO L256 TraceCheckUtils]: 3: Hoare triple {5140#true} call #t~ret15 := main(); {5140#true} is VALID [2018-11-23 12:42:39,379 INFO L273 TraceCheckUtils]: 4: Hoare triple {5140#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;havoc ~cond~0; {5140#true} is VALID [2018-11-23 12:42:39,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {5140#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {5140#true} is VALID [2018-11-23 12:42:39,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {5140#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; {5140#true} is VALID [2018-11-23 12:42:39,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {5140#true} assume !(0 != ~p1~0); {5140#true} is VALID [2018-11-23 12:42:39,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {5140#true} assume !(0 != ~p2~0); {5140#true} is VALID [2018-11-23 12:42:39,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {5140#true} assume !(0 != ~p3~0); {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {5142#(= main_~p3~0 0)} assume !(0 != ~p8~0); {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {5142#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {5142#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5142#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:39,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {5142#(= main_~p3~0 0)} assume 0 != ~p3~0; {5141#false} is VALID [2018-11-23 12:42:39,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {5141#false} assume 1 != ~lk3~0; {5141#false} is VALID [2018-11-23 12:42:39,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {5141#false} assume !false; {5141#false} is VALID [2018-11-23 12:42:39,568 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:39,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:39,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:39,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:39,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:39,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:39,748 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:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:39,749 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-11-23 12:42:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:40,242 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-11-23 12:42:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:40,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2018-11-23 12:42:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2018-11-23 12:42:40,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 257 transitions. [2018-11-23 12:42:40,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:40,934 INFO L225 Difference]: With dead ends: 592 [2018-11-23 12:42:40,934 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 12:42:40,935 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:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 12:42:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-23 12:42:40,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:40,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand 352 states. [2018-11-23 12:42:40,974 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 352 states. [2018-11-23 12:42:40,974 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 352 states. [2018-11-23 12:42:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:40,985 INFO L93 Difference]: Finished difference Result 354 states and 627 transitions. [2018-11-23 12:42:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 627 transitions. [2018-11-23 12:42:40,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:40,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:40,987 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 354 states. [2018-11-23 12:42:40,987 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 354 states. [2018-11-23 12:42:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:40,998 INFO L93 Difference]: Finished difference Result 354 states and 627 transitions. [2018-11-23 12:42:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 627 transitions. [2018-11-23 12:42:40,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:40,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:40,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:41,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-23 12:42:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-11-23 12:42:41,010 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-11-23 12:42:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:41,010 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-11-23 12:42:41,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-11-23 12:42:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:41,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:41,012 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:41,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:41,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-11-23 12:42:41,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:41,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:41,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:41,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:41,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:41,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {6831#true} call ULTIMATE.init(); {6831#true} is VALID [2018-11-23 12:42:41,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {6831#true} assume true; {6831#true} is VALID [2018-11-23 12:42:41,244 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6831#true} {6831#true} #265#return; {6831#true} is VALID [2018-11-23 12:42:41,244 INFO L256 TraceCheckUtils]: 3: Hoare triple {6831#true} call #t~ret15 := main(); {6831#true} is VALID [2018-11-23 12:42:41,244 INFO L273 TraceCheckUtils]: 4: Hoare triple {6831#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;havoc ~cond~0; {6831#true} is VALID [2018-11-23 12:42:41,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {6831#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {6831#true} is VALID [2018-11-23 12:42:41,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {6831#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; {6831#true} is VALID [2018-11-23 12:42:41,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {6831#true} assume !(0 != ~p1~0); {6831#true} is VALID [2018-11-23 12:42:41,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {6831#true} assume !(0 != ~p2~0); {6831#true} is VALID [2018-11-23 12:42:41,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {6831#true} assume 0 != ~p3~0;~lk3~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {6833#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {6833#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {6833#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {6833#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6833#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:41,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {6833#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6832#false} is VALID [2018-11-23 12:42:41,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {6832#false} assume 0 != ~p4~0; {6832#false} is VALID [2018-11-23 12:42:41,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {6832#false} assume 1 != ~lk4~0; {6832#false} is VALID [2018-11-23 12:42:41,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {6832#false} assume !false; {6832#false} is VALID [2018-11-23 12:42:41,437 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,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:41,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:41,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:41,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:41,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:41,628 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,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:41,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:41,629 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-11-23 12:42:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,018 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-11-23 12:42:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:42,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2018-11-23 12:42:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2018-11-23 12:42:42,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2018-11-23 12:42:42,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:42,670 INFO L225 Difference]: With dead ends: 528 [2018-11-23 12:42:42,671 INFO L226 Difference]: Without dead ends: 358 [2018-11-23 12:42:42,671 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:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-23 12:42:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-11-23 12:42:42,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:42,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand 356 states. [2018-11-23 12:42:42,867 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand 356 states. [2018-11-23 12:42:42,867 INFO L87 Difference]: Start difference. First operand 358 states. Second operand 356 states. [2018-11-23 12:42:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,882 INFO L93 Difference]: Finished difference Result 358 states and 627 transitions. [2018-11-23 12:42:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 627 transitions. [2018-11-23 12:42:42,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:42,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:42,883 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand 358 states. [2018-11-23 12:42:42,883 INFO L87 Difference]: Start difference. First operand 356 states. Second operand 358 states. [2018-11-23 12:42:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:42,894 INFO L93 Difference]: Finished difference Result 358 states and 627 transitions. [2018-11-23 12:42:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 627 transitions. [2018-11-23 12:42:42,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:42,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:42,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:42,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-23 12:42:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-11-23 12:42:42,907 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-11-23 12:42:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:42,908 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-11-23 12:42:42,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-11-23 12:42:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:42,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:42,913 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,913 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:42,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-11-23 12:42:42,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:42,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:43,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {8470#true} call ULTIMATE.init(); {8470#true} is VALID [2018-11-23 12:42:43,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {8470#true} assume true; {8470#true} is VALID [2018-11-23 12:42:43,158 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8470#true} {8470#true} #265#return; {8470#true} is VALID [2018-11-23 12:42:43,158 INFO L256 TraceCheckUtils]: 3: Hoare triple {8470#true} call #t~ret15 := main(); {8470#true} is VALID [2018-11-23 12:42:43,159 INFO L273 TraceCheckUtils]: 4: Hoare triple {8470#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;havoc ~cond~0; {8470#true} is VALID [2018-11-23 12:42:43,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {8470#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {8470#true} is VALID [2018-11-23 12:42:43,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {8470#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; {8470#true} is VALID [2018-11-23 12:42:43,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {8470#true} assume !(0 != ~p1~0); {8470#true} is VALID [2018-11-23 12:42:43,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {8470#true} assume !(0 != ~p2~0); {8470#true} is VALID [2018-11-23 12:42:43,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {8470#true} assume !(0 != ~p3~0); {8470#true} is VALID [2018-11-23 12:42:43,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {8470#true} assume 0 != ~p4~0;~lk4~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {8472#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {8472#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {8472#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {8472#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {8472#(= main_~lk4~0 1)} assume 0 != ~p4~0; {8472#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:43,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {8472#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8471#false} is VALID [2018-11-23 12:42:43,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {8471#false} assume !false; {8471#false} is VALID [2018-11-23 12:42:43,312 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:43,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:43,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:43,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:43,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:43,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:43,364 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,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:43,365 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-11-23 12:42:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,186 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-11-23 12:42:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:44,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2018-11-23 12:42:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2018-11-23 12:42:44,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 166 transitions. [2018-11-23 12:42:44,759 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:42:44,779 INFO L225 Difference]: With dead ends: 668 [2018-11-23 12:42:44,779 INFO L226 Difference]: Without dead ends: 666 [2018-11-23 12:42:44,780 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,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-23 12:42:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-11-23 12:42:44,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:44,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand 488 states. [2018-11-23 12:42:44,916 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand 488 states. [2018-11-23 12:42:44,916 INFO L87 Difference]: Start difference. First operand 666 states. Second operand 488 states. [2018-11-23 12:42:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,941 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2018-11-23 12:42:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1183 transitions. [2018-11-23 12:42:44,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,942 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand 666 states. [2018-11-23 12:42:44,942 INFO L87 Difference]: Start difference. First operand 488 states. Second operand 666 states. [2018-11-23 12:42:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,967 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2018-11-23 12:42:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1183 transitions. [2018-11-23 12:42:44,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:44,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:44,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:44,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-23 12:42:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-11-23 12:42:44,983 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-11-23 12:42:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:44,983 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-11-23 12:42:44,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-11-23 12:42:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:44,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:44,985 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:44,985 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:44,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-11-23 12:42:44,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:44,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:45,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {11001#true} call ULTIMATE.init(); {11001#true} is VALID [2018-11-23 12:42:45,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {11001#true} assume true; {11001#true} is VALID [2018-11-23 12:42:45,060 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11001#true} {11001#true} #265#return; {11001#true} is VALID [2018-11-23 12:42:45,060 INFO L256 TraceCheckUtils]: 3: Hoare triple {11001#true} call #t~ret15 := main(); {11001#true} is VALID [2018-11-23 12:42:45,060 INFO L273 TraceCheckUtils]: 4: Hoare triple {11001#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;havoc ~cond~0; {11001#true} is VALID [2018-11-23 12:42:45,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {11001#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {11001#true} is VALID [2018-11-23 12:42:45,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {11001#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; {11001#true} is VALID [2018-11-23 12:42:45,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {11001#true} assume !(0 != ~p1~0); {11001#true} is VALID [2018-11-23 12:42:45,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {11001#true} assume !(0 != ~p2~0); {11001#true} is VALID [2018-11-23 12:42:45,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {11001#true} assume !(0 != ~p3~0); {11001#true} is VALID [2018-11-23 12:42:45,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {11001#true} assume !(0 != ~p4~0); {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {11003#(= main_~p4~0 0)} assume !(0 != ~p8~0); {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {11003#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,078 INFO L273 TraceCheckUtils]: 22: Hoare triple {11003#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {11003#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11003#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:45,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {11003#(= main_~p4~0 0)} assume 0 != ~p4~0; {11002#false} is VALID [2018-11-23 12:42:45,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {11002#false} assume 1 != ~lk4~0; {11002#false} is VALID [2018-11-23 12:42:45,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {11002#false} assume !false; {11002#false} is VALID [2018-11-23 12:42:45,081 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,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:45,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:45,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:45,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:45,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:45,111 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:45,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:45,112 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-11-23 12:42:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,376 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-11-23 12:42:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:45,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2018-11-23 12:42:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2018-11-23 12:42:45,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 254 transitions. [2018-11-23 12:42:45,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:45,615 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 12:42:45,616 INFO L226 Difference]: Without dead ends: 690 [2018-11-23 12:42:45,617 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:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-23 12:42:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-11-23 12:42:45,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:45,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 690 states. Second operand 688 states. [2018-11-23 12:42:45,752 INFO L74 IsIncluded]: Start isIncluded. First operand 690 states. Second operand 688 states. [2018-11-23 12:42:45,752 INFO L87 Difference]: Start difference. First operand 690 states. Second operand 688 states. [2018-11-23 12:42:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,779 INFO L93 Difference]: Finished difference Result 690 states and 1191 transitions. [2018-11-23 12:42:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1191 transitions. [2018-11-23 12:42:45,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,781 INFO L74 IsIncluded]: Start isIncluded. First operand 688 states. Second operand 690 states. [2018-11-23 12:42:45,781 INFO L87 Difference]: Start difference. First operand 688 states. Second operand 690 states. [2018-11-23 12:42:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,808 INFO L93 Difference]: Finished difference Result 690 states and 1191 transitions. [2018-11-23 12:42:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1191 transitions. [2018-11-23 12:42:45,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:45,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-23 12:42:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-11-23 12:42:45,838 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-11-23 12:42:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:45,839 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-11-23 12:42:45,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-11-23 12:42:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:45,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:45,840 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:45,840 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:45,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-11-23 12:42:45,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:45,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {14292#true} call ULTIMATE.init(); {14292#true} is VALID [2018-11-23 12:42:45,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {14292#true} assume true; {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14292#true} {14292#true} #265#return; {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L256 TraceCheckUtils]: 3: Hoare triple {14292#true} call #t~ret15 := main(); {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L273 TraceCheckUtils]: 4: Hoare triple {14292#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;havoc ~cond~0; {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {14292#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {14292#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; {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {14292#true} assume !(0 != ~p1~0); {14292#true} is VALID [2018-11-23 12:42:45,991 INFO L273 TraceCheckUtils]: 8: Hoare triple {14292#true} assume !(0 != ~p2~0); {14292#true} is VALID [2018-11-23 12:42:45,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {14292#true} assume !(0 != ~p3~0); {14292#true} is VALID [2018-11-23 12:42:45,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {14292#true} assume 0 != ~p4~0;~lk4~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {14294#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {14294#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {14294#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {14294#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:45,999 INFO L273 TraceCheckUtils]: 23: Hoare triple {14294#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {14294#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:46,007 INFO L273 TraceCheckUtils]: 24: Hoare triple {14294#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14293#false} is VALID [2018-11-23 12:42:46,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {14293#false} assume 0 != ~p5~0; {14293#false} is VALID [2018-11-23 12:42:46,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {14293#false} assume 1 != ~lk5~0; {14293#false} is VALID [2018-11-23 12:42:46,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {14293#false} assume !false; {14293#false} is VALID [2018-11-23 12:42:46,009 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,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:46,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,040 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,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,041 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-11-23 12:42:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,981 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-11-23 12:42:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2018-11-23 12:42:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2018-11-23 12:42:46,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2018-11-23 12:42:47,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,225 INFO L225 Difference]: With dead ends: 1032 [2018-11-23 12:42:47,225 INFO L226 Difference]: Without dead ends: 698 [2018-11-23 12:42:47,227 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,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-23 12:42:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-23 12:42:47,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand 696 states. [2018-11-23 12:42:47,374 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand 696 states. [2018-11-23 12:42:47,374 INFO L87 Difference]: Start difference. First operand 698 states. Second operand 696 states. [2018-11-23 12:42:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,394 INFO L93 Difference]: Finished difference Result 698 states and 1191 transitions. [2018-11-23 12:42:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1191 transitions. [2018-11-23 12:42:47,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,396 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand 698 states. [2018-11-23 12:42:47,396 INFO L87 Difference]: Start difference. First operand 696 states. Second operand 698 states. [2018-11-23 12:42:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,422 INFO L93 Difference]: Finished difference Result 698 states and 1191 transitions. [2018-11-23 12:42:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1191 transitions. [2018-11-23 12:42:47,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-23 12:42:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-11-23 12:42:47,452 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-11-23 12:42:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,452 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-11-23 12:42:47,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-11-23 12:42:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:47,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,454 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,454 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-11-23 12:42:47,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {17475#true} call ULTIMATE.init(); {17475#true} is VALID [2018-11-23 12:42:47,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {17475#true} assume true; {17475#true} is VALID [2018-11-23 12:42:47,530 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17475#true} {17475#true} #265#return; {17475#true} is VALID [2018-11-23 12:42:47,531 INFO L256 TraceCheckUtils]: 3: Hoare triple {17475#true} call #t~ret15 := main(); {17475#true} is VALID [2018-11-23 12:42:47,531 INFO L273 TraceCheckUtils]: 4: Hoare triple {17475#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;havoc ~cond~0; {17475#true} is VALID [2018-11-23 12:42:47,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {17475#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {17475#true} is VALID [2018-11-23 12:42:47,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {17475#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; {17475#true} is VALID [2018-11-23 12:42:47,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {17475#true} assume !(0 != ~p1~0); {17475#true} is VALID [2018-11-23 12:42:47,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {17475#true} assume !(0 != ~p2~0); {17475#true} is VALID [2018-11-23 12:42:47,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {17475#true} assume !(0 != ~p3~0); {17475#true} is VALID [2018-11-23 12:42:47,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {17475#true} assume !(0 != ~p4~0); {17475#true} is VALID [2018-11-23 12:42:47,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {17475#true} assume 0 != ~p5~0;~lk5~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {17477#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {17477#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {17477#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {17477#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {17477#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {17477#(= main_~lk5~0 1)} assume 0 != ~p5~0; {17477#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:47,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {17477#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {17476#false} is VALID [2018-11-23 12:42:47,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {17476#false} assume !false; {17476#false} is VALID [2018-11-23 12:42:47,550 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,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:47,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,580 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,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,581 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-11-23 12:42:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,054 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-11-23 12:42:48,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:42:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:42:48,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 12:42:48,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,294 INFO L225 Difference]: With dead ends: 1292 [2018-11-23 12:42:48,295 INFO L226 Difference]: Without dead ends: 1290 [2018-11-23 12:42:48,295 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:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-23 12:42:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-11-23 12:42:48,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:48,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1290 states. Second operand 968 states. [2018-11-23 12:42:48,455 INFO L74 IsIncluded]: Start isIncluded. First operand 1290 states. Second operand 968 states. [2018-11-23 12:42:48,456 INFO L87 Difference]: Start difference. First operand 1290 states. Second operand 968 states. [2018-11-23 12:42:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,506 INFO L93 Difference]: Finished difference Result 1290 states and 2231 transitions. [2018-11-23 12:42:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2231 transitions. [2018-11-23 12:42:48,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,509 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 1290 states. [2018-11-23 12:42:48,509 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 1290 states. [2018-11-23 12:42:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,579 INFO L93 Difference]: Finished difference Result 1290 states and 2231 transitions. [2018-11-23 12:42:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2231 transitions. [2018-11-23 12:42:48,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:48,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 12:42:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-11-23 12:42:48,612 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-11-23 12:42:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:48,612 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-11-23 12:42:48,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-11-23 12:42:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:48,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:48,613 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:48,613 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:48,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:48,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-11-23 12:42:48,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:48,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:48,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:48,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:48,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {22382#true} call ULTIMATE.init(); {22382#true} is VALID [2018-11-23 12:42:48,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {22382#true} assume true; {22382#true} is VALID [2018-11-23 12:42:48,842 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22382#true} {22382#true} #265#return; {22382#true} is VALID [2018-11-23 12:42:48,842 INFO L256 TraceCheckUtils]: 3: Hoare triple {22382#true} call #t~ret15 := main(); {22382#true} is VALID [2018-11-23 12:42:48,842 INFO L273 TraceCheckUtils]: 4: Hoare triple {22382#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;havoc ~cond~0; {22382#true} is VALID [2018-11-23 12:42:48,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {22382#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {22382#true} is VALID [2018-11-23 12:42:48,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {22382#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; {22382#true} is VALID [2018-11-23 12:42:48,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {22382#true} assume !(0 != ~p1~0); {22382#true} is VALID [2018-11-23 12:42:48,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {22382#true} assume !(0 != ~p2~0); {22382#true} is VALID [2018-11-23 12:42:48,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {22382#true} assume !(0 != ~p3~0); {22382#true} is VALID [2018-11-23 12:42:48,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {22382#true} assume !(0 != ~p4~0); {22382#true} is VALID [2018-11-23 12:42:48,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {22382#true} assume !(0 != ~p5~0); {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {22384#(= main_~p5~0 0)} assume !(0 != ~p8~0); {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {22384#(= main_~p5~0 0)} assume !(0 != ~p1~0); {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {22384#(= main_~p5~0 0)} assume !(0 != ~p2~0); {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,858 INFO L273 TraceCheckUtils]: 23: Hoare triple {22384#(= main_~p5~0 0)} assume !(0 != ~p3~0); {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,861 INFO L273 TraceCheckUtils]: 24: Hoare triple {22384#(= main_~p5~0 0)} assume !(0 != ~p4~0); {22384#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:48,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {22384#(= main_~p5~0 0)} assume 0 != ~p5~0; {22383#false} is VALID [2018-11-23 12:42:48,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {22383#false} assume 1 != ~lk5~0; {22383#false} is VALID [2018-11-23 12:42:48,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {22383#false} assume !false; {22383#false} is VALID [2018-11-23 12:42:48,864 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:48,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:48,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:48,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:48,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:48,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:48,889 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:48,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:48,890 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-11-23 12:42:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,369 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-11-23 12:42:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:49,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2018-11-23 12:42:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2018-11-23 12:42:49,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 251 transitions. [2018-11-23 12:42:49,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:49,757 INFO L225 Difference]: With dead ends: 2300 [2018-11-23 12:42:49,757 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 12:42:49,759 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:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 12:42:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-23 12:42:50,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:50,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1352 states. [2018-11-23 12:42:50,874 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1352 states. [2018-11-23 12:42:50,874 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1352 states. [2018-11-23 12:42:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,933 INFO L93 Difference]: Finished difference Result 1354 states and 2263 transitions. [2018-11-23 12:42:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2263 transitions. [2018-11-23 12:42:50,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,934 INFO L74 IsIncluded]: Start isIncluded. First operand 1352 states. Second operand 1354 states. [2018-11-23 12:42:50,934 INFO L87 Difference]: Start difference. First operand 1352 states. Second operand 1354 states. [2018-11-23 12:42:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,011 INFO L93 Difference]: Finished difference Result 1354 states and 2263 transitions. [2018-11-23 12:42:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2263 transitions. [2018-11-23 12:42:51,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:51,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-23 12:42:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-11-23 12:42:51,073 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-11-23 12:42:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:51,073 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-11-23 12:42:51,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-11-23 12:42:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:51,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:51,074 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,075 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:51,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-11-23 12:42:51,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:51,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {28841#true} call ULTIMATE.init(); {28841#true} is VALID [2018-11-23 12:42:51,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {28841#true} assume true; {28841#true} is VALID [2018-11-23 12:42:51,303 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28841#true} {28841#true} #265#return; {28841#true} is VALID [2018-11-23 12:42:51,303 INFO L256 TraceCheckUtils]: 3: Hoare triple {28841#true} call #t~ret15 := main(); {28841#true} is VALID [2018-11-23 12:42:51,304 INFO L273 TraceCheckUtils]: 4: Hoare triple {28841#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;havoc ~cond~0; {28841#true} is VALID [2018-11-23 12:42:51,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {28841#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {28841#true} is VALID [2018-11-23 12:42:51,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {28841#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; {28841#true} is VALID [2018-11-23 12:42:51,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {28841#true} assume !(0 != ~p1~0); {28841#true} is VALID [2018-11-23 12:42:51,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {28841#true} assume !(0 != ~p2~0); {28841#true} is VALID [2018-11-23 12:42:51,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {28841#true} assume !(0 != ~p3~0); {28841#true} is VALID [2018-11-23 12:42:51,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {28841#true} assume !(0 != ~p4~0); {28841#true} is VALID [2018-11-23 12:42:51,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {28841#true} assume 0 != ~p5~0;~lk5~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {28843#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {28843#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {28843#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {28843#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {28843#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {28843#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {28843#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:51,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {28843#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {28842#false} is VALID [2018-11-23 12:42:51,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {28842#false} assume 0 != ~p6~0; {28842#false} is VALID [2018-11-23 12:42:51,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {28842#false} assume 1 != ~lk6~0; {28842#false} is VALID [2018-11-23 12:42:51,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {28842#false} assume !false; {28842#false} is VALID [2018-11-23 12:42:51,490 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:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:51,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:51,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:51,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:51,559 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:51,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:51,560 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-11-23 12:42:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,035 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-11-23 12:42:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:52,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2018-11-23 12:42:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2018-11-23 12:42:52,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 246 transitions. [2018-11-23 12:42:52,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,335 INFO L225 Difference]: With dead ends: 2028 [2018-11-23 12:42:52,336 INFO L226 Difference]: Without dead ends: 1370 [2018-11-23 12:42:52,337 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:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-23 12:42:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-11-23 12:42:52,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:52,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1370 states. Second operand 1368 states. [2018-11-23 12:42:52,948 INFO L74 IsIncluded]: Start isIncluded. First operand 1370 states. Second operand 1368 states. [2018-11-23 12:42:52,948 INFO L87 Difference]: Start difference. First operand 1370 states. Second operand 1368 states. [2018-11-23 12:42:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,013 INFO L93 Difference]: Finished difference Result 1370 states and 2263 transitions. [2018-11-23 12:42:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2263 transitions. [2018-11-23 12:42:53,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,014 INFO L74 IsIncluded]: Start isIncluded. First operand 1368 states. Second operand 1370 states. [2018-11-23 12:42:53,015 INFO L87 Difference]: Start difference. First operand 1368 states. Second operand 1370 states. [2018-11-23 12:42:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,067 INFO L93 Difference]: Finished difference Result 1370 states and 2263 transitions. [2018-11-23 12:42:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2263 transitions. [2018-11-23 12:42:53,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:53,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-11-23 12:42:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-11-23 12:42:53,124 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-11-23 12:42:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:53,124 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-11-23 12:42:53,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-11-23 12:42:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:53,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:53,126 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:53,126 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:53,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-11-23 12:42:53,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:53,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:53,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {35076#true} call ULTIMATE.init(); {35076#true} is VALID [2018-11-23 12:42:53,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {35076#true} assume true; {35076#true} is VALID [2018-11-23 12:42:53,217 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35076#true} {35076#true} #265#return; {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L256 TraceCheckUtils]: 3: Hoare triple {35076#true} call #t~ret15 := main(); {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 4: Hoare triple {35076#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;havoc ~cond~0; {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {35076#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {35076#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; {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {35076#true} assume !(0 != ~p1~0); {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {35076#true} assume !(0 != ~p2~0); {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {35076#true} assume !(0 != ~p3~0); {35076#true} is VALID [2018-11-23 12:42:53,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {35076#true} assume !(0 != ~p4~0); {35076#true} is VALID [2018-11-23 12:42:53,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {35076#true} assume !(0 != ~p5~0); {35076#true} is VALID [2018-11-23 12:42:53,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {35076#true} assume 0 != ~p6~0;~lk6~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {35078#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {35078#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {35078#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {35078#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {35078#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {35078#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {35078#(= main_~lk6~0 1)} assume 0 != ~p6~0; {35078#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:53,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {35078#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {35077#false} is VALID [2018-11-23 12:42:53,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {35077#false} assume !false; {35077#false} is VALID [2018-11-23 12:42:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:53,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:53,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:53,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:53,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:53,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:53,259 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:53,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:53,260 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-11-23 12:42:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,162 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-11-23 12:42:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:54,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:42:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:42:54,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 12:42:54,319 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:42:54,542 INFO L225 Difference]: With dead ends: 2508 [2018-11-23 12:42:54,542 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 12:42:54,544 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:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 12:42:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-11-23 12:42:55,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:55,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2506 states. Second operand 1928 states. [2018-11-23 12:42:55,081 INFO L74 IsIncluded]: Start isIncluded. First operand 2506 states. Second operand 1928 states. [2018-11-23 12:42:55,081 INFO L87 Difference]: Start difference. First operand 2506 states. Second operand 1928 states. [2018-11-23 12:42:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:55,269 INFO L93 Difference]: Finished difference Result 2506 states and 4199 transitions. [2018-11-23 12:42:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 4199 transitions. [2018-11-23 12:42:55,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:55,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:55,272 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 2506 states. [2018-11-23 12:42:55,272 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 2506 states. [2018-11-23 12:42:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:55,444 INFO L93 Difference]: Finished difference Result 2506 states and 4199 transitions. [2018-11-23 12:42:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 4199 transitions. [2018-11-23 12:42:55,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:55,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:55,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:55,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 12:42:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-11-23 12:42:55,562 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-11-23 12:42:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:55,562 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-11-23 12:42:55,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-11-23 12:42:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:55,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:55,565 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:55,566 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:55,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-11-23 12:42:55,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:55,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:55,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:55,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:55,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:55,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {44639#true} call ULTIMATE.init(); {44639#true} is VALID [2018-11-23 12:42:55,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {44639#true} assume true; {44639#true} is VALID [2018-11-23 12:42:55,638 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {44639#true} {44639#true} #265#return; {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L256 TraceCheckUtils]: 3: Hoare triple {44639#true} call #t~ret15 := main(); {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L273 TraceCheckUtils]: 4: Hoare triple {44639#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;havoc ~cond~0; {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {44639#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {44639#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; {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {44639#true} assume !(0 != ~p1~0); {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {44639#true} assume !(0 != ~p2~0); {44639#true} is VALID [2018-11-23 12:42:55,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {44639#true} assume !(0 != ~p3~0); {44639#true} is VALID [2018-11-23 12:42:55,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {44639#true} assume !(0 != ~p4~0); {44639#true} is VALID [2018-11-23 12:42:55,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {44639#true} assume !(0 != ~p5~0); {44639#true} is VALID [2018-11-23 12:42:55,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {44639#true} assume !(0 != ~p6~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {44641#(= main_~p6~0 0)} assume !(0 != ~p8~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {44641#(= main_~p6~0 0)} assume !(0 != ~p1~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {44641#(= main_~p6~0 0)} assume !(0 != ~p2~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {44641#(= main_~p6~0 0)} assume !(0 != ~p3~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {44641#(= main_~p6~0 0)} assume !(0 != ~p4~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {44641#(= main_~p6~0 0)} assume !(0 != ~p5~0); {44641#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:55,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {44641#(= main_~p6~0 0)} assume 0 != ~p6~0; {44640#false} is VALID [2018-11-23 12:42:55,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {44640#false} assume 1 != ~lk6~0; {44640#false} is VALID [2018-11-23 12:42:55,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {44640#false} assume !false; {44640#false} is VALID [2018-11-23 12:42:55,652 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:55,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:55,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:55,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:55,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:55,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:55,679 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:55,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:55,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:55,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:55,680 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-11-23 12:42:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,500 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-11-23 12:42:57,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:57,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-23 12:42:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-23 12:42:57,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 248 transitions. [2018-11-23 12:42:57,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:58,061 INFO L225 Difference]: With dead ends: 4556 [2018-11-23 12:42:58,061 INFO L226 Difference]: Without dead ends: 2666 [2018-11-23 12:42:58,093 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:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-23 12:42:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-11-23 12:42:58,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:58,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2666 states. Second operand 2664 states. [2018-11-23 12:42:58,620 INFO L74 IsIncluded]: Start isIncluded. First operand 2666 states. Second operand 2664 states. [2018-11-23 12:42:58,620 INFO L87 Difference]: Start difference. First operand 2666 states. Second operand 2664 states. [2018-11-23 12:42:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:58,879 INFO L93 Difference]: Finished difference Result 2666 states and 4295 transitions. [2018-11-23 12:42:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4295 transitions. [2018-11-23 12:42:58,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:58,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:58,882 INFO L74 IsIncluded]: Start isIncluded. First operand 2664 states. Second operand 2666 states. [2018-11-23 12:42:58,883 INFO L87 Difference]: Start difference. First operand 2664 states. Second operand 2666 states. [2018-11-23 12:42:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:59,127 INFO L93 Difference]: Finished difference Result 2666 states and 4295 transitions. [2018-11-23 12:42:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4295 transitions. [2018-11-23 12:42:59,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:59,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:59,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:59,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-11-23 12:42:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-11-23 12:42:59,358 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-11-23 12:42:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:59,359 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-11-23 12:42:59,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-11-23 12:42:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:42:59,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:59,360 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:59,361 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:59,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-11-23 12:42:59,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:59,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:59,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:59,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:59,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:59,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {57370#true} call ULTIMATE.init(); {57370#true} is VALID [2018-11-23 12:42:59,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {57370#true} assume true; {57370#true} is VALID [2018-11-23 12:42:59,501 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {57370#true} {57370#true} #265#return; {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L256 TraceCheckUtils]: 3: Hoare triple {57370#true} call #t~ret15 := main(); {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 4: Hoare triple {57370#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;havoc ~cond~0; {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {57370#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {57370#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; {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 7: Hoare triple {57370#true} assume !(0 != ~p1~0); {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {57370#true} assume !(0 != ~p2~0); {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {57370#true} assume !(0 != ~p3~0); {57370#true} is VALID [2018-11-23 12:42:59,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {57370#true} assume !(0 != ~p4~0); {57370#true} is VALID [2018-11-23 12:42:59,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {57370#true} assume !(0 != ~p5~0); {57370#true} is VALID [2018-11-23 12:42:59,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {57370#true} assume 0 != ~p6~0;~lk6~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {57372#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {57372#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:59,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {57372#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {57371#false} is VALID [2018-11-23 12:42:59,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {57371#false} assume 0 != ~p7~0; {57371#false} is VALID [2018-11-23 12:42:59,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {57371#false} assume 1 != ~lk7~0; {57371#false} is VALID [2018-11-23 12:42:59,509 INFO L273 TraceCheckUtils]: 29: Hoare triple {57371#false} assume !false; {57371#false} is VALID [2018-11-23 12:42:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:59,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:59,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:59,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:42:59,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:59,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:59,535 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:59,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:59,536 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-11-23 12:43:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,205 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-11-23 12:43:01,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:01,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 12:43:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 12:43:01,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-23 12:43:01,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:01,717 INFO L225 Difference]: With dead ends: 3996 [2018-11-23 12:43:01,717 INFO L226 Difference]: Without dead ends: 2698 [2018-11-23 12:43:01,720 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,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-23 12:43:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-11-23 12:43:02,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:02,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2698 states. Second operand 2696 states. [2018-11-23 12:43:02,292 INFO L74 IsIncluded]: Start isIncluded. First operand 2698 states. Second operand 2696 states. [2018-11-23 12:43:02,292 INFO L87 Difference]: Start difference. First operand 2698 states. Second operand 2696 states. [2018-11-23 12:43:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,493 INFO L93 Difference]: Finished difference Result 2698 states and 4295 transitions. [2018-11-23 12:43:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4295 transitions. [2018-11-23 12:43:02,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,496 INFO L74 IsIncluded]: Start isIncluded. First operand 2696 states. Second operand 2698 states. [2018-11-23 12:43:02,496 INFO L87 Difference]: Start difference. First operand 2696 states. Second operand 2698 states. [2018-11-23 12:43:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,697 INFO L93 Difference]: Finished difference Result 2698 states and 4295 transitions. [2018-11-23 12:43:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4295 transitions. [2018-11-23 12:43:02,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:02,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-23 12:43:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-11-23 12:43:02,965 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-11-23 12:43:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:02,966 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-11-23 12:43:02,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-11-23 12:43:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:02,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:02,969 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:43:02,969 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:02,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-11-23 12:43:02,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:02,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:02,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:03,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {69637#true} call ULTIMATE.init(); {69637#true} is VALID [2018-11-23 12:43:03,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {69637#true} assume true; {69637#true} is VALID [2018-11-23 12:43:03,100 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {69637#true} {69637#true} #265#return; {69637#true} is VALID [2018-11-23 12:43:03,100 INFO L256 TraceCheckUtils]: 3: Hoare triple {69637#true} call #t~ret15 := main(); {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 4: Hoare triple {69637#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;havoc ~cond~0; {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {69637#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {69637#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; {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {69637#true} assume !(0 != ~p1~0); {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {69637#true} assume !(0 != ~p2~0); {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {69637#true} assume !(0 != ~p3~0); {69637#true} is VALID [2018-11-23 12:43:03,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {69637#true} assume !(0 != ~p4~0); {69637#true} is VALID [2018-11-23 12:43:03,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {69637#true} assume !(0 != ~p5~0); {69637#true} is VALID [2018-11-23 12:43:03,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {69637#true} assume !(0 != ~p6~0); {69637#true} is VALID [2018-11-23 12:43:03,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {69637#true} assume 0 != ~p7~0;~lk7~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {69639#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,111 INFO L273 TraceCheckUtils]: 27: Hoare triple {69639#(= main_~lk7~0 1)} assume 0 != ~p7~0; {69639#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:03,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {69639#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {69638#false} is VALID [2018-11-23 12:43:03,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {69638#false} assume !false; {69638#false} is VALID [2018-11-23 12:43:03,114 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:03,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:03,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:03,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:03,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:03,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:03,152 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:43:03,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:03,153 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-11-23 12:43:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,446 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-11-23 12:43:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:05,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 12:43:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 12:43:05,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2018-11-23 12:43:05,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:06,439 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 12:43:06,439 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 12:43:06,440 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:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 12:43:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-11-23 12:43:07,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:07,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4874 states. Second operand 3848 states. [2018-11-23 12:43:07,346 INFO L74 IsIncluded]: Start isIncluded. First operand 4874 states. Second operand 3848 states. [2018-11-23 12:43:07,346 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3848 states. [2018-11-23 12:43:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,223 INFO L93 Difference]: Finished difference Result 4874 states and 7879 transitions. [2018-11-23 12:43:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7879 transitions. [2018-11-23 12:43:08,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:08,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:08,228 INFO L74 IsIncluded]: Start isIncluded. First operand 3848 states. Second operand 4874 states. [2018-11-23 12:43:08,228 INFO L87 Difference]: Start difference. First operand 3848 states. Second operand 4874 states. [2018-11-23 12:43:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,108 INFO L93 Difference]: Finished difference Result 4874 states and 7879 transitions. [2018-11-23 12:43:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7879 transitions. [2018-11-23 12:43:09,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:09,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:09,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:09,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-11-23 12:43:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-11-23 12:43:09,666 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-11-23 12:43:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:09,667 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-11-23 12:43:09,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-11-23 12:43:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:09,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:09,671 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:43:09,671 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:09,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-11-23 12:43:09,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:09,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:09,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {88320#true} call ULTIMATE.init(); {88320#true} is VALID [2018-11-23 12:43:09,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {88320#true} assume true; {88320#true} is VALID [2018-11-23 12:43:09,745 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {88320#true} {88320#true} #265#return; {88320#true} is VALID [2018-11-23 12:43:09,745 INFO L256 TraceCheckUtils]: 3: Hoare triple {88320#true} call #t~ret15 := main(); {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {88320#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;havoc ~cond~0; {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {88320#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {88320#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; {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {88320#true} assume !(0 != ~p1~0); {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {88320#true} assume !(0 != ~p2~0); {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {88320#true} assume !(0 != ~p3~0); {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {88320#true} assume !(0 != ~p4~0); {88320#true} is VALID [2018-11-23 12:43:09,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {88320#true} assume !(0 != ~p5~0); {88320#true} is VALID [2018-11-23 12:43:09,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {88320#true} assume !(0 != ~p6~0); {88320#true} is VALID [2018-11-23 12:43:09,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {88320#true} assume !(0 != ~p7~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p8~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p1~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p2~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p3~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p4~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p5~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {88322#(= main_~p7~0 0)} assume !(0 != ~p6~0); {88322#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:09,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {88322#(= main_~p7~0 0)} assume 0 != ~p7~0; {88321#false} is VALID [2018-11-23 12:43:09,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {88321#false} assume 1 != ~lk7~0; {88321#false} is VALID [2018-11-23 12:43:09,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {88321#false} assume !false; {88321#false} is VALID [2018-11-23 12:43:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:09,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:09,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:09,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:09,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:09,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:09,780 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:43:09,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:09,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:09,781 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-11-23 12:43:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:14,207 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-11-23 12:43:14,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:14,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 12:43:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 12:43:14,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-23 12:43:14,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:15,716 INFO L225 Difference]: With dead ends: 9036 [2018-11-23 12:43:15,716 INFO L226 Difference]: Without dead ends: 5258 [2018-11-23 12:43:15,722 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:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-23 12:43:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-11-23 12:43:16,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:16,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5258 states. Second operand 5256 states. [2018-11-23 12:43:16,929 INFO L74 IsIncluded]: Start isIncluded. First operand 5258 states. Second operand 5256 states. [2018-11-23 12:43:16,930 INFO L87 Difference]: Start difference. First operand 5258 states. Second operand 5256 states. [2018-11-23 12:43:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:17,934 INFO L93 Difference]: Finished difference Result 5258 states and 8135 transitions. [2018-11-23 12:43:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8135 transitions. [2018-11-23 12:43:17,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:17,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:17,940 INFO L74 IsIncluded]: Start isIncluded. First operand 5256 states. Second operand 5258 states. [2018-11-23 12:43:17,940 INFO L87 Difference]: Start difference. First operand 5256 states. Second operand 5258 states. [2018-11-23 12:43:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:18,962 INFO L93 Difference]: Finished difference Result 5258 states and 8135 transitions. [2018-11-23 12:43:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8135 transitions. [2018-11-23 12:43:18,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:18,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:18,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:18,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-11-23 12:43:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-11-23 12:43:20,095 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-11-23 12:43:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:20,095 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-11-23 12:43:20,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-11-23 12:43:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:20,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:20,098 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:20,098 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:20,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-11-23 12:43:20,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:20,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:20,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:20,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {113467#true} call ULTIMATE.init(); {113467#true} is VALID [2018-11-23 12:43:20,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {113467#true} assume true; {113467#true} is VALID [2018-11-23 12:43:20,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {113467#true} {113467#true} #265#return; {113467#true} is VALID [2018-11-23 12:43:20,253 INFO L256 TraceCheckUtils]: 3: Hoare triple {113467#true} call #t~ret15 := main(); {113467#true} is VALID [2018-11-23 12:43:20,253 INFO L273 TraceCheckUtils]: 4: Hoare triple {113467#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;havoc ~cond~0; {113467#true} is VALID [2018-11-23 12:43:20,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {113467#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {113467#true} is VALID [2018-11-23 12:43:20,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {113467#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; {113467#true} is VALID [2018-11-23 12:43:20,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {113467#true} assume !(0 != ~p1~0); {113467#true} is VALID [2018-11-23 12:43:20,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {113467#true} assume !(0 != ~p2~0); {113467#true} is VALID [2018-11-23 12:43:20,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {113467#true} assume !(0 != ~p3~0); {113467#true} is VALID [2018-11-23 12:43:20,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {113467#true} assume !(0 != ~p4~0); {113467#true} is VALID [2018-11-23 12:43:20,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {113467#true} assume !(0 != ~p5~0); {113467#true} is VALID [2018-11-23 12:43:20,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {113467#true} assume !(0 != ~p6~0); {113467#true} is VALID [2018-11-23 12:43:20,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {113467#true} assume 0 != ~p7~0;~lk7~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {113469#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {113469#(not (= main_~p7~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {113469#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {113469#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,275 INFO L273 TraceCheckUtils]: 19: Hoare triple {113469#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,275 INFO L273 TraceCheckUtils]: 20: Hoare triple {113469#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {113469#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:20,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {113469#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {113468#false} is VALID [2018-11-23 12:43:20,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {113468#false} assume 0 != ~p8~0; {113468#false} is VALID [2018-11-23 12:43:20,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {113468#false} assume 1 != ~lk8~0; {113468#false} is VALID [2018-11-23 12:43:20,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {113468#false} assume !false; {113468#false} is VALID [2018-11-23 12:43:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:20,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:20,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:20,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:20,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:20,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:20,343 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:20,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:20,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:20,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:20,343 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-11-23 12:43:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:24,623 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-11-23 12:43:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:24,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 12:43:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 12:43:24,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-23 12:43:25,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:26,962 INFO L225 Difference]: With dead ends: 7884 [2018-11-23 12:43:26,962 INFO L226 Difference]: Without dead ends: 5322 [2018-11-23 12:43:26,965 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:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-11-23 12:43:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-11-23 12:43:27,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:27,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5322 states. Second operand 5320 states. [2018-11-23 12:43:27,885 INFO L74 IsIncluded]: Start isIncluded. First operand 5322 states. Second operand 5320 states. [2018-11-23 12:43:27,885 INFO L87 Difference]: Start difference. First operand 5322 states. Second operand 5320 states. [2018-11-23 12:43:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:28,920 INFO L93 Difference]: Finished difference Result 5322 states and 8135 transitions. [2018-11-23 12:43:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 8135 transitions. [2018-11-23 12:43:28,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:28,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:28,924 INFO L74 IsIncluded]: Start isIncluded. First operand 5320 states. Second operand 5322 states. [2018-11-23 12:43:28,924 INFO L87 Difference]: Start difference. First operand 5320 states. Second operand 5322 states. [2018-11-23 12:43:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:29,985 INFO L93 Difference]: Finished difference Result 5322 states and 8135 transitions. [2018-11-23 12:43:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 8135 transitions. [2018-11-23 12:43:29,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:29,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:29,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:29,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-11-23 12:43:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-11-23 12:43:31,161 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-11-23 12:43:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:31,161 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-11-23 12:43:31,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-11-23 12:43:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:43:31,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:31,163 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:31,164 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:31,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-11-23 12:43:31,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:31,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:31,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:31,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {137654#true} call ULTIMATE.init(); {137654#true} is VALID [2018-11-23 12:43:31,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {137654#true} assume true; {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {137654#true} {137654#true} #265#return; {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L256 TraceCheckUtils]: 3: Hoare triple {137654#true} call #t~ret15 := main(); {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L273 TraceCheckUtils]: 4: Hoare triple {137654#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;havoc ~cond~0; {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {137654#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {137654#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; {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {137654#true} assume !(0 != ~p1~0); {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {137654#true} assume !(0 != ~p2~0); {137654#true} is VALID [2018-11-23 12:43:31,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {137654#true} assume !(0 != ~p3~0); {137654#true} is VALID [2018-11-23 12:43:31,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {137654#true} assume !(0 != ~p4~0); {137654#true} is VALID [2018-11-23 12:43:31,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {137654#true} assume !(0 != ~p5~0); {137654#true} is VALID [2018-11-23 12:43:31,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {137654#true} assume !(0 != ~p6~0); {137654#true} is VALID [2018-11-23 12:43:31,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {137654#true} assume !(0 != ~p7~0); {137654#true} is VALID [2018-11-23 12:43:31,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {137654#true} assume !(0 != ~p8~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p1~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p2~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p3~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p4~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p5~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p6~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {137656#(= main_~p8~0 0)} assume !(0 != ~p7~0); {137656#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:31,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {137656#(= main_~p8~0 0)} assume 0 != ~p8~0; {137655#false} is VALID [2018-11-23 12:43:31,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {137655#false} assume 1 != ~lk8~0; {137655#false} is VALID [2018-11-23 12:43:31,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {137655#false} assume !false; {137655#false} is VALID [2018-11-23 12:43:31,249 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:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:31,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:31,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:31,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:31,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:31,274 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:31,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:31,276 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-11-23 12:43:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:44,780 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-11-23 12:43:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:44,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:43:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 12:43:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 12:43:44,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-23 12:43:45,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:49,240 INFO L225 Difference]: With dead ends: 15564 [2018-11-23 12:43:49,241 INFO L226 Difference]: Without dead ends: 10378 [2018-11-23 12:43:49,247 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:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-11-23 12:43:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-11-23 12:43:52,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:52,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10378 states. Second operand 10376 states. [2018-11-23 12:43:52,537 INFO L74 IsIncluded]: Start isIncluded. First operand 10378 states. Second operand 10376 states. [2018-11-23 12:43:52,537 INFO L87 Difference]: Start difference. First operand 10378 states. Second operand 10376 states. [2018-11-23 12:43:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:56,409 INFO L93 Difference]: Finished difference Result 10378 states and 15495 transitions. [2018-11-23 12:43:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10378 states and 15495 transitions. [2018-11-23 12:43:56,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:56,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:56,416 INFO L74 IsIncluded]: Start isIncluded. First operand 10376 states. Second operand 10378 states. [2018-11-23 12:43:56,416 INFO L87 Difference]: Start difference. First operand 10376 states. Second operand 10378 states. [2018-11-23 12:44:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:00,472 INFO L93 Difference]: Finished difference Result 10378 states and 15495 transitions. [2018-11-23 12:44:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 10378 states and 15495 transitions. [2018-11-23 12:44:00,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:00,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:00,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:00,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-23 12:44:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-11-23 12:44:05,310 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-11-23 12:44:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:05,310 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-11-23 12:44:05,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-11-23 12:44:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:44:05,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:05,314 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:44:05,315 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:05,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-11-23 12:44:05,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:05,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:05,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:05,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {185009#true} call ULTIMATE.init(); {185009#true} is VALID [2018-11-23 12:44:05,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {185009#true} assume true; {185009#true} is VALID [2018-11-23 12:44:05,532 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {185009#true} {185009#true} #265#return; {185009#true} is VALID [2018-11-23 12:44:05,532 INFO L256 TraceCheckUtils]: 3: Hoare triple {185009#true} call #t~ret15 := main(); {185009#true} is VALID [2018-11-23 12:44:05,533 INFO L273 TraceCheckUtils]: 4: Hoare triple {185009#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;havoc ~cond~0; {185009#true} is VALID [2018-11-23 12:44:05,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {185009#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {185009#true} is VALID [2018-11-23 12:44:05,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {185009#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; {185009#true} is VALID [2018-11-23 12:44:05,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {185009#true} assume !(0 != ~p1~0); {185009#true} is VALID [2018-11-23 12:44:05,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {185009#true} assume !(0 != ~p2~0); {185009#true} is VALID [2018-11-23 12:44:05,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {185009#true} assume !(0 != ~p3~0); {185009#true} is VALID [2018-11-23 12:44:05,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {185009#true} assume !(0 != ~p4~0); {185009#true} is VALID [2018-11-23 12:44:05,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {185009#true} assume !(0 != ~p5~0); {185009#true} is VALID [2018-11-23 12:44:05,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {185009#true} assume !(0 != ~p6~0); {185009#true} is VALID [2018-11-23 12:44:05,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {185009#true} assume !(0 != ~p7~0); {185009#true} is VALID [2018-11-23 12:44:05,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {185009#true} assume 0 != ~p8~0;~lk8~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {185011#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {185011#(= main_~lk8~0 1)} assume 0 != ~p8~0; {185011#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:05,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {185011#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {185010#false} is VALID [2018-11-23 12:44:05,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {185010#false} assume !false; {185010#false} is VALID [2018-11-23 12:44:05,731 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:05,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:05,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:44:05,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:05,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:06,123 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:44:06,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:06,124 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-11-23 12:44:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:17,831 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-11-23 12:44:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:17,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:44:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 12:44:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 12:44:17,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-23 12:44:17,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:23,779 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 12:44:23,779 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 12:44:23,781 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:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 12:44:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-11-23 12:44:26,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:26,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 10376 states. [2018-11-23 12:44:26,783 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 10376 states. [2018-11-23 12:44:26,783 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 10376 states. [2018-11-23 12:44:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:32,354 INFO L93 Difference]: Finished difference Result 12170 states and 18695 transitions. [2018-11-23 12:44:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 18695 transitions. [2018-11-23 12:44:32,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:32,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:32,364 INFO L74 IsIncluded]: Start isIncluded. First operand 10376 states. Second operand 12170 states. [2018-11-23 12:44:32,364 INFO L87 Difference]: Start difference. First operand 10376 states. Second operand 12170 states. [2018-11-23 12:44:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:37,977 INFO L93 Difference]: Finished difference Result 12170 states and 18695 transitions. [2018-11-23 12:44:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 18695 transitions. [2018-11-23 12:44:37,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:37,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:37,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:37,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-23 12:44:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-11-23 12:44:42,802 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-11-23 12:44:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:42,802 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-11-23 12:44:42,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-11-23 12:44:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:44:42,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:42,807 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:42,807 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:42,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-11-23 12:44:42,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:42,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:42,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:43,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {232556#true} call ULTIMATE.init(); {232556#true} is VALID [2018-11-23 12:44:43,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {232556#true} assume true; {232556#true} is VALID [2018-11-23 12:44:43,015 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {232556#true} {232556#true} #265#return; {232556#true} is VALID [2018-11-23 12:44:43,015 INFO L256 TraceCheckUtils]: 3: Hoare triple {232556#true} call #t~ret15 := main(); {232556#true} is VALID [2018-11-23 12:44:43,015 INFO L273 TraceCheckUtils]: 4: Hoare triple {232556#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;havoc ~cond~0; {232556#true} is VALID [2018-11-23 12:44:43,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {232556#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {232556#true} is VALID [2018-11-23 12:44:43,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {232556#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; {232556#true} is VALID [2018-11-23 12:44:43,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {232556#true} assume !(0 != ~p1~0); {232556#true} is VALID [2018-11-23 12:44:43,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {232556#true} assume !(0 != ~p2~0); {232556#true} is VALID [2018-11-23 12:44:43,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {232556#true} assume !(0 != ~p3~0); {232556#true} is VALID [2018-11-23 12:44:43,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {232556#true} assume !(0 != ~p4~0); {232556#true} is VALID [2018-11-23 12:44:43,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {232556#true} assume !(0 != ~p5~0); {232556#true} is VALID [2018-11-23 12:44:43,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {232556#true} assume !(0 != ~p6~0); {232556#true} is VALID [2018-11-23 12:44:43,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {232556#true} assume !(0 != ~p7~0); {232556#true} is VALID [2018-11-23 12:44:43,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {232556#true} assume !(0 != ~p8~0); {232556#true} is VALID [2018-11-23 12:44:43,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {232556#true} assume 0 != ~p9~0;~lk9~0 := 1; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {232558#(= main_~lk9~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {232558#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {232558#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {232558#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {232558#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {232558#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {232558#(= main_~lk9~0 1)} assume 0 != ~p9~0; {232558#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:43,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {232558#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {232557#false} is VALID [2018-11-23 12:44:43,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {232557#false} assume !false; {232557#false} is VALID [2018-11-23 12:44:43,166 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:43,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:43,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:43,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:44:43,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:43,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:43,193 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:43,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:43,194 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-11-23 12:45:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:04,517 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-11-23 12:45:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:45:04,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:45:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:45:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:45:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:45:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:45:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:45:04,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 12:45:04,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:45:17,175 INFO L225 Difference]: With dead ends: 18316 [2018-11-23 12:45:17,175 INFO L226 Difference]: Without dead ends: 18314 [2018-11-23 12:45:17,178 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:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-11-23 12:45:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-11-23 12:45:20,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:45:20,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18314 states. Second operand 15240 states. [2018-11-23 12:45:20,927 INFO L74 IsIncluded]: Start isIncluded. First operand 18314 states. Second operand 15240 states. [2018-11-23 12:45:20,927 INFO L87 Difference]: Start difference. First operand 18314 states. Second operand 15240 states. [2018-11-23 12:45:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:34,855 INFO L93 Difference]: Finished difference Result 18314 states and 27527 transitions. [2018-11-23 12:45:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 18314 states and 27527 transitions. [2018-11-23 12:45:34,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:45:34,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:45:34,872 INFO L74 IsIncluded]: Start isIncluded. First operand 15240 states. Second operand 18314 states. [2018-11-23 12:45:34,872 INFO L87 Difference]: Start difference. First operand 15240 states. Second operand 18314 states. [2018-11-23 12:45:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:49,159 INFO L93 Difference]: Finished difference Result 18314 states and 27527 transitions. [2018-11-23 12:45:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 18314 states and 27527 transitions. [2018-11-23 12:45:49,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:45:49,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:45:49,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:45:49,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:45:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states.