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_10_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:41:01,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:41:01,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:41:01,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:41:01,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:41:01,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:41:01,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:41:01,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:41:01,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:41:01,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:41:01,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:41:01,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:41:01,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:41:01,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:41:01,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:41:01,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:41:01,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:41:01,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:41:01,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:41:01,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:41:01,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:41:01,471 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:41:01,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:41:01,474 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:41:01,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:41:01,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:41:01,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:41:01,477 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:41:01,478 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:41:01,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:41:01,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:41:01,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:41:01,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:41:01,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:41:01,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:41:01,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:41:01,486 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:41:01,502 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:41:01,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:41:01,503 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:41:01,503 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:41:01,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:41:01,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:41:01,504 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:41:01,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:41:01,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:41:01,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:41:01,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:41:01,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:41:01,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:41:01,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:41:01,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:41:01,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:41:01,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:41:01,507 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:41:01,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:41:01,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:41:01,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:41:01,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:41:01,508 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:41:01,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:41:01,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:41:01,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:41:01,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:41:01,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:41:01,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:41:01,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:41:01,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:41:01,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:41:01,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:41:01,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:41:01,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:41:01,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:41:01,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:01,656 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5dd08e9d/e5f48a5d028342c591ef73c46ac3f3a9/FLAG658ed769f [2018-11-23 12:41:02,158 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:41:02,159 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:02,173 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5dd08e9d/e5f48a5d028342c591ef73c46ac3f3a9/FLAG658ed769f [2018-11-23 12:41:02,484 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5dd08e9d/e5f48a5d028342c591ef73c46ac3f3a9 [2018-11-23 12:41:02,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:41:02,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:41:02,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:02,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:41:02,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:41:02,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c04f9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02, skipping insertion in model container [2018-11-23 12:41:02,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:41:02,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:41:02,769 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:02,775 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:41:02,809 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:02,826 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:41:02,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02 WrapperNode [2018-11-23 12:41:02,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:02,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:02,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:41:02,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:41:02,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:02,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:41:02,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:41:02,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:41:02,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... [2018-11-23 12:41:02,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:41:02,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:41:02,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:41:02,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:41:02,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:41:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:41:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:41:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:41:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:41:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:41:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:41:04,119 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:41:04,120 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:41:04,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:04 BoogieIcfgContainer [2018-11-23 12:41:04,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:41:04,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:41:04,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:41:04,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:41:04,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:41:02" (1/3) ... [2018-11-23 12:41:04,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:04, skipping insertion in model container [2018-11-23 12:41:04,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:02" (2/3) ... [2018-11-23 12:41:04,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:04, skipping insertion in model container [2018-11-23 12:41:04,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:04" (3/3) ... [2018-11-23 12:41:04,129 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:04,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:41:04,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:41:04,166 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:41:04,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:41:04,199 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:41:04,199 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:41:04,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:41:04,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:41:04,201 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:41:04,201 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:41:04,201 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:41:04,202 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:41:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 12:41:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:41:04,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:04,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:04,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:04,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-11-23 12:41:04,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:04,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:04,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:04,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:04,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2018-11-23 12:41:04,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-23 12:41:04,468 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2018-11-23 12:41:04,469 INFO L256 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret11 := main(); {47#true} is VALID [2018-11-23 12:41:04,469 INFO L273 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {47#true} is VALID [2018-11-23 12:41:04,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {47#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {47#true} is VALID [2018-11-23 12:41:04,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {47#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {47#true} is VALID [2018-11-23 12:41:04,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#true} assume 0 != ~p1~0;~lk1~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#(= main_~lk1~0 1)} assume 0 != ~p1~0; {49#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:04,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {48#false} is VALID [2018-11-23 12:41:04,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {48#false} assume !false; {48#false} is VALID [2018-11-23 12:41:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:04,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:04,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:04,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:41:04,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:04,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:04,607 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:41:04,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:04,619 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-23 12:41:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:05,076 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-11-23 12:41:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:05,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:41:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:41:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:41:05,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 12:41:05,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:05,779 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:41:05,779 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:41:05,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:41:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-11-23 12:41:05,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:05,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 50 states. [2018-11-23 12:41:05,824 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 50 states. [2018-11-23 12:41:05,824 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 50 states. [2018-11-23 12:41:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:05,834 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2018-11-23 12:41:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2018-11-23 12:41:05,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:05,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:05,836 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 72 states. [2018-11-23 12:41:05,836 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 72 states. [2018-11-23 12:41:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:05,844 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2018-11-23 12:41:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2018-11-23 12:41:05,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:05,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:05,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:05,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:41:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-11-23 12:41:05,852 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-11-23 12:41:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:05,853 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-11-23 12:41:05,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-11-23 12:41:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:41:05,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:05,854 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:41:05,855 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:05,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-11-23 12:41:05,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:05,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:05,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 12:41:05,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 12:41:05,963 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #197#return; {351#true} is VALID [2018-11-23 12:41:05,963 INFO L256 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret11 := main(); {351#true} is VALID [2018-11-23 12:41:05,963 INFO L273 TraceCheckUtils]: 4: Hoare triple {351#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {351#true} is VALID [2018-11-23 12:41:05,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {351#true} is VALID [2018-11-23 12:41:05,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {351#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {351#true} is VALID [2018-11-23 12:41:05,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#true} assume !(0 != ~p1~0); {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {353#(= main_~p1~0 0)} assume !(0 != ~p8~0); {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {353#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:05,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {353#(= main_~p1~0 0)} assume 0 != ~p1~0; {352#false} is VALID [2018-11-23 12:41:05,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {352#false} assume 1 != ~lk1~0; {352#false} is VALID [2018-11-23 12:41:05,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 12:41:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:05,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:05,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:41:05,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:05,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:06,052 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:41:06,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:06,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:06,053 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-11-23 12:41:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:06,402 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-11-23 12:41:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:06,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:41:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 12:41:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-23 12:41:06,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-23 12:41:06,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:06,773 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:41:06,773 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:41:06,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:41:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-23 12:41:06,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:06,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2018-11-23 12:41:06,810 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2018-11-23 12:41:06,810 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2018-11-23 12:41:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:06,816 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2018-11-23 12:41:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2018-11-23 12:41:06,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:06,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:06,817 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2018-11-23 12:41:06,818 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2018-11-23 12:41:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:06,823 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2018-11-23 12:41:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2018-11-23 12:41:06,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:06,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:06,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:06,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:41:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-11-23 12:41:06,829 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-11-23 12:41:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:06,830 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-11-23 12:41:06,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-11-23 12:41:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:41:06,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:06,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:06,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:06,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-11-23 12:41:06,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:06,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:06,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {704#true} is VALID [2018-11-23 12:41:06,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2018-11-23 12:41:06,930 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #197#return; {704#true} is VALID [2018-11-23 12:41:06,930 INFO L256 TraceCheckUtils]: 3: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2018-11-23 12:41:06,930 INFO L273 TraceCheckUtils]: 4: Hoare triple {704#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {704#true} is VALID [2018-11-23 12:41:06,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {704#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {704#true} is VALID [2018-11-23 12:41:06,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {704#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {704#true} is VALID [2018-11-23 12:41:06,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {704#true} assume 0 != ~p1~0;~lk1~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {706#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {706#(not (= main_~p1~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {706#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:06,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {706#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {705#false} is VALID [2018-11-23 12:41:06,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#false} assume 0 != ~p2~0; {705#false} is VALID [2018-11-23 12:41:06,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#false} assume 1 != ~lk2~0; {705#false} is VALID [2018-11-23 12:41:06,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {705#false} assume !false; {705#false} is VALID [2018-11-23 12:41:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:06,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:06,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:06,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:06,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:06,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:06,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:06,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:06,984 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-11-23 12:41:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:07,314 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-11-23 12:41:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:07,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:41:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-23 12:41:07,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-23 12:41:07,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:07,591 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:41:07,591 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:41:07,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:41:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 12:41:07,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:07,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2018-11-23 12:41:07,638 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2018-11-23 12:41:07,638 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2018-11-23 12:41:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:07,641 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2018-11-23 12:41:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2018-11-23 12:41:07,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:07,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:07,643 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2018-11-23 12:41:07,643 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2018-11-23 12:41:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:07,648 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2018-11-23 12:41:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2018-11-23 12:41:07,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:07,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:07,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:07,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:41:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-11-23 12:41:07,654 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-11-23 12:41:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:07,654 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-11-23 12:41:07,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-11-23 12:41:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:41:07,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:07,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:07,656 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:07,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-11-23 12:41:07,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:07,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:07,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:07,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:07,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:07,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-23 12:41:07,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-23 12:41:07,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #197#return; {1059#true} is VALID [2018-11-23 12:41:07,735 INFO L256 TraceCheckUtils]: 3: Hoare triple {1059#true} call #t~ret11 := main(); {1059#true} is VALID [2018-11-23 12:41:07,735 INFO L273 TraceCheckUtils]: 4: Hoare triple {1059#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {1059#true} is VALID [2018-11-23 12:41:07,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1059#true} is VALID [2018-11-23 12:41:07,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {1059#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1059#true} is VALID [2018-11-23 12:41:07,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {1059#true} assume !(0 != ~p1~0); {1059#true} is VALID [2018-11-23 12:41:07,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {1059#true} assume 0 != ~p2~0;~lk2~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {1061#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {1061#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {1061#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1061#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:07,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {1061#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1060#false} is VALID [2018-11-23 12:41:07,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-23 12:41:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:07,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:07,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:07,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:07,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:07,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:07,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:07,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:07,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:07,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:07,784 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-11-23 12:41:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:07,958 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-11-23 12:41:07,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:07,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:41:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:41:07,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 12:41:08,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:08,144 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:41:08,144 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 12:41:08,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 12:41:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-23 12:41:08,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:08,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 96 states. [2018-11-23 12:41:08,184 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 96 states. [2018-11-23 12:41:08,184 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 96 states. [2018-11-23 12:41:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:08,190 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2018-11-23 12:41:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2018-11-23 12:41:08,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:08,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:08,192 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 134 states. [2018-11-23 12:41:08,192 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 134 states. [2018-11-23 12:41:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:08,199 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2018-11-23 12:41:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2018-11-23 12:41:08,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:08,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:08,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:08,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:41:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-11-23 12:41:08,205 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-11-23 12:41:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:08,206 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-11-23 12:41:08,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-11-23 12:41:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:41:08,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:08,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:08,207 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:08,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-11-23 12:41:08,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:08,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:08,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:08,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {1584#true} call ULTIMATE.init(); {1584#true} is VALID [2018-11-23 12:41:08,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {1584#true} assume true; {1584#true} is VALID [2018-11-23 12:41:08,287 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1584#true} {1584#true} #197#return; {1584#true} is VALID [2018-11-23 12:41:08,287 INFO L256 TraceCheckUtils]: 3: Hoare triple {1584#true} call #t~ret11 := main(); {1584#true} is VALID [2018-11-23 12:41:08,288 INFO L273 TraceCheckUtils]: 4: Hoare triple {1584#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {1584#true} is VALID [2018-11-23 12:41:08,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {1584#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1584#true} is VALID [2018-11-23 12:41:08,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {1584#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1584#true} is VALID [2018-11-23 12:41:08,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {1584#true} assume !(0 != ~p1~0); {1584#true} is VALID [2018-11-23 12:41:08,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {1584#true} assume !(0 != ~p2~0); {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {1586#(= main_~p2~0 0)} assume !(0 != ~p8~0); {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {1586#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1586#(= main_~p2~0 0)} is VALID [2018-11-23 12:41:08,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {1586#(= main_~p2~0 0)} assume 0 != ~p2~0; {1585#false} is VALID [2018-11-23 12:41:08,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {1585#false} assume 1 != ~lk2~0; {1585#false} is VALID [2018-11-23 12:41:08,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {1585#false} assume !false; {1585#false} is VALID [2018-11-23 12:41:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:08,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:08,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:08,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:08,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:08,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:08,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:08,339 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-11-23 12:41:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:08,547 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-23 12:41:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:08,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:41:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-23 12:41:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-23 12:41:08,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-23 12:41:08,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:08,956 INFO L225 Difference]: With dead ends: 224 [2018-11-23 12:41:08,956 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 12:41:08,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 12:41:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-23 12:41:09,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:09,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-23 12:41:09,015 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-23 12:41:09,015 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-23 12:41:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:09,021 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2018-11-23 12:41:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2018-11-23 12:41:09,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:09,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:09,022 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-23 12:41:09,023 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-23 12:41:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:09,029 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2018-11-23 12:41:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2018-11-23 12:41:09,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:09,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:09,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:09,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 12:41:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-11-23 12:41:09,035 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-11-23 12:41:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:09,036 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-11-23 12:41:09,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-11-23 12:41:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:09,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:09,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:09,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:09,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-11-23 12:41:09,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:09,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:09,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2243#true} is VALID [2018-11-23 12:41:09,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {2243#true} assume true; {2243#true} is VALID [2018-11-23 12:41:09,106 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2243#true} {2243#true} #197#return; {2243#true} is VALID [2018-11-23 12:41:09,106 INFO L256 TraceCheckUtils]: 3: Hoare triple {2243#true} call #t~ret11 := main(); {2243#true} is VALID [2018-11-23 12:41:09,106 INFO L273 TraceCheckUtils]: 4: Hoare triple {2243#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {2243#true} is VALID [2018-11-23 12:41:09,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {2243#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2243#true} is VALID [2018-11-23 12:41:09,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {2243#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2243#true} is VALID [2018-11-23 12:41:09,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {2243#true} assume !(0 != ~p1~0); {2243#true} is VALID [2018-11-23 12:41:09,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {2243#true} assume 0 != ~p2~0;~lk2~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {2245#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {2245#(not (= main_~p2~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {2245#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {2245#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:41:09,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {2245#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {2244#false} is VALID [2018-11-23 12:41:09,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {2244#false} assume 0 != ~p3~0; {2244#false} is VALID [2018-11-23 12:41:09,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {2244#false} assume 1 != ~lk3~0; {2244#false} is VALID [2018-11-23 12:41:09,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2018-11-23 12:41:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:09,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:09,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:09,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:09,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:09,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:09,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:09,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:09,249 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-11-23 12:41:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:09,464 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-11-23 12:41:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:09,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-23 12:41:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-23 12:41:09,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2018-11-23 12:41:09,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:09,693 INFO L225 Difference]: With dead ends: 201 [2018-11-23 12:41:09,693 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 12:41:09,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 12:41:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 12:41:09,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:09,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-23 12:41:09,803 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-23 12:41:09,803 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-23 12:41:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:09,809 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2018-11-23 12:41:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2018-11-23 12:41:09,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:09,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:09,810 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-23 12:41:09,810 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-23 12:41:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:09,816 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2018-11-23 12:41:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2018-11-23 12:41:09,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:09,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:09,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:09,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:41:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-11-23 12:41:09,823 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-11-23 12:41:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:09,823 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-11-23 12:41:09,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-11-23 12:41:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:09,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:09,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:09,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:09,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-11-23 12:41:09,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:09,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {2885#true} call ULTIMATE.init(); {2885#true} is VALID [2018-11-23 12:41:09,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {2885#true} assume true; {2885#true} is VALID [2018-11-23 12:41:09,976 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2885#true} {2885#true} #197#return; {2885#true} is VALID [2018-11-23 12:41:09,976 INFO L256 TraceCheckUtils]: 3: Hoare triple {2885#true} call #t~ret11 := main(); {2885#true} is VALID [2018-11-23 12:41:09,976 INFO L273 TraceCheckUtils]: 4: Hoare triple {2885#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {2885#true} is VALID [2018-11-23 12:41:09,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {2885#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2885#true} is VALID [2018-11-23 12:41:09,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {2885#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2885#true} is VALID [2018-11-23 12:41:09,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {2885#true} assume !(0 != ~p1~0); {2885#true} is VALID [2018-11-23 12:41:09,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {2885#true} assume !(0 != ~p2~0); {2885#true} is VALID [2018-11-23 12:41:09,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {2885#true} assume 0 != ~p3~0;~lk3~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,992 INFO L273 TraceCheckUtils]: 10: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {2887#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:09,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:10,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {2887#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:10,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {2887#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:10,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {2887#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2887#(= main_~lk3~0 1)} is VALID [2018-11-23 12:41:10,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {2887#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2886#false} is VALID [2018-11-23 12:41:10,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {2886#false} assume !false; {2886#false} is VALID [2018-11-23 12:41:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:10,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:10,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:10,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:10,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:10,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:10,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:10,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:10,072 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-11-23 12:41:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:10,290 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-11-23 12:41:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:10,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:41:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:41:10,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 12:41:10,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:10,949 INFO L225 Difference]: With dead ends: 252 [2018-11-23 12:41:10,949 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 12:41:10,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 12:41:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-23 12:41:10,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:10,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 184 states. [2018-11-23 12:41:10,983 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 184 states. [2018-11-23 12:41:10,984 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 184 states. [2018-11-23 12:41:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:10,996 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2018-11-23 12:41:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2018-11-23 12:41:10,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:10,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:10,997 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 250 states. [2018-11-23 12:41:10,997 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 250 states. [2018-11-23 12:41:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:11,008 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2018-11-23 12:41:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2018-11-23 12:41:11,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:11,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:11,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:11,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 12:41:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-11-23 12:41:11,016 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-11-23 12:41:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:11,017 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-11-23 12:41:11,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-11-23 12:41:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:11,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:11,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:11,018 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:11,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-11-23 12:41:11,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:11,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:11,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {3852#true} call ULTIMATE.init(); {3852#true} is VALID [2018-11-23 12:41:11,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {3852#true} assume true; {3852#true} is VALID [2018-11-23 12:41:11,083 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3852#true} {3852#true} #197#return; {3852#true} is VALID [2018-11-23 12:41:11,083 INFO L256 TraceCheckUtils]: 3: Hoare triple {3852#true} call #t~ret11 := main(); {3852#true} is VALID [2018-11-23 12:41:11,084 INFO L273 TraceCheckUtils]: 4: Hoare triple {3852#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {3852#true} is VALID [2018-11-23 12:41:11,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {3852#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3852#true} is VALID [2018-11-23 12:41:11,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {3852#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {3852#true} is VALID [2018-11-23 12:41:11,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {3852#true} assume !(0 != ~p1~0); {3852#true} is VALID [2018-11-23 12:41:11,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {3852#true} assume !(0 != ~p2~0); {3852#true} is VALID [2018-11-23 12:41:11,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {3852#true} assume !(0 != ~p3~0); {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {3854#(= main_~p3~0 0)} assume !(0 != ~p8~0); {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {3854#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {3854#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3854#(= main_~p3~0 0)} is VALID [2018-11-23 12:41:11,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {3854#(= main_~p3~0 0)} assume 0 != ~p3~0; {3853#false} is VALID [2018-11-23 12:41:11,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {3853#false} assume 1 != ~lk3~0; {3853#false} is VALID [2018-11-23 12:41:11,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {3853#false} assume !false; {3853#false} is VALID [2018-11-23 12:41:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:11,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:11,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:11,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:11,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:11,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:11,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:11,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:11,123 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-11-23 12:41:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:11,466 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-11-23 12:41:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:11,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-23 12:41:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-23 12:41:11,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2018-11-23 12:41:11,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:11,704 INFO L225 Difference]: With dead ends: 432 [2018-11-23 12:41:11,704 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 12:41:11,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 12:41:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 12:41:11,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:11,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2018-11-23 12:41:11,887 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2018-11-23 12:41:11,887 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2018-11-23 12:41:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:11,900 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2018-11-23 12:41:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2018-11-23 12:41:11,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:11,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:11,901 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2018-11-23 12:41:11,902 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2018-11-23 12:41:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:11,909 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2018-11-23 12:41:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2018-11-23 12:41:11,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:11,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:11,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:11,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 12:41:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-11-23 12:41:11,919 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-11-23 12:41:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:11,919 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-11-23 12:41:11,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-11-23 12:41:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:11,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:11,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:11,921 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:11,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-11-23 12:41:11,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:11,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:11,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:12,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {5095#true} call ULTIMATE.init(); {5095#true} is VALID [2018-11-23 12:41:12,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {5095#true} assume true; {5095#true} is VALID [2018-11-23 12:41:12,161 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5095#true} {5095#true} #197#return; {5095#true} is VALID [2018-11-23 12:41:12,162 INFO L256 TraceCheckUtils]: 3: Hoare triple {5095#true} call #t~ret11 := main(); {5095#true} is VALID [2018-11-23 12:41:12,162 INFO L273 TraceCheckUtils]: 4: Hoare triple {5095#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {5095#true} is VALID [2018-11-23 12:41:12,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {5095#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5095#true} is VALID [2018-11-23 12:41:12,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {5095#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {5095#true} is VALID [2018-11-23 12:41:12,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {5095#true} assume !(0 != ~p1~0); {5095#true} is VALID [2018-11-23 12:41:12,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {5095#true} assume !(0 != ~p2~0); {5095#true} is VALID [2018-11-23 12:41:12,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {5095#true} assume 0 != ~p3~0;~lk3~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {5097#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {5097#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {5097#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {5097#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {5097#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {5097#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {5097#(not (= main_~p3~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {5097#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {5097#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5097#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:41:12,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {5097#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5096#false} is VALID [2018-11-23 12:41:12,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {5096#false} assume 0 != ~p4~0; {5096#false} is VALID [2018-11-23 12:41:12,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {5096#false} assume 1 != ~lk4~0; {5096#false} is VALID [2018-11-23 12:41:12,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {5096#false} assume !false; {5096#false} is VALID [2018-11-23 12:41:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:12,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:12,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:12,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:12,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:12,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:12,351 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-11-23 12:41:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:12,604 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-11-23 12:41:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:12,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-23 12:41:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-23 12:41:12,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2018-11-23 12:41:13,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:13,438 INFO L225 Difference]: With dead ends: 384 [2018-11-23 12:41:13,438 INFO L226 Difference]: Without dead ends: 262 [2018-11-23 12:41:13,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-23 12:41:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-23 12:41:13,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:13,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 260 states. [2018-11-23 12:41:13,570 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 260 states. [2018-11-23 12:41:13,570 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 260 states. [2018-11-23 12:41:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:13,578 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2018-11-23 12:41:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2018-11-23 12:41:13,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:13,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:13,579 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 262 states. [2018-11-23 12:41:13,579 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 262 states. [2018-11-23 12:41:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:13,586 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2018-11-23 12:41:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2018-11-23 12:41:13,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:13,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:13,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:13,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 12:41:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-11-23 12:41:13,595 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-11-23 12:41:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:13,595 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-11-23 12:41:13,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-11-23 12:41:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:13,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:13,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:13,597 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:13,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:13,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-11-23 12:41:13,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:13,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:13,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:13,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:13,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:13,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 12:41:13,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 12:41:13,820 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6302#true} {6302#true} #197#return; {6302#true} is VALID [2018-11-23 12:41:13,820 INFO L256 TraceCheckUtils]: 3: Hoare triple {6302#true} call #t~ret11 := main(); {6302#true} is VALID [2018-11-23 12:41:13,820 INFO L273 TraceCheckUtils]: 4: Hoare triple {6302#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {6302#true} is VALID [2018-11-23 12:41:13,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {6302#true} is VALID [2018-11-23 12:41:13,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {6302#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {6302#true} is VALID [2018-11-23 12:41:13,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {6302#true} assume !(0 != ~p1~0); {6302#true} is VALID [2018-11-23 12:41:13,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {6302#true} assume !(0 != ~p2~0); {6302#true} is VALID [2018-11-23 12:41:13,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {6302#true} assume !(0 != ~p3~0); {6302#true} is VALID [2018-11-23 12:41:13,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {6302#true} assume 0 != ~p4~0;~lk4~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,914 INFO L273 TraceCheckUtils]: 16: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6304#(= main_~lk4~0 1)} is VALID [2018-11-23 12:41:13,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {6304#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6303#false} is VALID [2018-11-23 12:41:13,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 12:41:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:13,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:13,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:13,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:14,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:14,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:14,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:14,180 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-11-23 12:41:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:14,405 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-11-23 12:41:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:14,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 12:41:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2018-11-23 12:41:14,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2018-11-23 12:41:14,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:14,967 INFO L225 Difference]: With dead ends: 476 [2018-11-23 12:41:14,968 INFO L226 Difference]: Without dead ends: 474 [2018-11-23 12:41:14,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-23 12:41:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-11-23 12:41:15,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:15,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand 360 states. [2018-11-23 12:41:15,165 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand 360 states. [2018-11-23 12:41:15,165 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 360 states. [2018-11-23 12:41:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:15,183 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2018-11-23 12:41:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2018-11-23 12:41:15,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:15,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:15,185 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 474 states. [2018-11-23 12:41:15,185 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 474 states. [2018-11-23 12:41:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:15,201 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2018-11-23 12:41:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2018-11-23 12:41:15,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:15,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:15,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:15,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-23 12:41:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-11-23 12:41:15,214 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-11-23 12:41:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:15,214 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-11-23 12:41:15,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-11-23 12:41:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:15,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:15,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:15,216 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-11-23 12:41:15,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:15,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:15,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:15,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {8129#true} call ULTIMATE.init(); {8129#true} is VALID [2018-11-23 12:41:15,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {8129#true} assume true; {8129#true} is VALID [2018-11-23 12:41:15,448 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8129#true} {8129#true} #197#return; {8129#true} is VALID [2018-11-23 12:41:15,448 INFO L256 TraceCheckUtils]: 3: Hoare triple {8129#true} call #t~ret11 := main(); {8129#true} is VALID [2018-11-23 12:41:15,448 INFO L273 TraceCheckUtils]: 4: Hoare triple {8129#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {8129#true} is VALID [2018-11-23 12:41:15,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {8129#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {8129#true} is VALID [2018-11-23 12:41:15,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {8129#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {8129#true} is VALID [2018-11-23 12:41:15,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {8129#true} assume !(0 != ~p1~0); {8129#true} is VALID [2018-11-23 12:41:15,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {8129#true} assume !(0 != ~p2~0); {8129#true} is VALID [2018-11-23 12:41:15,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {8129#true} assume !(0 != ~p3~0); {8129#true} is VALID [2018-11-23 12:41:15,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {8129#true} assume !(0 != ~p4~0); {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {8131#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {8131#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {8131#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {8131#(= main_~p4~0 0)} assume !(0 != ~p8~0); {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {8131#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {8131#(= main_~p4~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {8131#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {8131#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {8131#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8131#(= main_~p4~0 0)} is VALID [2018-11-23 12:41:15,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {8131#(= main_~p4~0 0)} assume 0 != ~p4~0; {8130#false} is VALID [2018-11-23 12:41:15,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {8130#false} assume 1 != ~lk4~0; {8130#false} is VALID [2018-11-23 12:41:15,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {8130#false} assume !false; {8130#false} is VALID [2018-11-23 12:41:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:15,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:15,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:15,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:15,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:15,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:15,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:15,823 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-11-23 12:41:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:16,387 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-11-23 12:41:16,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:16,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2018-11-23 12:41:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2018-11-23 12:41:16,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2018-11-23 12:41:17,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:17,198 INFO L225 Difference]: With dead ends: 844 [2018-11-23 12:41:17,198 INFO L226 Difference]: Without dead ends: 498 [2018-11-23 12:41:17,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-23 12:41:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-11-23 12:41:17,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:17,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand 496 states. [2018-11-23 12:41:17,387 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand 496 states. [2018-11-23 12:41:17,387 INFO L87 Difference]: Start difference. First operand 498 states. Second operand 496 states. [2018-11-23 12:41:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:17,403 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2018-11-23 12:41:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2018-11-23 12:41:17,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:17,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:17,405 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand 498 states. [2018-11-23 12:41:17,405 INFO L87 Difference]: Start difference. First operand 496 states. Second operand 498 states. [2018-11-23 12:41:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:17,420 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2018-11-23 12:41:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2018-11-23 12:41:17,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:17,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:17,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:17,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-23 12:41:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-11-23 12:41:17,438 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-11-23 12:41:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:17,438 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-11-23 12:41:17,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-11-23 12:41:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:41:17,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:17,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:17,440 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:17,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-11-23 12:41:17,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:17,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:17,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {10524#true} call ULTIMATE.init(); {10524#true} is VALID [2018-11-23 12:41:17,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {10524#true} assume true; {10524#true} is VALID [2018-11-23 12:41:17,542 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10524#true} {10524#true} #197#return; {10524#true} is VALID [2018-11-23 12:41:17,542 INFO L256 TraceCheckUtils]: 3: Hoare triple {10524#true} call #t~ret11 := main(); {10524#true} is VALID [2018-11-23 12:41:17,542 INFO L273 TraceCheckUtils]: 4: Hoare triple {10524#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {10524#true} is VALID [2018-11-23 12:41:17,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {10524#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {10524#true} is VALID [2018-11-23 12:41:17,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {10524#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {10524#true} is VALID [2018-11-23 12:41:17,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {10524#true} assume !(0 != ~p1~0); {10524#true} is VALID [2018-11-23 12:41:17,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {10524#true} assume !(0 != ~p2~0); {10524#true} is VALID [2018-11-23 12:41:17,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {10524#true} assume !(0 != ~p3~0); {10524#true} is VALID [2018-11-23 12:41:17,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {10524#true} assume 0 != ~p4~0;~lk4~0 := 1; {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {10526#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {10526#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {10526#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {10526#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {10526#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {10526#(not (= main_~p4~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {10526#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {10526#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {10526#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {10526#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:41:17,557 INFO L273 TraceCheckUtils]: 20: Hoare triple {10526#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {10525#false} is VALID [2018-11-23 12:41:17,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {10525#false} assume 0 != ~p5~0; {10525#false} is VALID [2018-11-23 12:41:17,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {10525#false} assume 1 != ~lk5~0; {10525#false} is VALID [2018-11-23 12:41:17,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {10525#false} assume !false; {10525#false} is VALID [2018-11-23 12:41:17,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:41:17,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:17,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:17,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:17,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:17,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:17,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:17,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:17,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:17,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:17,590 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-11-23 12:41:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:17,806 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-11-23 12:41:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:17,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2018-11-23 12:41:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2018-11-23 12:41:17,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2018-11-23 12:41:17,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:17,968 INFO L225 Difference]: With dead ends: 744 [2018-11-23 12:41:17,968 INFO L226 Difference]: Without dead ends: 506 [2018-11-23 12:41:17,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-23 12:41:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-11-23 12:41:18,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:18,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand 504 states. [2018-11-23 12:41:18,072 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 504 states. [2018-11-23 12:41:18,072 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 504 states. [2018-11-23 12:41:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,083 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2018-11-23 12:41:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2018-11-23 12:41:18,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:18,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:18,085 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand 506 states. [2018-11-23 12:41:18,085 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 506 states. [2018-11-23 12:41:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,099 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2018-11-23 12:41:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2018-11-23 12:41:18,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:18,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:18,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:18,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-23 12:41:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-11-23 12:41:18,116 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-11-23 12:41:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:18,117 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-11-23 12:41:18,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-11-23 12:41:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:41:18,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:18,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:18,118 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:18,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-11-23 12:41:18,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:18,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:18,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:18,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {12843#true} call ULTIMATE.init(); {12843#true} is VALID [2018-11-23 12:41:18,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {12843#true} assume true; {12843#true} is VALID [2018-11-23 12:41:18,319 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12843#true} {12843#true} #197#return; {12843#true} is VALID [2018-11-23 12:41:18,319 INFO L256 TraceCheckUtils]: 3: Hoare triple {12843#true} call #t~ret11 := main(); {12843#true} is VALID [2018-11-23 12:41:18,319 INFO L273 TraceCheckUtils]: 4: Hoare triple {12843#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {12843#true} is VALID [2018-11-23 12:41:18,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {12843#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {12843#true} is VALID [2018-11-23 12:41:18,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {12843#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {12843#true} is VALID [2018-11-23 12:41:18,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {12843#true} assume !(0 != ~p1~0); {12843#true} is VALID [2018-11-23 12:41:18,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {12843#true} assume !(0 != ~p2~0); {12843#true} is VALID [2018-11-23 12:41:18,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {12843#true} assume !(0 != ~p3~0); {12843#true} is VALID [2018-11-23 12:41:18,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {12843#true} assume !(0 != ~p4~0); {12843#true} is VALID [2018-11-23 12:41:18,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {12843#true} assume 0 != ~p5~0;~lk5~0 := 1; {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {12845#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {12845#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {12845#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {12845#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {12845#(= main_~lk5~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {12845#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {12845#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {12845#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {12845#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {12845#(= main_~lk5~0 1)} assume 0 != ~p5~0; {12845#(= main_~lk5~0 1)} is VALID [2018-11-23 12:41:18,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {12845#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {12844#false} is VALID [2018-11-23 12:41:18,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {12844#false} assume !false; {12844#false} is VALID [2018-11-23 12:41:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:18,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:18,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:18,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:18,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:18,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:18,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:18,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:18,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:18,388 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-11-23 12:41:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:18,682 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-11-23 12:41:18,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:18,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:41:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:41:18,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 12:41:18,810 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:41:18,856 INFO L225 Difference]: With dead ends: 908 [2018-11-23 12:41:18,857 INFO L226 Difference]: Without dead ends: 906 [2018-11-23 12:41:18,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-23 12:41:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-11-23 12:41:19,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:19,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 906 states. Second operand 712 states. [2018-11-23 12:41:19,227 INFO L74 IsIncluded]: Start isIncluded. First operand 906 states. Second operand 712 states. [2018-11-23 12:41:19,227 INFO L87 Difference]: Start difference. First operand 906 states. Second operand 712 states. [2018-11-23 12:41:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:19,260 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2018-11-23 12:41:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2018-11-23 12:41:19,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:19,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:19,261 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand 906 states. [2018-11-23 12:41:19,262 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 906 states. [2018-11-23 12:41:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:19,300 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2018-11-23 12:41:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2018-11-23 12:41:19,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:19,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:19,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:19,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-23 12:41:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-11-23 12:41:19,329 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-11-23 12:41:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:19,330 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-11-23 12:41:19,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-11-23 12:41:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:41:19,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:19,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:19,331 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:19,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-11-23 12:41:19,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:19,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:19,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {16342#true} call ULTIMATE.init(); {16342#true} is VALID [2018-11-23 12:41:19,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {16342#true} assume true; {16342#true} is VALID [2018-11-23 12:41:19,448 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16342#true} {16342#true} #197#return; {16342#true} is VALID [2018-11-23 12:41:19,448 INFO L256 TraceCheckUtils]: 3: Hoare triple {16342#true} call #t~ret11 := main(); {16342#true} is VALID [2018-11-23 12:41:19,448 INFO L273 TraceCheckUtils]: 4: Hoare triple {16342#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {16342#true} is VALID [2018-11-23 12:41:19,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {16342#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {16342#true} is VALID [2018-11-23 12:41:19,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {16342#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {16342#true} is VALID [2018-11-23 12:41:19,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {16342#true} assume !(0 != ~p1~0); {16342#true} is VALID [2018-11-23 12:41:19,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {16342#true} assume !(0 != ~p2~0); {16342#true} is VALID [2018-11-23 12:41:19,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {16342#true} assume !(0 != ~p3~0); {16342#true} is VALID [2018-11-23 12:41:19,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {16342#true} assume !(0 != ~p4~0); {16342#true} is VALID [2018-11-23 12:41:19,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {16342#true} assume !(0 != ~p5~0); {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {16344#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {16344#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {16344#(= main_~p5~0 0)} assume !(0 != ~p8~0); {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {16344#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {16344#(= main_~p5~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {16344#(= main_~p5~0 0)} assume !(0 != ~p1~0); {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {16344#(= main_~p5~0 0)} assume !(0 != ~p2~0); {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {16344#(= main_~p5~0 0)} assume !(0 != ~p3~0); {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {16344#(= main_~p5~0 0)} assume !(0 != ~p4~0); {16344#(= main_~p5~0 0)} is VALID [2018-11-23 12:41:19,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {16344#(= main_~p5~0 0)} assume 0 != ~p5~0; {16343#false} is VALID [2018-11-23 12:41:19,468 INFO L273 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 1 != ~lk5~0; {16343#false} is VALID [2018-11-23 12:41:19,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2018-11-23 12:41:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:19,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:19,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:19,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:19,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:19,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:19,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:19,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:19,556 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-11-23 12:41:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:19,986 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-11-23 12:41:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:19,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:41:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-23 12:41:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-23 12:41:19,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2018-11-23 12:41:20,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:20,206 INFO L225 Difference]: With dead ends: 1660 [2018-11-23 12:41:20,206 INFO L226 Difference]: Without dead ends: 970 [2018-11-23 12:41:20,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-23 12:41:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-11-23 12:41:20,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:20,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 970 states. Second operand 968 states. [2018-11-23 12:41:20,847 INFO L74 IsIncluded]: Start isIncluded. First operand 970 states. Second operand 968 states. [2018-11-23 12:41:20,847 INFO L87 Difference]: Start difference. First operand 970 states. Second operand 968 states. [2018-11-23 12:41:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:20,882 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2018-11-23 12:41:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2018-11-23 12:41:20,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:20,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:20,884 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 970 states. [2018-11-23 12:41:20,884 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 970 states. [2018-11-23 12:41:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:20,929 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2018-11-23 12:41:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2018-11-23 12:41:20,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:20,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:20,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:20,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 12:41:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-11-23 12:41:20,961 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-11-23 12:41:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:20,961 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-11-23 12:41:20,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-11-23 12:41:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:41:20,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:20,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:20,962 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:20,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-11-23 12:41:20,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:20,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:21,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {21009#true} call ULTIMATE.init(); {21009#true} is VALID [2018-11-23 12:41:21,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {21009#true} assume true; {21009#true} is VALID [2018-11-23 12:41:21,110 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21009#true} {21009#true} #197#return; {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L256 TraceCheckUtils]: 3: Hoare triple {21009#true} call #t~ret11 := main(); {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L273 TraceCheckUtils]: 4: Hoare triple {21009#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {21009#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {21009#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {21009#true} assume !(0 != ~p1~0); {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {21009#true} assume !(0 != ~p2~0); {21009#true} is VALID [2018-11-23 12:41:21,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {21009#true} assume !(0 != ~p3~0); {21009#true} is VALID [2018-11-23 12:41:21,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {21009#true} assume !(0 != ~p4~0); {21009#true} is VALID [2018-11-23 12:41:21,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {21009#true} assume 0 != ~p5~0;~lk5~0 := 1; {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {21011#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {21011#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {21011#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {21011#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {21011#(not (= main_~p5~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {21011#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {21011#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {21011#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {21011#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {21011#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:41:21,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {21011#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {21010#false} is VALID [2018-11-23 12:41:21,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {21010#false} assume 0 != ~p6~0; {21010#false} is VALID [2018-11-23 12:41:21,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {21010#false} assume 1 != ~lk6~0; {21010#false} is VALID [2018-11-23 12:41:21,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {21010#false} assume !false; {21010#false} is VALID [2018-11-23 12:41:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:21,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:21,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:21,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:21,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:21,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:21,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:21,143 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-11-23 12:41:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:21,573 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-11-23 12:41:21,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:21,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:41:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:41:21,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 12:41:21,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:21,803 INFO L225 Difference]: With dead ends: 1452 [2018-11-23 12:41:21,803 INFO L226 Difference]: Without dead ends: 986 [2018-11-23 12:41:21,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-23 12:41:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-11-23 12:41:22,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:22,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand 984 states. [2018-11-23 12:41:22,403 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand 984 states. [2018-11-23 12:41:22,403 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 984 states. [2018-11-23 12:41:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:22,472 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2018-11-23 12:41:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2018-11-23 12:41:22,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:22,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:22,473 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand 986 states. [2018-11-23 12:41:22,473 INFO L87 Difference]: Start difference. First operand 984 states. Second operand 986 states. [2018-11-23 12:41:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:22,522 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2018-11-23 12:41:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2018-11-23 12:41:22,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:22,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:22,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:22,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-23 12:41:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-11-23 12:41:22,554 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-11-23 12:41:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:22,554 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-11-23 12:41:22,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-11-23 12:41:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:41:22,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:22,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:22,555 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:22,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-11-23 12:41:22,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:22,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {25516#true} call ULTIMATE.init(); {25516#true} is VALID [2018-11-23 12:41:22,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {25516#true} assume true; {25516#true} is VALID [2018-11-23 12:41:22,766 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25516#true} {25516#true} #197#return; {25516#true} is VALID [2018-11-23 12:41:22,766 INFO L256 TraceCheckUtils]: 3: Hoare triple {25516#true} call #t~ret11 := main(); {25516#true} is VALID [2018-11-23 12:41:22,766 INFO L273 TraceCheckUtils]: 4: Hoare triple {25516#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {25516#true} is VALID [2018-11-23 12:41:22,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {25516#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {25516#true} is VALID [2018-11-23 12:41:22,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {25516#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {25516#true} is VALID [2018-11-23 12:41:22,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {25516#true} assume !(0 != ~p1~0); {25516#true} is VALID [2018-11-23 12:41:22,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {25516#true} assume !(0 != ~p2~0); {25516#true} is VALID [2018-11-23 12:41:22,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {25516#true} assume !(0 != ~p3~0); {25516#true} is VALID [2018-11-23 12:41:22,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {25516#true} assume !(0 != ~p4~0); {25516#true} is VALID [2018-11-23 12:41:22,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {25516#true} assume !(0 != ~p5~0); {25516#true} is VALID [2018-11-23 12:41:22,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {25516#true} assume 0 != ~p6~0;~lk6~0 := 1; {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {25518#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {25518#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {25518#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {25518#(= main_~lk6~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {25518#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {25518#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {25518#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {25518#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {25518#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {25518#(= main_~lk6~0 1)} assume 0 != ~p6~0; {25518#(= main_~lk6~0 1)} is VALID [2018-11-23 12:41:22,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {25518#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {25517#false} is VALID [2018-11-23 12:41:22,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {25517#false} assume !false; {25517#false} is VALID [2018-11-23 12:41:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:22,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:22,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:22,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:22,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:22,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:23,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:23,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:23,213 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-11-23 12:41:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:24,271 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-11-23 12:41:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:24,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:41:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:41:24,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 12:41:24,382 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:41:24,493 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 12:41:24,493 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 12:41:24,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 12:41:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-11-23 12:41:24,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:24,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1416 states. [2018-11-23 12:41:24,789 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1416 states. [2018-11-23 12:41:24,790 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1416 states. [2018-11-23 12:41:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:24,883 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2018-11-23 12:41:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2018-11-23 12:41:24,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:24,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:24,885 INFO L74 IsIncluded]: Start isIncluded. First operand 1416 states. Second operand 1738 states. [2018-11-23 12:41:24,886 INFO L87 Difference]: Start difference. First operand 1416 states. Second operand 1738 states. [2018-11-23 12:41:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:24,978 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2018-11-23 12:41:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2018-11-23 12:41:24,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:24,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:24,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:24,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-11-23 12:41:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-11-23 12:41:25,045 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-11-23 12:41:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:25,046 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-11-23 12:41:25,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-11-23 12:41:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:41:25,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:25,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:25,047 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:25,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-11-23 12:41:25,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:25,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:25,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:25,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {32263#true} call ULTIMATE.init(); {32263#true} is VALID [2018-11-23 12:41:25,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {32263#true} assume true; {32263#true} is VALID [2018-11-23 12:41:25,175 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32263#true} {32263#true} #197#return; {32263#true} is VALID [2018-11-23 12:41:25,175 INFO L256 TraceCheckUtils]: 3: Hoare triple {32263#true} call #t~ret11 := main(); {32263#true} is VALID [2018-11-23 12:41:25,175 INFO L273 TraceCheckUtils]: 4: Hoare triple {32263#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {32263#true} is VALID [2018-11-23 12:41:25,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {32263#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {32263#true} is VALID [2018-11-23 12:41:25,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {32263#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {32263#true} is VALID [2018-11-23 12:41:25,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {32263#true} assume !(0 != ~p1~0); {32263#true} is VALID [2018-11-23 12:41:25,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {32263#true} assume !(0 != ~p2~0); {32263#true} is VALID [2018-11-23 12:41:25,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {32263#true} assume !(0 != ~p3~0); {32263#true} is VALID [2018-11-23 12:41:25,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {32263#true} assume !(0 != ~p4~0); {32263#true} is VALID [2018-11-23 12:41:25,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {32263#true} assume !(0 != ~p5~0); {32263#true} is VALID [2018-11-23 12:41:25,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {32263#true} assume !(0 != ~p6~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {32265#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {32265#(= main_~p6~0 0)} assume !(0 != ~p8~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {32265#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {32265#(= main_~p6~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {32265#(= main_~p6~0 0)} assume !(0 != ~p1~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {32265#(= main_~p6~0 0)} assume !(0 != ~p2~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {32265#(= main_~p6~0 0)} assume !(0 != ~p3~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {32265#(= main_~p6~0 0)} assume !(0 != ~p4~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {32265#(= main_~p6~0 0)} assume !(0 != ~p5~0); {32265#(= main_~p6~0 0)} is VALID [2018-11-23 12:41:25,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {32265#(= main_~p6~0 0)} assume 0 != ~p6~0; {32264#false} is VALID [2018-11-23 12:41:25,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {32264#false} assume 1 != ~lk6~0; {32264#false} is VALID [2018-11-23 12:41:25,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {32264#false} assume !false; {32264#false} is VALID [2018-11-23 12:41:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:25,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:25,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:25,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:25,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:25,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:25,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:25,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:25,208 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-11-23 12:41:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:26,298 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-11-23 12:41:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:26,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:41:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-23 12:41:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-23 12:41:26,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2018-11-23 12:41:26,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:26,624 INFO L225 Difference]: With dead ends: 3276 [2018-11-23 12:41:26,625 INFO L226 Difference]: Without dead ends: 1898 [2018-11-23 12:41:26,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-11-23 12:41:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-11-23 12:41:27,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:27,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1898 states. Second operand 1896 states. [2018-11-23 12:41:27,201 INFO L74 IsIncluded]: Start isIncluded. First operand 1898 states. Second operand 1896 states. [2018-11-23 12:41:27,201 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand 1896 states. [2018-11-23 12:41:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:27,322 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2018-11-23 12:41:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2018-11-23 12:41:27,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:27,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:27,324 INFO L74 IsIncluded]: Start isIncluded. First operand 1896 states. Second operand 1898 states. [2018-11-23 12:41:27,324 INFO L87 Difference]: Start difference. First operand 1896 states. Second operand 1898 states. [2018-11-23 12:41:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:27,457 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2018-11-23 12:41:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2018-11-23 12:41:27,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:27,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:27,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:27,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-11-23 12:41:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-11-23 12:41:27,598 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-11-23 12:41:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:27,598 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-11-23 12:41:27,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-11-23 12:41:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:41:27,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:27,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:27,600 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:27,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-11-23 12:41:27,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:27,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:27,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:27,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {41410#true} call ULTIMATE.init(); {41410#true} is VALID [2018-11-23 12:41:27,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {41410#true} assume true; {41410#true} is VALID [2018-11-23 12:41:27,822 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {41410#true} {41410#true} #197#return; {41410#true} is VALID [2018-11-23 12:41:27,823 INFO L256 TraceCheckUtils]: 3: Hoare triple {41410#true} call #t~ret11 := main(); {41410#true} is VALID [2018-11-23 12:41:27,823 INFO L273 TraceCheckUtils]: 4: Hoare triple {41410#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {41410#true} is VALID [2018-11-23 12:41:27,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {41410#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {41410#true} is VALID [2018-11-23 12:41:27,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {41410#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {41410#true} is VALID [2018-11-23 12:41:27,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {41410#true} assume !(0 != ~p1~0); {41410#true} is VALID [2018-11-23 12:41:27,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {41410#true} assume !(0 != ~p2~0); {41410#true} is VALID [2018-11-23 12:41:27,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {41410#true} assume !(0 != ~p3~0); {41410#true} is VALID [2018-11-23 12:41:27,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {41410#true} assume !(0 != ~p4~0); {41410#true} is VALID [2018-11-23 12:41:27,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {41410#true} assume !(0 != ~p5~0); {41410#true} is VALID [2018-11-23 12:41:27,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {41410#true} assume 0 != ~p6~0;~lk6~0 := 1; {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {41412#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {41412#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {41412#(not (= main_~p6~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {41412#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:41:27,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {41412#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {41411#false} is VALID [2018-11-23 12:41:27,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {41411#false} assume 0 != ~p7~0; {41411#false} is VALID [2018-11-23 12:41:27,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {41411#false} assume 1 != ~lk7~0; {41411#false} is VALID [2018-11-23 12:41:27,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {41411#false} assume !false; {41411#false} is VALID [2018-11-23 12:41:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:27,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:27,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:27,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:27,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:27,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:27,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:27,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:27,865 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-11-23 12:41:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:29,119 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-11-23 12:41:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:29,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 12:41:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 12:41:29,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2018-11-23 12:41:29,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:29,423 INFO L225 Difference]: With dead ends: 2844 [2018-11-23 12:41:29,423 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 12:41:29,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 12:41:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-11-23 12:41:30,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:30,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1928 states. [2018-11-23 12:41:30,272 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1928 states. [2018-11-23 12:41:30,273 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1928 states. [2018-11-23 12:41:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:30,405 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2018-11-23 12:41:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2018-11-23 12:41:30,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:30,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:30,407 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 1930 states. [2018-11-23 12:41:30,407 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 1930 states. [2018-11-23 12:41:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:30,536 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2018-11-23 12:41:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2018-11-23 12:41:30,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:30,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:30,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:30,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 12:41:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-11-23 12:41:30,650 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-11-23 12:41:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:30,650 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-11-23 12:41:30,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-11-23 12:41:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:41:30,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:30,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:30,652 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:30,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-11-23 12:41:30,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:30,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:30,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {50221#true} call ULTIMATE.init(); {50221#true} is VALID [2018-11-23 12:41:30,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {50221#true} assume true; {50221#true} is VALID [2018-11-23 12:41:30,737 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50221#true} {50221#true} #197#return; {50221#true} is VALID [2018-11-23 12:41:30,737 INFO L256 TraceCheckUtils]: 3: Hoare triple {50221#true} call #t~ret11 := main(); {50221#true} is VALID [2018-11-23 12:41:30,737 INFO L273 TraceCheckUtils]: 4: Hoare triple {50221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {50221#true} is VALID [2018-11-23 12:41:30,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {50221#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {50221#true} is VALID [2018-11-23 12:41:30,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {50221#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {50221#true} is VALID [2018-11-23 12:41:30,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {50221#true} assume !(0 != ~p1~0); {50221#true} is VALID [2018-11-23 12:41:30,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {50221#true} assume !(0 != ~p2~0); {50221#true} is VALID [2018-11-23 12:41:30,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {50221#true} assume !(0 != ~p3~0); {50221#true} is VALID [2018-11-23 12:41:30,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {50221#true} assume !(0 != ~p4~0); {50221#true} is VALID [2018-11-23 12:41:30,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {50221#true} assume !(0 != ~p5~0); {50221#true} is VALID [2018-11-23 12:41:30,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {50221#true} assume !(0 != ~p6~0); {50221#true} is VALID [2018-11-23 12:41:30,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {50221#true} assume 0 != ~p7~0;~lk7~0 := 1; {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {50223#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {50223#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {50223#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {50223#(= main_~lk7~0 1)} assume 0 != ~p7~0; {50223#(= main_~lk7~0 1)} is VALID [2018-11-23 12:41:30,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {50223#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {50222#false} is VALID [2018-11-23 12:41:30,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {50222#false} assume !false; {50222#false} is VALID [2018-11-23 12:41:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:30,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:30,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:30,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:30,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:30,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:30,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:30,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:30,774 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-11-23 12:41:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:32,925 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-11-23 12:41:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:32,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 12:41:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 12:41:32,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-23 12:41:33,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:33,433 INFO L225 Difference]: With dead ends: 3340 [2018-11-23 12:41:33,433 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 12:41:33,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 12:41:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-11-23 12:41:34,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:34,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 2824 states. [2018-11-23 12:41:34,018 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 2824 states. [2018-11-23 12:41:34,019 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 2824 states. [2018-11-23 12:41:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:34,343 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2018-11-23 12:41:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2018-11-23 12:41:34,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:34,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:34,347 INFO L74 IsIncluded]: Start isIncluded. First operand 2824 states. Second operand 3338 states. [2018-11-23 12:41:34,347 INFO L87 Difference]: Start difference. First operand 2824 states. Second operand 3338 states. [2018-11-23 12:41:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:34,739 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2018-11-23 12:41:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2018-11-23 12:41:34,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:34,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:34,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:34,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-11-23 12:41:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-11-23 12:41:35,044 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-11-23 12:41:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:35,044 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-11-23 12:41:35,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-11-23 12:41:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:41:35,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:35,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:35,047 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:35,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-11-23 12:41:35,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:35,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:35,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:35,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:35,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:35,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {63272#true} call ULTIMATE.init(); {63272#true} is VALID [2018-11-23 12:41:35,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {63272#true} assume true; {63272#true} is VALID [2018-11-23 12:41:35,113 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {63272#true} {63272#true} #197#return; {63272#true} is VALID [2018-11-23 12:41:35,113 INFO L256 TraceCheckUtils]: 3: Hoare triple {63272#true} call #t~ret11 := main(); {63272#true} is VALID [2018-11-23 12:41:35,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {63272#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {63272#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {63272#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {63272#true} assume !(0 != ~p1~0); {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {63272#true} assume !(0 != ~p2~0); {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {63272#true} assume !(0 != ~p3~0); {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {63272#true} assume !(0 != ~p4~0); {63272#true} is VALID [2018-11-23 12:41:35,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {63272#true} assume !(0 != ~p5~0); {63272#true} is VALID [2018-11-23 12:41:35,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {63272#true} assume !(0 != ~p6~0); {63272#true} is VALID [2018-11-23 12:41:35,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {63272#true} assume !(0 != ~p7~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p8~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {63274#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {63274#(= main_~p7~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p1~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p2~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p3~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p4~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p5~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {63274#(= main_~p7~0 0)} assume !(0 != ~p6~0); {63274#(= main_~p7~0 0)} is VALID [2018-11-23 12:41:35,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {63274#(= main_~p7~0 0)} assume 0 != ~p7~0; {63273#false} is VALID [2018-11-23 12:41:35,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {63273#false} assume 1 != ~lk7~0; {63273#false} is VALID [2018-11-23 12:41:35,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {63273#false} assume !false; {63273#false} is VALID [2018-11-23 12:41:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:35,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:35,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:35,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:35,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:35,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:35,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:35,153 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-11-23 12:41:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:38,025 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-11-23 12:41:38,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:38,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:41:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 12:41:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 12:41:38,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-23 12:41:38,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:38,819 INFO L225 Difference]: With dead ends: 6476 [2018-11-23 12:41:38,820 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 12:41:38,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 12:41:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-11-23 12:41:40,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:40,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3720 states. [2018-11-23 12:41:40,770 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3720 states. [2018-11-23 12:41:40,770 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3720 states. [2018-11-23 12:41:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:41,172 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2018-11-23 12:41:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2018-11-23 12:41:41,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:41,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:41,176 INFO L74 IsIncluded]: Start isIncluded. First operand 3720 states. Second operand 3722 states. [2018-11-23 12:41:41,176 INFO L87 Difference]: Start difference. First operand 3720 states. Second operand 3722 states. [2018-11-23 12:41:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:41,605 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2018-11-23 12:41:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2018-11-23 12:41:41,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:41,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:41,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:41,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-11-23 12:41:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-11-23 12:41:42,188 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-11-23 12:41:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:42,189 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-11-23 12:41:42,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-11-23 12:41:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:41:42,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:42,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:42,192 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:42,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-11-23 12:41:42,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:42,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:42,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {81251#true} call ULTIMATE.init(); {81251#true} is VALID [2018-11-23 12:41:42,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {81251#true} assume true; {81251#true} is VALID [2018-11-23 12:41:42,267 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {81251#true} {81251#true} #197#return; {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L256 TraceCheckUtils]: 3: Hoare triple {81251#true} call #t~ret11 := main(); {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 4: Hoare triple {81251#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {81251#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {81251#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {81251#true} assume !(0 != ~p1~0); {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {81251#true} assume !(0 != ~p2~0); {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {81251#true} assume !(0 != ~p3~0); {81251#true} is VALID [2018-11-23 12:41:42,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {81251#true} assume !(0 != ~p4~0); {81251#true} is VALID [2018-11-23 12:41:42,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {81251#true} assume !(0 != ~p5~0); {81251#true} is VALID [2018-11-23 12:41:42,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {81251#true} assume !(0 != ~p6~0); {81251#true} is VALID [2018-11-23 12:41:42,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {81251#true} assume 0 != ~p7~0;~lk7~0 := 1; {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {81253#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {81253#(not (= main_~p7~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {81253#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:41:42,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {81253#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {81252#false} is VALID [2018-11-23 12:41:42,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {81252#false} assume 0 != ~p8~0; {81252#false} is VALID [2018-11-23 12:41:42,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {81252#false} assume 1 != ~lk8~0; {81252#false} is VALID [2018-11-23 12:41:42,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {81252#false} assume !false; {81252#false} is VALID [2018-11-23 12:41:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:42,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:42,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:42,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:42,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:42,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:42,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:42,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:42,302 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-11-23 12:41:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:44,987 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-11-23 12:41:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:44,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 12:41:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 12:41:44,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2018-11-23 12:41:45,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:45,764 INFO L225 Difference]: With dead ends: 5580 [2018-11-23 12:41:45,764 INFO L226 Difference]: Without dead ends: 3786 [2018-11-23 12:41:45,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-11-23 12:41:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-11-23 12:41:46,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:46,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3786 states. Second operand 3784 states. [2018-11-23 12:41:46,996 INFO L74 IsIncluded]: Start isIncluded. First operand 3786 states. Second operand 3784 states. [2018-11-23 12:41:46,996 INFO L87 Difference]: Start difference. First operand 3786 states. Second operand 3784 states. [2018-11-23 12:41:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:47,416 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2018-11-23 12:41:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2018-11-23 12:41:47,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:47,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:47,420 INFO L74 IsIncluded]: Start isIncluded. First operand 3784 states. Second operand 3786 states. [2018-11-23 12:41:47,420 INFO L87 Difference]: Start difference. First operand 3784 states. Second operand 3786 states. [2018-11-23 12:41:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:47,843 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2018-11-23 12:41:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2018-11-23 12:41:47,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:47,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:47,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:47,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-23 12:41:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-11-23 12:41:48,443 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-11-23 12:41:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:48,443 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-11-23 12:41:48,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-11-23 12:41:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:41:48,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:48,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:41:48,446 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-11-23 12:41:48,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:48,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {98526#true} call ULTIMATE.init(); {98526#true} is VALID [2018-11-23 12:41:48,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {98526#true} assume true; {98526#true} is VALID [2018-11-23 12:41:48,509 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {98526#true} {98526#true} #197#return; {98526#true} is VALID [2018-11-23 12:41:48,509 INFO L256 TraceCheckUtils]: 3: Hoare triple {98526#true} call #t~ret11 := main(); {98526#true} is VALID [2018-11-23 12:41:48,509 INFO L273 TraceCheckUtils]: 4: Hoare triple {98526#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {98526#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {98526#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {98526#true} assume !(0 != ~p1~0); {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {98526#true} assume !(0 != ~p2~0); {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {98526#true} assume !(0 != ~p3~0); {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {98526#true} assume !(0 != ~p4~0); {98526#true} is VALID [2018-11-23 12:41:48,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {98526#true} assume !(0 != ~p5~0); {98526#true} is VALID [2018-11-23 12:41:48,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {98526#true} assume !(0 != ~p6~0); {98526#true} is VALID [2018-11-23 12:41:48,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {98526#true} assume !(0 != ~p7~0); {98526#true} is VALID [2018-11-23 12:41:48,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {98526#true} assume !(0 != ~p8~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {98528#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {98528#(= main_~p8~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p1~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p2~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p3~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p4~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p5~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p6~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {98528#(= main_~p8~0 0)} assume !(0 != ~p7~0); {98528#(= main_~p8~0 0)} is VALID [2018-11-23 12:41:48,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {98528#(= main_~p8~0 0)} assume 0 != ~p8~0; {98527#false} is VALID [2018-11-23 12:41:48,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {98527#false} assume 1 != ~lk8~0; {98527#false} is VALID [2018-11-23 12:41:48,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {98527#false} assume !false; {98527#false} is VALID [2018-11-23 12:41:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:48,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:48,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:48,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:48,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:48,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:48,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:48,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:48,571 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-11-23 12:41:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:58,304 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-11-23 12:41:58,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:58,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:41:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 12:41:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-23 12:41:58,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2018-11-23 12:41:58,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:00,599 INFO L225 Difference]: With dead ends: 10956 [2018-11-23 12:42:00,600 INFO L226 Difference]: Without dead ends: 7306 [2018-11-23 12:42:00,605 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:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-11-23 12:42:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-11-23 12:42:02,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:02,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7306 states. Second operand 7304 states. [2018-11-23 12:42:02,999 INFO L74 IsIncluded]: Start isIncluded. First operand 7306 states. Second operand 7304 states. [2018-11-23 12:42:03,000 INFO L87 Difference]: Start difference. First operand 7306 states. Second operand 7304 states. [2018-11-23 12:42:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:05,067 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2018-11-23 12:42:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2018-11-23 12:42:05,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:05,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:05,076 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 7306 states. [2018-11-23 12:42:05,076 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 7306 states. [2018-11-23 12:42:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:07,171 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2018-11-23 12:42:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2018-11-23 12:42:07,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:07,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:07,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:07,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 12:42:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-11-23 12:42:09,466 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-11-23 12:42:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:09,467 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-11-23 12:42:09,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-11-23 12:42:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:09,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:09,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:09,470 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:09,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-11-23 12:42:09,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:09,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {132057#true} call ULTIMATE.init(); {132057#true} is VALID [2018-11-23 12:42:09,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {132057#true} assume true; {132057#true} is VALID [2018-11-23 12:42:09,522 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {132057#true} {132057#true} #197#return; {132057#true} is VALID [2018-11-23 12:42:09,522 INFO L256 TraceCheckUtils]: 3: Hoare triple {132057#true} call #t~ret11 := main(); {132057#true} is VALID [2018-11-23 12:42:09,522 INFO L273 TraceCheckUtils]: 4: Hoare triple {132057#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {132057#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {132057#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {132057#true} assume !(0 != ~p1~0); {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {132057#true} assume !(0 != ~p2~0); {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {132057#true} assume !(0 != ~p3~0); {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {132057#true} assume !(0 != ~p4~0); {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {132057#true} assume !(0 != ~p5~0); {132057#true} is VALID [2018-11-23 12:42:09,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {132057#true} assume !(0 != ~p6~0); {132057#true} is VALID [2018-11-23 12:42:09,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {132057#true} assume !(0 != ~p7~0); {132057#true} is VALID [2018-11-23 12:42:09,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {132057#true} assume 0 != ~p8~0;~lk8~0 := 1; {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {132059#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {132059#(= main_~lk8~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {132059#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {132059#(= main_~lk8~0 1)} assume 0 != ~p8~0; {132059#(= main_~lk8~0 1)} is VALID [2018-11-23 12:42:09,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {132059#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {132058#false} is VALID [2018-11-23 12:42:09,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {132058#false} assume !false; {132058#false} is VALID [2018-11-23 12:42:09,535 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:09,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:09,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:09,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:09,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:09,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:09,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:09,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:09,557 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-11-23 12:42:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:18,777 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-11-23 12:42:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:18,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-23 12:42:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-23 12:42:18,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-23 12:42:18,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:21,627 INFO L225 Difference]: With dead ends: 8076 [2018-11-23 12:42:21,628 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 12:42:21,629 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:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 12:42:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-11-23 12:42:24,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:24,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 7304 states. [2018-11-23 12:42:24,720 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 7304 states. [2018-11-23 12:42:24,720 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 7304 states. [2018-11-23 12:42:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:27,269 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2018-11-23 12:42:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2018-11-23 12:42:27,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:27,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:27,275 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 8074 states. [2018-11-23 12:42:27,275 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 8074 states. [2018-11-23 12:42:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:29,869 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2018-11-23 12:42:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2018-11-23 12:42:29,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:29,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:29,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:29,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-23 12:42:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-11-23 12:42:32,232 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-11-23 12:42:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:32,232 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-11-23 12:42:32,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-11-23 12:42:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:32,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:32,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:32,236 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:32,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-11-23 12:42:32,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:32,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:32,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:32,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {164244#true} call ULTIMATE.init(); {164244#true} is VALID [2018-11-23 12:42:32,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {164244#true} assume true; {164244#true} is VALID [2018-11-23 12:42:32,340 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {164244#true} {164244#true} #197#return; {164244#true} is VALID [2018-11-23 12:42:32,340 INFO L256 TraceCheckUtils]: 3: Hoare triple {164244#true} call #t~ret11 := main(); {164244#true} is VALID [2018-11-23 12:42:32,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {164244#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {164244#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {164244#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {164244#true} assume !(0 != ~p1~0); {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {164244#true} assume !(0 != ~p2~0); {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {164244#true} assume !(0 != ~p3~0); {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {164244#true} assume !(0 != ~p4~0); {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {164244#true} assume !(0 != ~p5~0); {164244#true} is VALID [2018-11-23 12:42:32,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {164244#true} assume !(0 != ~p6~0); {164244#true} is VALID [2018-11-23 12:42:32,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {164244#true} assume !(0 != ~p7~0); {164244#true} is VALID [2018-11-23 12:42:32,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {164244#true} assume !(0 != ~p8~0); {164244#true} is VALID [2018-11-23 12:42:32,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {164244#true} assume 0 != ~p9~0;~lk9~0 := 1; {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {164246#(= main_~lk9~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {164246#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {164246#(= main_~lk9~0 1)} assume 0 != ~p9~0; {164246#(= main_~lk9~0 1)} is VALID [2018-11-23 12:42:32,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {164246#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {164245#false} is VALID [2018-11-23 12:42:32,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {164245#false} assume !false; {164245#false} is VALID [2018-11-23 12:42:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:32,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:32,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:32,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:32,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:32,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:32,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:32,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:32,385 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-11-23 12:42:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,134 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-11-23 12:42:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:42:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:42:46,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 12:42:46,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:52,605 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 12:42:52,606 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 12:42:52,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 12:42:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-11-23 12:42:58,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:58,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 11144 states. [2018-11-23 12:42:58,341 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 11144 states. [2018-11-23 12:42:58,341 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 11144 states. [2018-11-23 12:43:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,061 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2018-11-23 12:43:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2018-11-23 12:43:03,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:03,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:03,070 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 12170 states. [2018-11-23 12:43:03,070 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 12170 states. [2018-11-23 12:43:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,903 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2018-11-23 12:43:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2018-11-23 12:43:08,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:08,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:08,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:08,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-23 12:43:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-11-23 12:43:14,994 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-11-23 12:43:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:14,994 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-11-23 12:43:14,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-11-23 12:43:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:43:15,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:15,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:15,000 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:15,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-11-23 12:43:15,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:15,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:15,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:15,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {212687#true} call ULTIMATE.init(); {212687#true} is VALID [2018-11-23 12:43:15,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {212687#true} assume true; {212687#true} is VALID [2018-11-23 12:43:15,047 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {212687#true} {212687#true} #197#return; {212687#true} is VALID [2018-11-23 12:43:15,047 INFO L256 TraceCheckUtils]: 3: Hoare triple {212687#true} call #t~ret11 := main(); {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 4: Hoare triple {212687#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {212687#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {212687#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {212687#true} assume !(0 != ~p1~0); {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {212687#true} assume !(0 != ~p2~0); {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {212687#true} assume !(0 != ~p3~0); {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {212687#true} assume !(0 != ~p4~0); {212687#true} is VALID [2018-11-23 12:43:15,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {212687#true} assume !(0 != ~p5~0); {212687#true} is VALID [2018-11-23 12:43:15,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {212687#true} assume !(0 != ~p6~0); {212687#true} is VALID [2018-11-23 12:43:15,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {212687#true} assume !(0 != ~p7~0); {212687#true} is VALID [2018-11-23 12:43:15,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {212687#true} assume !(0 != ~p8~0); {212687#true} is VALID [2018-11-23 12:43:15,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {212687#true} assume !(0 != ~p9~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {212689#(= main_~p9~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p1~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,056 INFO L273 TraceCheckUtils]: 18: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p2~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p3~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p4~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p5~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p6~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p7~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {212689#(= main_~p9~0 0)} assume !(0 != ~p8~0); {212689#(= main_~p9~0 0)} is VALID [2018-11-23 12:43:15,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {212689#(= main_~p9~0 0)} assume 0 != ~p9~0; {212688#false} is VALID [2018-11-23 12:43:15,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {212688#false} assume 1 != ~lk9~0; {212688#false} is VALID [2018-11-23 12:43:15,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {212688#false} assume !false; {212688#false} is VALID [2018-11-23 12:43:15,064 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:15,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:15,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:15,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:43:15,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:15,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:15,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:15,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:15,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:15,192 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-11-23 12:44:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:16,208 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-11-23 12:44:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:16,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:44:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 12:44:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 12:44:16,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2018-11-23 12:44:16,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:25,854 INFO L225 Difference]: With dead ends: 25228 [2018-11-23 12:44:25,854 INFO L226 Difference]: Without dead ends: 14218 [2018-11-23 12:44:25,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states.