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_6_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:42:41,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:42:41,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:42:41,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:42:41,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:42:41,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:42:41,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:42:41,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:42:41,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:42:41,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:42:41,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:42:41,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:42:41,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:42:41,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:42:41,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:42:41,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:42:41,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:42:41,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:42:41,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:42:41,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:42:41,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:42:41,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:42:41,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:42:41,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:42:41,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:42:41,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:42:41,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:42:41,309 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:42:41,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:42:41,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:42:41,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:42:41,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:42:41,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:42:41,314 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:42:41,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:42:41,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:42:41,317 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:41,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:42:41,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:42:41,344 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:42:41,344 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:42:41,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:42:41,346 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:42:41,346 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:42:41,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:42:41,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:42:41,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:42:41,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:42:41,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:42:41,347 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:42:41,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:42:41,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:42:41,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:42:41,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:42:41,349 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:42:41,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:42:41,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:42:41,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:42:41,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:42:41,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:42:41,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:42:41,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:42:41,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:42:41,352 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:42:41,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:42:41,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:42:41,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:42:41,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:42:41,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:42:41,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:42:41,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:42:41,446 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:42:41,446 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:42:41,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:41,510 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2777284ca/2dfaf2c4286648daba524a8d48419948/FLAGd777cacf2 [2018-11-23 12:42:41,966 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:42:41,967 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:41,975 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2777284ca/2dfaf2c4286648daba524a8d48419948/FLAGd777cacf2 [2018-11-23 12:42:42,315 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2777284ca/2dfaf2c4286648daba524a8d48419948 [2018-11-23 12:42:42,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:42:42,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:42:42,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:42,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:42:42,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:42:42,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:42" (1/1) ... [2018-11-23 12:42:42,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620fd748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:42, skipping insertion in model container [2018-11-23 12:42:42,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:42" (1/1) ... [2018-11-23 12:42:42,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:42:42,371 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:42:42,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:42,595 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:42:42,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:42,636 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:42:42,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:42 WrapperNode [2018-11-23 12:42:42,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:42,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:42,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:42:42,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:42:42,646 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:42" (1/1) ... [2018-11-23 12:42:42,653 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:42" (1/1) ... [2018-11-23 12:42:42,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:42,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:42:42,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:42:42,661 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:42:42,672 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:42" (1/1) ... [2018-11-23 12:42:42,672 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:42" (1/1) ... [2018-11-23 12:42:42,673 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:42" (1/1) ... [2018-11-23 12:42:42,674 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:42" (1/1) ... [2018-11-23 12:42:42,680 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:42" (1/1) ... [2018-11-23 12:42:42,689 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:42" (1/1) ... [2018-11-23 12:42:42,691 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:42" (1/1) ... [2018-11-23 12:42:42,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:42:42,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:42:42,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:42:42,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:42:42,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:42" (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:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:42:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:42:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:42:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:42:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:42:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:42:43,508 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:42:43,509 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:42:43,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:43 BoogieIcfgContainer [2018-11-23 12:42:43,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:42:43,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:42:43,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:42:43,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:42:43,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:42:42" (1/3) ... [2018-11-23 12:42:43,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c785946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:43, skipping insertion in model container [2018-11-23 12:42:43,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:42" (2/3) ... [2018-11-23 12:42:43,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c785946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:43, skipping insertion in model container [2018-11-23 12:42:43,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:43" (3/3) ... [2018-11-23 12:42:43,518 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:43,529 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:42:43,537 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:42:43,553 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:42:43,588 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:42:43,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:42:43,589 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:42:43,589 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:42:43,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:42:43,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:42:43,590 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:42:43,591 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:42:43,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:42:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:42:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:42:43,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:43,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:43,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:43,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-11-23 12:42:43,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:43,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:43,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:43,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:42:43,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:42:43,895 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #129#return; {35#true} is VALID [2018-11-23 12:42:43,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2018-11-23 12:42:43,896 INFO L273 TraceCheckUtils]: 4: Hoare triple {35#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;havoc ~cond~0; {35#true} is VALID [2018-11-23 12:42:43,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {35#true} is VALID [2018-11-23 12:42:43,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {35#true} is VALID [2018-11-23 12:42:43,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume 0 != ~p1~0;~lk1~0 := 1; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#(= main_~lk1~0 1)} assume 0 != ~p1~0; {37#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:43,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {36#false} is VALID [2018-11-23 12:42:43,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:42:43,982 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,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:43,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:43,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:43,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:43,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:44,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:44,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:44,172 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 12:42:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:44,610 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-11-23 12:42:44,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:44,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:42:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:42:44,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 12:42:45,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:45,174 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:42:45,174 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:42:45,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:42:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:42:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-23 12:42:45,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:45,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 34 states. [2018-11-23 12:42:45,219 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 34 states. [2018-11-23 12:42:45,219 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 34 states. [2018-11-23 12:42:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,226 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2018-11-23 12:42:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-11-23 12:42:45,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,228 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 48 states. [2018-11-23 12:42:45,229 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 48 states. [2018-11-23 12:42:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,235 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2018-11-23 12:42:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-11-23 12:42:45,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:45,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:42:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-11-23 12:42:45,243 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-11-23 12:42:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:45,243 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-11-23 12:42:45,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-11-23 12:42:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:42:45,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:45,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:45,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:45,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-11-23 12:42:45,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:45,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:45,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2018-11-23 12:42:45,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2018-11-23 12:42:45,334 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #129#return; {251#true} is VALID [2018-11-23 12:42:45,334 INFO L256 TraceCheckUtils]: 3: Hoare triple {251#true} call #t~ret7 := main(); {251#true} is VALID [2018-11-23 12:42:45,335 INFO L273 TraceCheckUtils]: 4: Hoare triple {251#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;havoc ~cond~0; {251#true} is VALID [2018-11-23 12:42:45,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {251#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {251#true} is VALID [2018-11-23 12:42:45,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {251#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {251#true} is VALID [2018-11-23 12:42:45,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {251#true} assume !(0 != ~p1~0); {253#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:45,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {253#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {253#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:45,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {253#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:45,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {253#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:45,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {253#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {253#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:45,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {253#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {253#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:45,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {253#(= main_~p1~0 0)} assume 0 != ~p1~0; {252#false} is VALID [2018-11-23 12:42:45,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {252#false} assume 1 != ~lk1~0; {252#false} is VALID [2018-11-23 12:42:45,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {252#false} assume !false; {252#false} is VALID [2018-11-23 12:42:45,388 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,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:45,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:45,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:45,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:45,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:45,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:45,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:45,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:45,474 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-11-23 12:42:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,027 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-23 12:42:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:42:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2018-11-23 12:42:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2018-11-23 12:42:46,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2018-11-23 12:42:46,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,275 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:42:46,275 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:42:46,276 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:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:42:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 12:42:46,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:46,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-23 12:42:46,293 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-23 12:42:46,293 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-23 12:42:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,297 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2018-11-23 12:42:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2018-11-23 12:42:46,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,299 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-23 12:42:46,299 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-23 12:42:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,303 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2018-11-23 12:42:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2018-11-23 12:42:46,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:46,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:42:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-11-23 12:42:46,308 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-11-23 12:42:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:46,309 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-11-23 12:42:46,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-11-23 12:42:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:46,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:46,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:46,310 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:46,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:46,311 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-11-23 12:42:46,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:46,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2018-11-23 12:42:46,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {492#true} assume true; {492#true} is VALID [2018-11-23 12:42:46,400 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {492#true} {492#true} #129#return; {492#true} is VALID [2018-11-23 12:42:46,401 INFO L256 TraceCheckUtils]: 3: Hoare triple {492#true} call #t~ret7 := main(); {492#true} is VALID [2018-11-23 12:42:46,401 INFO L273 TraceCheckUtils]: 4: Hoare triple {492#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;havoc ~cond~0; {492#true} is VALID [2018-11-23 12:42:46,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {492#true} is VALID [2018-11-23 12:42:46,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {492#true} is VALID [2018-11-23 12:42:46,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#true} assume 0 != ~p1~0;~lk1~0 := 1; {494#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {494#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {494#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {494#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {494#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {494#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {493#false} is VALID [2018-11-23 12:42:46,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {493#false} assume 0 != ~p2~0; {493#false} is VALID [2018-11-23 12:42:46,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {493#false} assume 1 != ~lk2~0; {493#false} is VALID [2018-11-23 12:42:46,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {493#false} assume !false; {493#false} is VALID [2018-11-23 12:42:46,410 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,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:46,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,501 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-11-23 12:42:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,704 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-11-23 12:42:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:42:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:42:46,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 12:42:46,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,873 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:42:46,873 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:42:46,874 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:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:42:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 12:42:46,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:46,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-23 12:42:46,900 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-23 12:42:46,900 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-23 12:42:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,904 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2018-11-23 12:42:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2018-11-23 12:42:46,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,906 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-23 12:42:46,906 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-23 12:42:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,909 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2018-11-23 12:42:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2018-11-23 12:42:46,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:46,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:42:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-11-23 12:42:46,914 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-11-23 12:42:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:46,914 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-11-23 12:42:46,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-11-23 12:42:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:46,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:46,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:46,916 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:46,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:46,917 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-11-23 12:42:46,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:46,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {739#true} call ULTIMATE.init(); {739#true} is VALID [2018-11-23 12:42:46,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {739#true} assume true; {739#true} is VALID [2018-11-23 12:42:46,988 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {739#true} {739#true} #129#return; {739#true} is VALID [2018-11-23 12:42:46,988 INFO L256 TraceCheckUtils]: 3: Hoare triple {739#true} call #t~ret7 := main(); {739#true} is VALID [2018-11-23 12:42:46,988 INFO L273 TraceCheckUtils]: 4: Hoare triple {739#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;havoc ~cond~0; {739#true} is VALID [2018-11-23 12:42:46,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {739#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {739#true} is VALID [2018-11-23 12:42:46,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {739#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {739#true} is VALID [2018-11-23 12:42:46,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#true} assume !(0 != ~p1~0); {739#true} is VALID [2018-11-23 12:42:46,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {739#true} assume 0 != ~p2~0;~lk2~0 := 1; {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:46,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {741#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:46,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {741#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:46,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {741#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:46,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {741#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {741#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {741#(= main_~lk2~0 1)} assume 0 != ~p2~0; {741#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {741#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {740#false} is VALID [2018-11-23 12:42:47,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {740#false} assume !false; {740#false} is VALID [2018-11-23 12:42:47,006 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,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:47,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,031 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-11-23 12:42:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,163 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-11-23 12:42:47,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:47,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 12:42:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 12:42:47,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-23 12:42:47,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,271 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:42:47,271 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:42:47,272 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,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:42:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-11-23 12:42:47,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 64 states. [2018-11-23 12:42:47,321 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 64 states. [2018-11-23 12:42:47,321 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 64 states. [2018-11-23 12:42:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,325 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2018-11-23 12:42:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2018-11-23 12:42:47,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,328 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 86 states. [2018-11-23 12:42:47,328 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 86 states. [2018-11-23 12:42:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,333 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2018-11-23 12:42:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2018-11-23 12:42:47,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:42:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-11-23 12:42:47,339 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-11-23 12:42:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,340 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-11-23 12:42:47,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-11-23 12:42:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:47,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:47,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-11-23 12:42:47,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {1088#true} call ULTIMATE.init(); {1088#true} is VALID [2018-11-23 12:42:47,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {1088#true} assume true; {1088#true} is VALID [2018-11-23 12:42:47,449 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1088#true} {1088#true} #129#return; {1088#true} is VALID [2018-11-23 12:42:47,449 INFO L256 TraceCheckUtils]: 3: Hoare triple {1088#true} call #t~ret7 := main(); {1088#true} is VALID [2018-11-23 12:42:47,449 INFO L273 TraceCheckUtils]: 4: Hoare triple {1088#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;havoc ~cond~0; {1088#true} is VALID [2018-11-23 12:42:47,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {1088#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1088#true} is VALID [2018-11-23 12:42:47,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {1088#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1088#true} is VALID [2018-11-23 12:42:47,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {1088#true} assume !(0 != ~p1~0); {1088#true} is VALID [2018-11-23 12:42:47,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {1088#true} assume !(0 != ~p2~0); {1090#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {1090#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1090#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {1090#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1090#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {1090#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1090#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1090#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1090#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#(= main_~p2~0 0)} assume 0 != ~p2~0; {1089#false} is VALID [2018-11-23 12:42:47,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {1089#false} assume 1 != ~lk2~0; {1089#false} is VALID [2018-11-23 12:42:47,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {1089#false} assume !false; {1089#false} is VALID [2018-11-23 12:42:47,462 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,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:47,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,481 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-11-23 12:42:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,596 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-11-23 12:42:47,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:47,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 12:42:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 12:42:47,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2018-11-23 12:42:47,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:47,816 INFO L225 Difference]: With dead ends: 144 [2018-11-23 12:42:47,817 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:42:47,818 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,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:42:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-23 12:42:47,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2018-11-23 12:42:47,843 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2018-11-23 12:42:47,843 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2018-11-23 12:42:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,847 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2018-11-23 12:42:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2018-11-23 12:42:47,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,849 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2018-11-23 12:42:47,849 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2018-11-23 12:42:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,853 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2018-11-23 12:42:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2018-11-23 12:42:47,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:42:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-11-23 12:42:47,859 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-11-23 12:42:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,859 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-11-23 12:42:47,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-11-23 12:42:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:47,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:47,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-11-23 12:42:47,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2018-11-23 12:42:47,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-23 12:42:47,953 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} #129#return; {1523#true} is VALID [2018-11-23 12:42:47,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {1523#true} call #t~ret7 := main(); {1523#true} is VALID [2018-11-23 12:42:47,954 INFO L273 TraceCheckUtils]: 4: Hoare triple {1523#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;havoc ~cond~0; {1523#true} is VALID [2018-11-23 12:42:47,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {1523#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1523#true} is VALID [2018-11-23 12:42:47,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1523#true} is VALID [2018-11-23 12:42:47,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#true} assume !(0 != ~p1~0); {1523#true} is VALID [2018-11-23 12:42:47,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#true} assume 0 != ~p2~0;~lk2~0 := 1; {1525#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:47,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {1525#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1525#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:47,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {1525#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1525#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:47,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {1525#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1525#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:47,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {1525#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1525#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:47,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {1525#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {1525#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:47,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {1525#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {1524#false} is VALID [2018-11-23 12:42:47,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {1524#false} assume 0 != ~p3~0; {1524#false} is VALID [2018-11-23 12:42:47,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#false} assume 1 != ~lk3~0; {1524#false} is VALID [2018-11-23 12:42:47,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2018-11-23 12:42:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:47,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:47,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:48,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:48,036 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-11-23 12:42:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,266 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-11-23 12:42:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 12:42:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 12:42:48,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2018-11-23 12:42:48,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,400 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:42:48,400 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:42:48,401 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,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:42:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 12:42:48,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:48,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 12:42:48,427 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 12:42:48,427 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 12:42:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,431 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2018-11-23 12:42:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-11-23 12:42:48,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,432 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 12:42:48,432 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 12:42:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,436 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2018-11-23 12:42:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-11-23 12:42:48,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:48,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:42:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-11-23 12:42:48,441 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-11-23 12:42:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:48,441 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-11-23 12:42:48,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-11-23 12:42:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:48,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:48,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:48,443 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:48,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-11-23 12:42:48,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:48,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {1949#true} call ULTIMATE.init(); {1949#true} is VALID [2018-11-23 12:42:48,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {1949#true} assume true; {1949#true} is VALID [2018-11-23 12:42:48,538 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1949#true} {1949#true} #129#return; {1949#true} is VALID [2018-11-23 12:42:48,538 INFO L256 TraceCheckUtils]: 3: Hoare triple {1949#true} call #t~ret7 := main(); {1949#true} is VALID [2018-11-23 12:42:48,539 INFO L273 TraceCheckUtils]: 4: Hoare triple {1949#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;havoc ~cond~0; {1949#true} is VALID [2018-11-23 12:42:48,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {1949#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1949#true} is VALID [2018-11-23 12:42:48,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {1949#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1949#true} is VALID [2018-11-23 12:42:48,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {1949#true} assume !(0 != ~p1~0); {1949#true} is VALID [2018-11-23 12:42:48,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {1949#true} assume !(0 != ~p2~0); {1949#true} is VALID [2018-11-23 12:42:48,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {1949#true} assume 0 != ~p3~0;~lk3~0 := 1; {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {1951#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {1951#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {1951#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {1951#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {1951#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {1951#(= main_~lk3~0 1)} assume 0 != ~p3~0; {1951#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:48,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {1951#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {1950#false} is VALID [2018-11-23 12:42:48,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {1950#false} assume !false; {1950#false} is VALID [2018-11-23 12:42:48,552 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,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:48,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:48,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:48,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:48,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:48,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:48,576 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-11-23 12:42:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,821 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-11-23 12:42:48,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:42:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:42:48,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 12:42:48,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,955 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:42:48,955 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 12:42:48,956 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,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 12:42:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-11-23 12:42:48,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:48,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 120 states. [2018-11-23 12:42:48,998 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 120 states. [2018-11-23 12:42:48,999 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 120 states. [2018-11-23 12:42:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,005 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2018-11-23 12:42:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2018-11-23 12:42:49,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,007 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 154 states. [2018-11-23 12:42:49,007 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 154 states. [2018-11-23 12:42:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,013 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2018-11-23 12:42:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2018-11-23 12:42:49,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:49,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:42:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-11-23 12:42:49,019 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-11-23 12:42:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:49,019 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-11-23 12:42:49,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-11-23 12:42:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:49,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:49,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:49,021 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:49,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-11-23 12:42:49,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:49,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:49,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:49,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {2564#true} call ULTIMATE.init(); {2564#true} is VALID [2018-11-23 12:42:49,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {2564#true} assume true; {2564#true} is VALID [2018-11-23 12:42:49,085 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2564#true} {2564#true} #129#return; {2564#true} is VALID [2018-11-23 12:42:49,086 INFO L256 TraceCheckUtils]: 3: Hoare triple {2564#true} call #t~ret7 := main(); {2564#true} is VALID [2018-11-23 12:42:49,086 INFO L273 TraceCheckUtils]: 4: Hoare triple {2564#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;havoc ~cond~0; {2564#true} is VALID [2018-11-23 12:42:49,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {2564#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {2564#true} is VALID [2018-11-23 12:42:49,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {2564#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2564#true} is VALID [2018-11-23 12:42:49,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {2564#true} assume !(0 != ~p1~0); {2564#true} is VALID [2018-11-23 12:42:49,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {2564#true} assume !(0 != ~p2~0); {2564#true} is VALID [2018-11-23 12:42:49,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {2564#true} assume !(0 != ~p3~0); {2566#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {2566#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2566#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {2566#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2566#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {2566#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2566#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {2566#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2566#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {2566#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2566#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {2566#(= main_~p3~0 0)} assume 0 != ~p3~0; {2565#false} is VALID [2018-11-23 12:42:49,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {2565#false} assume 1 != ~lk3~0; {2565#false} is VALID [2018-11-23 12:42:49,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {2565#false} assume !false; {2565#false} is VALID [2018-11-23 12:42:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:49,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:49,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:49,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:49,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:49,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:49,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:49,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:49,165 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-11-23 12:42:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,325 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-11-23 12:42:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:49,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 12:42:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 12:42:49,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-23 12:42:49,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:49,820 INFO L225 Difference]: With dead ends: 272 [2018-11-23 12:42:49,820 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 12:42:49,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 12:42:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 12:42:49,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:49,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2018-11-23 12:42:49,894 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2018-11-23 12:42:49,894 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2018-11-23 12:42:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,901 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2018-11-23 12:42:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2018-11-23 12:42:49,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,902 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2018-11-23 12:42:49,902 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2018-11-23 12:42:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,909 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2018-11-23 12:42:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2018-11-23 12:42:49,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:49,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:42:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-11-23 12:42:49,916 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-11-23 12:42:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:49,917 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-11-23 12:42:49,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-11-23 12:42:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:49,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:49,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:49,918 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:49,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-11-23 12:42:49,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:49,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:50,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {3359#true} call ULTIMATE.init(); {3359#true} is VALID [2018-11-23 12:42:50,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {3359#true} assume true; {3359#true} is VALID [2018-11-23 12:42:50,154 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3359#true} {3359#true} #129#return; {3359#true} is VALID [2018-11-23 12:42:50,155 INFO L256 TraceCheckUtils]: 3: Hoare triple {3359#true} call #t~ret7 := main(); {3359#true} is VALID [2018-11-23 12:42:50,155 INFO L273 TraceCheckUtils]: 4: Hoare triple {3359#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;havoc ~cond~0; {3359#true} is VALID [2018-11-23 12:42:50,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {3359#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {3359#true} is VALID [2018-11-23 12:42:50,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {3359#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3359#true} is VALID [2018-11-23 12:42:50,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {3359#true} assume !(0 != ~p1~0); {3359#true} is VALID [2018-11-23 12:42:50,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {3359#true} assume !(0 != ~p2~0); {3359#true} is VALID [2018-11-23 12:42:50,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {3359#true} assume 0 != ~p3~0;~lk3~0 := 1; {3361#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {3361#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3361#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {3361#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3361#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {3361#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {3361#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {3361#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3361#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {3361#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3361#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {3361#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3360#false} is VALID [2018-11-23 12:42:50,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {3360#false} assume 0 != ~p4~0; {3360#false} is VALID [2018-11-23 12:42:50,228 INFO L273 TraceCheckUtils]: 17: Hoare triple {3360#false} assume 1 != ~lk4~0; {3360#false} is VALID [2018-11-23 12:42:50,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {3360#false} assume !false; {3360#false} is VALID [2018-11-23 12:42:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:50,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:50,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:50,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:50,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:50,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:50,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:50,308 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-11-23 12:42:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,478 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-11-23 12:42:50,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:50,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-23 12:42:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-23 12:42:50,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2018-11-23 12:42:50,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,689 INFO L225 Difference]: With dead ends: 240 [2018-11-23 12:42:50,689 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 12:42:50,690 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:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 12:42:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-23 12:42:50,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:50,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2018-11-23 12:42:50,743 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2018-11-23 12:42:50,743 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2018-11-23 12:42:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,749 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2018-11-23 12:42:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2018-11-23 12:42:50,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,750 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2018-11-23 12:42:50,750 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2018-11-23 12:42:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,756 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2018-11-23 12:42:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2018-11-23 12:42:50,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:50,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 12:42:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-11-23 12:42:50,762 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-11-23 12:42:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:50,763 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-11-23 12:42:50,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-11-23 12:42:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:50,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:50,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:50,764 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:50,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-11-23 12:42:50,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:50,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:50,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {4134#true} call ULTIMATE.init(); {4134#true} is VALID [2018-11-23 12:42:50,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {4134#true} assume true; {4134#true} is VALID [2018-11-23 12:42:50,876 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4134#true} {4134#true} #129#return; {4134#true} is VALID [2018-11-23 12:42:50,876 INFO L256 TraceCheckUtils]: 3: Hoare triple {4134#true} call #t~ret7 := main(); {4134#true} is VALID [2018-11-23 12:42:50,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {4134#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;havoc ~cond~0; {4134#true} is VALID [2018-11-23 12:42:50,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {4134#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {4134#true} is VALID [2018-11-23 12:42:50,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {4134#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4134#true} is VALID [2018-11-23 12:42:50,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {4134#true} assume !(0 != ~p1~0); {4134#true} is VALID [2018-11-23 12:42:50,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {4134#true} assume !(0 != ~p2~0); {4134#true} is VALID [2018-11-23 12:42:50,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {4134#true} assume !(0 != ~p3~0); {4134#true} is VALID [2018-11-23 12:42:50,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {4134#true} assume 0 != ~p4~0;~lk4~0 := 1; {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {4136#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {4136#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {4136#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {4136#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {4136#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {4136#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4136#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:50,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {4136#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4135#false} is VALID [2018-11-23 12:42:50,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {4135#false} assume !false; {4135#false} is VALID [2018-11-23 12:42:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:50,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:50,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:50,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:50,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:50,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:50,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:50,902 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-11-23 12:42:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,221 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-11-23 12:42:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:51,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 12:42:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 12:42:51,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-23 12:42:51,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:51,470 INFO L225 Difference]: With dead ends: 284 [2018-11-23 12:42:51,470 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 12:42:51,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 12:42:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-11-23 12:42:51,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:51,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 232 states. [2018-11-23 12:42:51,530 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 232 states. [2018-11-23 12:42:51,530 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 232 states. [2018-11-23 12:42:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,540 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2018-11-23 12:42:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2018-11-23 12:42:51,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,542 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 282 states. [2018-11-23 12:42:51,542 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 282 states. [2018-11-23 12:42:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,551 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2018-11-23 12:42:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2018-11-23 12:42:51,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:51,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 12:42:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-11-23 12:42:51,559 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-11-23 12:42:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:51,560 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-11-23 12:42:51,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-11-23 12:42:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:51,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:51,561 INFO L402 BasicCegarLoop]: trace histogram [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,562 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:51,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-11-23 12:42:51,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:51,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:51,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:51,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {5257#true} call ULTIMATE.init(); {5257#true} is VALID [2018-11-23 12:42:51,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {5257#true} assume true; {5257#true} is VALID [2018-11-23 12:42:51,798 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5257#true} {5257#true} #129#return; {5257#true} is VALID [2018-11-23 12:42:51,798 INFO L256 TraceCheckUtils]: 3: Hoare triple {5257#true} call #t~ret7 := main(); {5257#true} is VALID [2018-11-23 12:42:51,798 INFO L273 TraceCheckUtils]: 4: Hoare triple {5257#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;havoc ~cond~0; {5257#true} is VALID [2018-11-23 12:42:51,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {5257#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {5257#true} is VALID [2018-11-23 12:42:51,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5257#true} is VALID [2018-11-23 12:42:51,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {5257#true} assume !(0 != ~p1~0); {5257#true} is VALID [2018-11-23 12:42:51,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {5257#true} assume !(0 != ~p2~0); {5257#true} is VALID [2018-11-23 12:42:51,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {5257#true} assume !(0 != ~p3~0); {5257#true} is VALID [2018-11-23 12:42:51,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {5257#true} assume !(0 != ~p4~0); {5259#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:51,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {5259#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5259#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:51,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {5259#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5259#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:51,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {5259#(= main_~p4~0 0)} assume !(0 != ~p1~0); {5259#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:51,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {5259#(= main_~p4~0 0)} assume !(0 != ~p2~0); {5259#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:51,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {5259#(= main_~p4~0 0)} assume !(0 != ~p3~0); {5259#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:51,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {5259#(= main_~p4~0 0)} assume 0 != ~p4~0; {5258#false} is VALID [2018-11-23 12:42:51,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {5258#false} assume 1 != ~lk4~0; {5258#false} is VALID [2018-11-23 12:42:51,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {5258#false} assume !false; {5258#false} is VALID [2018-11-23 12:42:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:51,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:51,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:51,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:51,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:51,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:51,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:51,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:51,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:51,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:51,966 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-11-23 12:42:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,243 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-11-23 12:42:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:52,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:42:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:42:52,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 12:42:52,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,891 INFO L225 Difference]: With dead ends: 524 [2018-11-23 12:42:52,891 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 12:42:52,893 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,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 12:42:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 12:42:53,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:53,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 304 states. [2018-11-23 12:42:53,066 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 304 states. [2018-11-23 12:42:53,066 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 304 states. [2018-11-23 12:42:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,074 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2018-11-23 12:42:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2018-11-23 12:42:53,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,076 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 306 states. [2018-11-23 12:42:53,076 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 306 states. [2018-11-23 12:42:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,084 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2018-11-23 12:42:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2018-11-23 12:42:53,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:53,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:53,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:53,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 12:42:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-11-23 12:42:53,095 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-11-23 12:42:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:53,096 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-11-23 12:42:53,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-11-23 12:42:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:42:53,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:53,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] [2018-11-23 12:42:53,098 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:53,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-11-23 12:42:53,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:53,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:53,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:53,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {6756#true} call ULTIMATE.init(); {6756#true} is VALID [2018-11-23 12:42:53,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {6756#true} assume true; {6756#true} is VALID [2018-11-23 12:42:53,324 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6756#true} {6756#true} #129#return; {6756#true} is VALID [2018-11-23 12:42:53,325 INFO L256 TraceCheckUtils]: 3: Hoare triple {6756#true} call #t~ret7 := main(); {6756#true} is VALID [2018-11-23 12:42:53,325 INFO L273 TraceCheckUtils]: 4: Hoare triple {6756#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;havoc ~cond~0; {6756#true} is VALID [2018-11-23 12:42:53,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {6756#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {6756#true} is VALID [2018-11-23 12:42:53,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {6756#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {6756#true} is VALID [2018-11-23 12:42:53,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {6756#true} assume !(0 != ~p1~0); {6756#true} is VALID [2018-11-23 12:42:53,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {6756#true} assume !(0 != ~p2~0); {6756#true} is VALID [2018-11-23 12:42:53,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {6756#true} assume !(0 != ~p3~0); {6756#true} is VALID [2018-11-23 12:42:53,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {6756#true} assume 0 != ~p4~0;~lk4~0 := 1; {6758#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:53,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {6758#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6758#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:53,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {6758#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6758#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:53,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {6758#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {6758#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:53,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {6758#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {6758#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:53,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {6758#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {6758#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:53,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {6758#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {6757#false} is VALID [2018-11-23 12:42:53,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {6757#false} assume 0 != ~p5~0; {6757#false} is VALID [2018-11-23 12:42:53,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {6757#false} assume 1 != ~lk5~0; {6757#false} is VALID [2018-11-23 12:42:53,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {6757#false} assume !false; {6757#false} is VALID [2018-11-23 12:42:53,420 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,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:53,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:53,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:53,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:53,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:53,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:53,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:53,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:53,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:53,639 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-11-23 12:42:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,011 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-11-23 12:42:54,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:54,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2018-11-23 12:42:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2018-11-23 12:42:54,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2018-11-23 12:42:54,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:54,573 INFO L225 Difference]: With dead ends: 456 [2018-11-23 12:42:54,574 INFO L226 Difference]: Without dead ends: 314 [2018-11-23 12:42:54,574 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,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-23 12:42:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-11-23 12:42:54,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:54,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand 312 states. [2018-11-23 12:42:54,943 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 312 states. [2018-11-23 12:42:54,944 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 312 states. [2018-11-23 12:42:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,953 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2018-11-23 12:42:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2018-11-23 12:42:54,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:54,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:54,954 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 314 states. [2018-11-23 12:42:54,954 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 314 states. [2018-11-23 12:42:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,963 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2018-11-23 12:42:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2018-11-23 12:42:54,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:54,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:54,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:54,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 12:42:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-11-23 12:42:54,972 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-11-23 12:42:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:54,973 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-11-23 12:42:54,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-11-23 12:42:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:42:54,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:54,974 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] [2018-11-23 12:42:54,974 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:54,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-11-23 12:42:54,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:54,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:54,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:54,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:55,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {8211#true} call ULTIMATE.init(); {8211#true} is VALID [2018-11-23 12:42:55,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {8211#true} assume true; {8211#true} is VALID [2018-11-23 12:42:55,194 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8211#true} {8211#true} #129#return; {8211#true} is VALID [2018-11-23 12:42:55,195 INFO L256 TraceCheckUtils]: 3: Hoare triple {8211#true} call #t~ret7 := main(); {8211#true} is VALID [2018-11-23 12:42:55,195 INFO L273 TraceCheckUtils]: 4: Hoare triple {8211#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;havoc ~cond~0; {8211#true} is VALID [2018-11-23 12:42:55,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {8211#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {8211#true} is VALID [2018-11-23 12:42:55,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {8211#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {8211#true} is VALID [2018-11-23 12:42:55,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {8211#true} assume !(0 != ~p1~0); {8211#true} is VALID [2018-11-23 12:42:55,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {8211#true} assume !(0 != ~p2~0); {8211#true} is VALID [2018-11-23 12:42:55,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {8211#true} assume !(0 != ~p3~0); {8211#true} is VALID [2018-11-23 12:42:55,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {8211#true} assume !(0 != ~p4~0); {8211#true} is VALID [2018-11-23 12:42:55,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {8211#true} assume 0 != ~p5~0;~lk5~0 := 1; {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {8213#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {8213#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {8213#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {8213#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {8213#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {8213#(= main_~lk5~0 1)} assume 0 != ~p5~0; {8213#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:55,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {8213#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {8212#false} is VALID [2018-11-23 12:42:55,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {8212#false} assume !false; {8212#false} is VALID [2018-11-23 12:42:55,302 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,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:55,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:55,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:55,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:55,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:55,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:55,410 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-11-23 12:42:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:55,706 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-11-23 12:42:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:55,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:42:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:42:55,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 12:42:56,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:56,210 INFO L225 Difference]: With dead ends: 524 [2018-11-23 12:42:56,210 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 12:42:56,210 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:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 12:42:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-11-23 12:42:56,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:56,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 456 states. [2018-11-23 12:42:56,559 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 456 states. [2018-11-23 12:42:56,559 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 456 states. [2018-11-23 12:42:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:56,579 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2018-11-23 12:42:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2018-11-23 12:42:56,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:56,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:56,581 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 522 states. [2018-11-23 12:42:56,581 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 522 states. [2018-11-23 12:42:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:56,602 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2018-11-23 12:42:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2018-11-23 12:42:56,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:56,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:56,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:56,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 12:42:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-11-23 12:42:56,618 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-11-23 12:42:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:56,618 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-11-23 12:42:56,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-11-23 12:42:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:42:56,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:56,620 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] [2018-11-23 12:42:56,620 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:56,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-11-23 12:42:56,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:56,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:56,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {10302#true} call ULTIMATE.init(); {10302#true} is VALID [2018-11-23 12:42:56,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {10302#true} assume true; {10302#true} is VALID [2018-11-23 12:42:56,840 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10302#true} {10302#true} #129#return; {10302#true} is VALID [2018-11-23 12:42:56,840 INFO L256 TraceCheckUtils]: 3: Hoare triple {10302#true} call #t~ret7 := main(); {10302#true} is VALID [2018-11-23 12:42:56,840 INFO L273 TraceCheckUtils]: 4: Hoare triple {10302#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;havoc ~cond~0; {10302#true} is VALID [2018-11-23 12:42:56,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {10302#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {10302#true} is VALID [2018-11-23 12:42:56,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {10302#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {10302#true} is VALID [2018-11-23 12:42:56,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {10302#true} assume !(0 != ~p1~0); {10302#true} is VALID [2018-11-23 12:42:56,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {10302#true} assume !(0 != ~p2~0); {10302#true} is VALID [2018-11-23 12:42:56,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {10302#true} assume !(0 != ~p3~0); {10302#true} is VALID [2018-11-23 12:42:56,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {10302#true} assume !(0 != ~p4~0); {10302#true} is VALID [2018-11-23 12:42:56,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {10302#true} assume !(0 != ~p5~0); {10304#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:56,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {10304#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10304#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:56,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {10304#(= main_~p5~0 0)} assume !(0 != ~p1~0); {10304#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:56,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {10304#(= main_~p5~0 0)} assume !(0 != ~p2~0); {10304#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:56,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {10304#(= main_~p5~0 0)} assume !(0 != ~p3~0); {10304#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:56,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {10304#(= main_~p5~0 0)} assume !(0 != ~p4~0); {10304#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:56,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {10304#(= main_~p5~0 0)} assume 0 != ~p5~0; {10303#false} is VALID [2018-11-23 12:42:56,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {10303#false} assume 1 != ~lk5~0; {10303#false} is VALID [2018-11-23 12:42:56,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {10303#false} assume !false; {10303#false} is VALID [2018-11-23 12:42:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:56,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:56,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:56,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:56,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:56,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:57,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:57,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:57,003 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-11-23 12:42:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,410 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-11-23 12:42:57,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:57,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2018-11-23 12:42:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2018-11-23 12:42:57,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2018-11-23 12:42:57,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:57,895 INFO L225 Difference]: With dead ends: 1020 [2018-11-23 12:42:57,895 INFO L226 Difference]: Without dead ends: 586 [2018-11-23 12:42:57,896 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:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-23 12:42:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-11-23 12:42:58,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:58,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 584 states. [2018-11-23 12:42:58,166 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 584 states. [2018-11-23 12:42:58,166 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 584 states. [2018-11-23 12:42:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:58,188 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2018-11-23 12:42:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2018-11-23 12:42:58,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:58,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:58,190 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 586 states. [2018-11-23 12:42:58,190 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 586 states. [2018-11-23 12:42:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:58,213 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2018-11-23 12:42:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2018-11-23 12:42:58,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:58,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:58,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:58,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 12:42:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-11-23 12:42:58,241 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-11-23 12:42:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:58,241 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-11-23 12:42:58,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-11-23 12:42:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:42:58,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:58,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:58,243 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:58,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-11-23 12:42:58,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:58,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:58,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {13177#true} call ULTIMATE.init(); {13177#true} is VALID [2018-11-23 12:42:58,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {13177#true} assume true; {13177#true} is VALID [2018-11-23 12:42:58,463 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13177#true} {13177#true} #129#return; {13177#true} is VALID [2018-11-23 12:42:58,463 INFO L256 TraceCheckUtils]: 3: Hoare triple {13177#true} call #t~ret7 := main(); {13177#true} is VALID [2018-11-23 12:42:58,463 INFO L273 TraceCheckUtils]: 4: Hoare triple {13177#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;havoc ~cond~0; {13177#true} is VALID [2018-11-23 12:42:58,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {13177#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {13177#true} is VALID [2018-11-23 12:42:58,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {13177#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {13177#true} is VALID [2018-11-23 12:42:58,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {13177#true} assume !(0 != ~p1~0); {13177#true} is VALID [2018-11-23 12:42:58,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {13177#true} assume !(0 != ~p2~0); {13177#true} is VALID [2018-11-23 12:42:58,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {13177#true} assume !(0 != ~p3~0); {13177#true} is VALID [2018-11-23 12:42:58,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {13177#true} assume !(0 != ~p4~0); {13177#true} is VALID [2018-11-23 12:42:58,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {13177#true} assume 0 != ~p5~0;~lk5~0 := 1; {13179#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:58,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {13179#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {13179#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:58,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {13179#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {13179#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:58,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {13179#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {13179#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:58,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {13179#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {13179#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:58,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {13179#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {13179#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:58,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {13179#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {13178#false} is VALID [2018-11-23 12:42:58,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {13178#false} assume 0 != ~p6~0; {13178#false} is VALID [2018-11-23 12:42:58,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {13178#false} assume 1 != ~lk6~0; {13178#false} is VALID [2018-11-23 12:42:58,557 INFO L273 TraceCheckUtils]: 20: Hoare triple {13178#false} assume !false; {13178#false} is VALID [2018-11-23 12:42:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:58,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:58,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:58,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:58,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:58,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:58,650 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-11-23 12:42:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:59,043 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-11-23 12:42:59,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:59,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:42:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:42:59,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 12:42:59,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:59,534 INFO L225 Difference]: With dead ends: 876 [2018-11-23 12:42:59,535 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 12:42:59,536 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:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 12:43:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 12:43:00,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:00,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand 600 states. [2018-11-23 12:43:00,428 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand 600 states. [2018-11-23 12:43:00,428 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 600 states. [2018-11-23 12:43:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,446 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2018-11-23 12:43:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2018-11-23 12:43:00,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:00,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:00,448 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand 602 states. [2018-11-23 12:43:00,448 INFO L87 Difference]: Start difference. First operand 600 states. Second operand 602 states. [2018-11-23 12:43:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,468 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2018-11-23 12:43:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2018-11-23 12:43:00,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:00,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:00,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:00,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 12:43:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-11-23 12:43:00,491 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-11-23 12:43:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:00,491 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-11-23 12:43:00,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-11-23 12:43:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:00,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:00,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:00,493 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:00,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-11-23 12:43:00,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:00,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:00,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {15956#true} call ULTIMATE.init(); {15956#true} is VALID [2018-11-23 12:43:00,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {15956#true} assume true; {15956#true} is VALID [2018-11-23 12:43:00,691 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15956#true} {15956#true} #129#return; {15956#true} is VALID [2018-11-23 12:43:00,692 INFO L256 TraceCheckUtils]: 3: Hoare triple {15956#true} call #t~ret7 := main(); {15956#true} is VALID [2018-11-23 12:43:00,692 INFO L273 TraceCheckUtils]: 4: Hoare triple {15956#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;havoc ~cond~0; {15956#true} is VALID [2018-11-23 12:43:00,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {15956#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {15956#true} is VALID [2018-11-23 12:43:00,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {15956#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {15956#true} is VALID [2018-11-23 12:43:00,692 INFO L273 TraceCheckUtils]: 7: Hoare triple {15956#true} assume !(0 != ~p1~0); {15956#true} is VALID [2018-11-23 12:43:00,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {15956#true} assume !(0 != ~p2~0); {15956#true} is VALID [2018-11-23 12:43:00,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {15956#true} assume !(0 != ~p3~0); {15956#true} is VALID [2018-11-23 12:43:00,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {15956#true} assume !(0 != ~p4~0); {15956#true} is VALID [2018-11-23 12:43:00,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {15956#true} assume !(0 != ~p5~0); {15956#true} is VALID [2018-11-23 12:43:00,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {15956#true} assume 0 != ~p6~0;~lk6~0 := 1; {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {15958#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {15958#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {15958#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {15958#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {15958#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {15958#(= main_~lk6~0 1)} assume 0 != ~p6~0; {15958#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {15958#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {15957#false} is VALID [2018-11-23 12:43:00,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {15957#false} assume !false; {15957#false} is VALID [2018-11-23 12:43:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:00,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:00,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:00,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:00,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:00,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:00,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:00,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:00,751 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-11-23 12:43:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,619 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-11-23 12:43:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:01,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:43:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:43:01,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 12:43:01,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:01,785 INFO L225 Difference]: With dead ends: 970 [2018-11-23 12:43:01,785 INFO L226 Difference]: Without dead ends: 968 [2018-11-23 12:43:01,786 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,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-23 12:43:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-11-23 12:43:02,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:02,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 968 states. Second operand 904 states. [2018-11-23 12:43:02,441 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 904 states. [2018-11-23 12:43:02,441 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 904 states. [2018-11-23 12:43:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,475 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2018-11-23 12:43:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2018-11-23 12:43:02,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,476 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand 968 states. [2018-11-23 12:43:02,477 INFO L87 Difference]: Start difference. First operand 904 states. Second operand 968 states. [2018-11-23 12:43:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,516 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2018-11-23 12:43:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2018-11-23 12:43:02,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:02,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 12:43:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-11-23 12:43:02,558 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-11-23 12:43:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:02,558 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-11-23 12:43:02,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-11-23 12:43:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:02,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:02,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:02,560 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:02,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-11-23 12:43:02,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:02,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:02,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {19880#true} call ULTIMATE.init(); {19880#true} is VALID [2018-11-23 12:43:02,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {19880#true} assume true; {19880#true} is VALID [2018-11-23 12:43:02,679 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19880#true} {19880#true} #129#return; {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L256 TraceCheckUtils]: 3: Hoare triple {19880#true} call #t~ret7 := main(); {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L273 TraceCheckUtils]: 4: Hoare triple {19880#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;havoc ~cond~0; {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {19880#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {19880#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {19880#true} assume !(0 != ~p1~0); {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {19880#true} assume !(0 != ~p2~0); {19880#true} is VALID [2018-11-23 12:43:02,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {19880#true} assume !(0 != ~p3~0); {19880#true} is VALID [2018-11-23 12:43:02,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {19880#true} assume !(0 != ~p4~0); {19880#true} is VALID [2018-11-23 12:43:02,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {19880#true} assume !(0 != ~p5~0); {19880#true} is VALID [2018-11-23 12:43:02,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {19880#true} assume !(0 != ~p6~0); {19882#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {19882#(= main_~p6~0 0)} assume !(0 != ~p1~0); {19882#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {19882#(= main_~p6~0 0)} assume !(0 != ~p2~0); {19882#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {19882#(= main_~p6~0 0)} assume !(0 != ~p3~0); {19882#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {19882#(= main_~p6~0 0)} assume !(0 != ~p4~0); {19882#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {19882#(= main_~p6~0 0)} assume !(0 != ~p5~0); {19882#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {19882#(= main_~p6~0 0)} assume 0 != ~p6~0; {19881#false} is VALID [2018-11-23 12:43:02,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {19881#false} assume 1 != ~lk6~0; {19881#false} is VALID [2018-11-23 12:43:02,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {19881#false} assume !false; {19881#false} is VALID [2018-11-23 12:43:02,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:43:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:02,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:02,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:02,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:02,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:02,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:02,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:02,708 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-11-23 12:43:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,749 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-11-23 12:43:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:03,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:43:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:43:03,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 12:43:03,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:03,907 INFO L225 Difference]: With dead ends: 1992 [2018-11-23 12:43:03,907 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:43:03,911 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:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:43:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:43:03,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:03,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:03,911 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:03,912 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,912 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:43:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:03,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:03,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:03,912 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:03,913 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,913 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:43:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:03,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:03,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:03,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:43:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:43:03,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 12:43:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:03,915 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:03,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:03,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:03,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:43:03,957 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:43:03,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:03,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:03,958 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:43:03,958 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:43:03,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:43:03,958 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-23 12:43:03,958 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-23 12:43:03,958 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,958 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-23 12:43:03,959 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-23 12:43:03,959 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-23 12:43:03,959 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-23 12:43:03,959 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,959 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,959 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,959 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-23 12:43:03,960 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-23 12:43:03,960 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,960 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-23 12:43:03,960 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-23 12:43:03,960 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,960 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-23 12:43:03,960 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-23 12:43:03,960 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-23 12:43:03,961 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-23 12:43:03,961 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,961 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,961 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,961 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-23 12:43:03,961 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,961 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 12:43:03,963 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:43:03,963 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 12:43:03,964 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2018-11-23 12:43:03,965 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 12:43:03,966 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2018-11-23 12:43:03,967 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2018-11-23 12:43:03,968 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-23 12:43:03,968 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-23 12:43:03,968 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:43:03,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:43:03 BoogieIcfgContainer [2018-11-23 12:43:03,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:43:03,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:43:03,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:43:03,975 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:43:03,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:43" (3/4) ... [2018-11-23 12:43:03,979 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:43:03,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:43:03,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:43:03,992 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:43:03,992 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:43:03,992 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:43:04,057 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 12:43:04,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:43:04,059 INFO L168 Benchmark]: Toolchain (without parser) took 21732.02 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 849.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -104.4 MB). Peak memory consumption was 745.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:04,061 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:43:04,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:04,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:43:04,062 INFO L168 Benchmark]: Boogie Preprocessor took 31.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:43:04,062 INFO L168 Benchmark]: RCFGBuilder took 816.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -739.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:04,063 INFO L168 Benchmark]: TraceAbstraction took 20463.38 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 145.2 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 624.8 MB). Peak memory consumption was 770.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:04,064 INFO L168 Benchmark]: Witness Printer took 83.00 ms. Allocated memory is still 2.4 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:43:04,067 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 816.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -739.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20463.38 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 145.2 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 624.8 MB). Peak memory consumption was 770.0 MB. Max. memory is 7.1 GB. * Witness Printer took 83.00 ms. Allocated memory is still 2.4 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 20.3s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...