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_12_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:41:53,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:41:53,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:41:53,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:41:53,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:41:53,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:41:53,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:41:53,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:41:53,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:41:53,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:41:53,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:41:53,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:41:53,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:41:53,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:41:53,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:41:53,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:41:53,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:41:53,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:41:53,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:41:53,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:41:53,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:41:53,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:41:53,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:41:53,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:41:53,163 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:41:53,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:41:53,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:41:53,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:41:53,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:41:53,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:41:53,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:41:53,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:41:53,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:41:53,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:41:53,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:41:53,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:41:53,178 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:53,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:41:53,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:41:53,206 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:41:53,207 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:41:53,207 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:41:53,207 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:41:53,208 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:41:53,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:41:53,208 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:41:53,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:41:53,208 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:41:53,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:41:53,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:41:53,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:41:53,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:41:53,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:41:53,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:41:53,211 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:41:53,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:41:53,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:41:53,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:41:53,213 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:41:53,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:41:53,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:41:53,214 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:41:53,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:41:53,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:41:53,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:41:53,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:41:53,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:41:53,216 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:41:53,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:41:53,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:41:53,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:41:53,300 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:41:53,300 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:41:53,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:53,365 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca5d9599/143bfc8d6d91430799c48a609a191f3e/FLAGd60165289 [2018-11-23 12:41:53,771 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:41:53,772 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:53,785 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca5d9599/143bfc8d6d91430799c48a609a191f3e/FLAGd60165289 [2018-11-23 12:41:54,145 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca5d9599/143bfc8d6d91430799c48a609a191f3e [2018-11-23 12:41:54,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:41:54,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:41:54,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:54,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:41:54,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:41:54,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:54" (1/1) ... [2018-11-23 12:41:54,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fd4649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:54, skipping insertion in model container [2018-11-23 12:41:54,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:54" (1/1) ... [2018-11-23 12:41:54,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:41:54,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:41:54,470 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:54,476 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:41:54,516 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:41:54,533 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:41:54,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:54 WrapperNode [2018-11-23 12:41:54,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:41:54,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:54,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:41:54,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:41:54,544 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:54" (1/1) ... [2018-11-23 12:41:54,550 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:54" (1/1) ... [2018-11-23 12:41:54,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:41:54,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:41:54,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:41:54,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:41:54,567 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:54" (1/1) ... [2018-11-23 12:41:54,567 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:54" (1/1) ... [2018-11-23 12:41:54,568 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:54" (1/1) ... [2018-11-23 12:41:54,569 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:54" (1/1) ... [2018-11-23 12:41:54,578 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:54" (1/1) ... [2018-11-23 12:41:54,592 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:54" (1/1) ... [2018-11-23 12:41:54,596 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:54" (1/1) ... [2018-11-23 12:41:54,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:41:54,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:41:54,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:41:54,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:41:54,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:54" (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:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:41:54,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:41:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:41:54,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:41:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:41:54,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:41:55,843 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:41:55,843 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:41:55,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:55 BoogieIcfgContainer [2018-11-23 12:41:55,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:41:55,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:41:55,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:41:55,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:41:55,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:41:54" (1/3) ... [2018-11-23 12:41:55,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b4803d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:55, skipping insertion in model container [2018-11-23 12:41:55,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:54" (2/3) ... [2018-11-23 12:41:55,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b4803d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:55, skipping insertion in model container [2018-11-23 12:41:55,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:55" (3/3) ... [2018-11-23 12:41:55,854 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:41:55,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:41:55,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:41:55,893 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:41:55,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:41:55,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:41:55,929 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:41:55,929 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:41:55,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:41:55,930 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:41:55,930 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:41:55,930 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:41:55,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:41:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 12:41:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:55,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:55,960 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:55,963 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:55,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-11-23 12:41:55,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:55,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:56,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:56,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 12:41:56,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 12:41:56,241 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #231#return; {53#true} is VALID [2018-11-23 12:41:56,242 INFO L256 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret13 := main(); {53#true} is VALID [2018-11-23 12:41:56,242 INFO L273 TraceCheckUtils]: 4: Hoare triple {53#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {53#true} is VALID [2018-11-23 12:41:56,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {53#true} is VALID [2018-11-23 12:41:56,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {53#true} is VALID [2018-11-23 12:41:56,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} assume 0 != ~p1~0;~lk1~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {55#(= main_~lk1~0 1)} assume 0 != ~p1~0; {55#(= main_~lk1~0 1)} is VALID [2018-11-23 12:41:56,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {55#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {54#false} is VALID [2018-11-23 12:41:56,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 12:41:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:41:56,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:56,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:56,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:56,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:56,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:56,390 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:56,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:56,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:56,401 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 12:41:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:57,421 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-11-23 12:41:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:57,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:41:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 12:41:57,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 12:41:57,780 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:57,800 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:41:57,801 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:41:57,809 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:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:41:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-23 12:41:57,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:57,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 58 states. [2018-11-23 12:41:57,859 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 58 states. [2018-11-23 12:41:57,859 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 58 states. [2018-11-23 12:41:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:57,871 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2018-11-23 12:41:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 152 transitions. [2018-11-23 12:41:57,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:57,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:57,873 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 84 states. [2018-11-23 12:41:57,873 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 84 states. [2018-11-23 12:41:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:57,882 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2018-11-23 12:41:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 152 transitions. [2018-11-23 12:41:57,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:57,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:57,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:57,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:41:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-11-23 12:41:57,891 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-11-23 12:41:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:57,892 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-11-23 12:41:57,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-11-23 12:41:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:41:57,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:57,893 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:57,894 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:57,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-11-23 12:41:57,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:57,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:57,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:57,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:57,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:58,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-23 12:41:58,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-23 12:41:58,052 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {401#true} {401#true} #231#return; {401#true} is VALID [2018-11-23 12:41:58,053 INFO L256 TraceCheckUtils]: 3: Hoare triple {401#true} call #t~ret13 := main(); {401#true} is VALID [2018-11-23 12:41:58,053 INFO L273 TraceCheckUtils]: 4: Hoare triple {401#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {401#true} is VALID [2018-11-23 12:41:58,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {401#true} is VALID [2018-11-23 12:41:58,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {401#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {401#true} is VALID [2018-11-23 12:41:58,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {401#true} assume !(0 != ~p1~0); {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {403#(= main_~p1~0 0)} assume !(0 != ~p8~0); {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,101 INFO L273 TraceCheckUtils]: 16: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,101 INFO L273 TraceCheckUtils]: 17: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {403#(= main_~p1~0 0)} is VALID [2018-11-23 12:41:58,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {403#(= main_~p1~0 0)} assume 0 != ~p1~0; {402#false} is VALID [2018-11-23 12:41:58,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {402#false} assume 1 != ~lk1~0; {402#false} is VALID [2018-11-23 12:41:58,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-23 12:41:58,131 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:58,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:58,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:58,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:58,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:58,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:58,169 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:58,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:58,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:58,170 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-11-23 12:41:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:58,571 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-11-23 12:41:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:58,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:41:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 12:41:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 12:41:58,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-23 12:41:58,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:58,926 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:41:58,926 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:41:58,927 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:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:41:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 12:41:58,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:58,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-23 12:41:58,972 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-23 12:41:58,973 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-23 12:41:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:58,978 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2018-11-23 12:41:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 150 transitions. [2018-11-23 12:41:58,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:58,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:58,980 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-23 12:41:58,980 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-23 12:41:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:58,986 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2018-11-23 12:41:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 150 transitions. [2018-11-23 12:41:58,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:58,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:58,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:58,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:41:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-11-23 12:41:58,993 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-11-23 12:41:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:58,993 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-11-23 12:41:58,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-11-23 12:41:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:58,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:58,995 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:58,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:58,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-11-23 12:41:58,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:58,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:58,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:59,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {810#true} call ULTIMATE.init(); {810#true} is VALID [2018-11-23 12:41:59,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {810#true} assume true; {810#true} is VALID [2018-11-23 12:41:59,098 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {810#true} {810#true} #231#return; {810#true} is VALID [2018-11-23 12:41:59,098 INFO L256 TraceCheckUtils]: 3: Hoare triple {810#true} call #t~ret13 := main(); {810#true} is VALID [2018-11-23 12:41:59,099 INFO L273 TraceCheckUtils]: 4: Hoare triple {810#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {810#true} is VALID [2018-11-23 12:41:59,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {810#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {810#true} is VALID [2018-11-23 12:41:59,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {810#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {810#true} is VALID [2018-11-23 12:41:59,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {810#true} assume 0 != ~p1~0;~lk1~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {812#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {812#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {812#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:41:59,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {812#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {811#false} is VALID [2018-11-23 12:41:59,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {811#false} assume 0 != ~p2~0; {811#false} is VALID [2018-11-23 12:41:59,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {811#false} assume 1 != ~lk2~0; {811#false} is VALID [2018-11-23 12:41:59,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {811#false} assume !false; {811#false} is VALID [2018-11-23 12:41:59,129 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:59,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:59,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:59,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:59,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:59,160 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:59,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:59,161 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-11-23 12:41:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:59,390 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-11-23 12:41:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:41:59,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:41:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 12:41:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:41:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 12:41:59,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 222 transitions. [2018-11-23 12:41:59,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:41:59,681 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:41:59,681 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:41:59,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:41:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:41:59,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:41:59,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:41:59,722 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:41:59,722 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:41:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:59,726 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-23 12:41:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 152 transitions. [2018-11-23 12:41:59,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:59,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:59,728 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:41:59,728 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:41:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:41:59,733 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-23 12:41:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 152 transitions. [2018-11-23 12:41:59,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:41:59,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:41:59,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:41:59,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:41:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:41:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-11-23 12:41:59,739 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-11-23 12:41:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:41:59,739 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-11-23 12:41:59,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:41:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-11-23 12:41:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:41:59,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:41:59,741 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:59,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:41:59,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:41:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-11-23 12:41:59,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:41:59,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:41:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:59,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:41:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:41:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:41:59,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {1219#true} call ULTIMATE.init(); {1219#true} is VALID [2018-11-23 12:41:59,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {1219#true} assume true; {1219#true} is VALID [2018-11-23 12:41:59,913 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1219#true} {1219#true} #231#return; {1219#true} is VALID [2018-11-23 12:41:59,913 INFO L256 TraceCheckUtils]: 3: Hoare triple {1219#true} call #t~ret13 := main(); {1219#true} is VALID [2018-11-23 12:41:59,914 INFO L273 TraceCheckUtils]: 4: Hoare triple {1219#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {1219#true} is VALID [2018-11-23 12:41:59,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {1219#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1219#true} is VALID [2018-11-23 12:41:59,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {1219#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {1219#true} is VALID [2018-11-23 12:41:59,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {1219#true} assume !(0 != ~p1~0); {1219#true} is VALID [2018-11-23 12:41:59,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {1219#true} assume 0 != ~p2~0;~lk2~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {1221#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {1221#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {1221#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1221#(= main_~lk2~0 1)} is VALID [2018-11-23 12:41:59,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {1221#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1220#false} is VALID [2018-11-23 12:41:59,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2018-11-23 12:41:59,934 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:59,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:41:59,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:41:59,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:41:59,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:41:59,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:41:59,958 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:59,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:41:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:41:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:41:59,960 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-11-23 12:42:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,146 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-11-23 12:42:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:00,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:42:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:42:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:42:00,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 12:42:00,311 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:42:00,316 INFO L225 Difference]: With dead ends: 160 [2018-11-23 12:42:00,316 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 12:42:00,316 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,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 12:42:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-23 12:42:00,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:00,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 112 states. [2018-11-23 12:42:00,357 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 112 states. [2018-11-23 12:42:00,357 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 112 states. [2018-11-23 12:42:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,365 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2018-11-23 12:42:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 285 transitions. [2018-11-23 12:42:00,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:00,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:00,367 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 158 states. [2018-11-23 12:42:00,367 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 158 states. [2018-11-23 12:42:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,375 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2018-11-23 12:42:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 285 transitions. [2018-11-23 12:42:00,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:00,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:00,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:00,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:42:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-11-23 12:42:00,381 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-11-23 12:42:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:00,382 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-11-23 12:42:00,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-11-23 12:42:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:42:00,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:00,383 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:42:00,383 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:00,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-11-23 12:42:00,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:00,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:00,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:00,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 12:42:00,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 12:42:00,481 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1832#true} {1832#true} #231#return; {1832#true} is VALID [2018-11-23 12:42:00,482 INFO L256 TraceCheckUtils]: 3: Hoare triple {1832#true} call #t~ret13 := main(); {1832#true} is VALID [2018-11-23 12:42:00,482 INFO L273 TraceCheckUtils]: 4: Hoare triple {1832#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {1832#true} is VALID [2018-11-23 12:42:00,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1832#true} is VALID [2018-11-23 12:42:00,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {1832#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {1832#true} is VALID [2018-11-23 12:42:00,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {1832#true} assume !(0 != ~p1~0); {1832#true} is VALID [2018-11-23 12:42:00,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1832#true} assume !(0 != ~p2~0); {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {1834#(= main_~p2~0 0)} assume !(0 != ~p8~0); {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {1834#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1834#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:00,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {1834#(= main_~p2~0 0)} assume 0 != ~p2~0; {1833#false} is VALID [2018-11-23 12:42:00,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {1833#false} assume 1 != ~lk2~0; {1833#false} is VALID [2018-11-23 12:42:00,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 12:42:00,506 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:00,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:00,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:00,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:42:00,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:00,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:00,543 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:42:00,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:00,544 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-11-23 12:42:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:00,839 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-11-23 12:42:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:00,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:42:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-23 12:42:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-23 12:42:00,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2018-11-23 12:42:01,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:01,292 INFO L225 Difference]: With dead ends: 264 [2018-11-23 12:42:01,292 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 12:42:01,293 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:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 12:42:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-23 12:42:01,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:01,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-23 12:42:01,340 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-23 12:42:01,340 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-23 12:42:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:01,347 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2018-11-23 12:42:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 283 transitions. [2018-11-23 12:42:01,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:01,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:01,349 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-23 12:42:01,349 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-23 12:42:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:01,355 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2018-11-23 12:42:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 283 transitions. [2018-11-23 12:42:01,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:01,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:01,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:01,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 12:42:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-11-23 12:42:01,363 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-11-23 12:42:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:01,363 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-11-23 12:42:01,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-23 12:42:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:01,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:01,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:01,365 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:01,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-11-23 12:42:01,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:01,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:01,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {2603#true} call ULTIMATE.init(); {2603#true} is VALID [2018-11-23 12:42:01,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {2603#true} assume true; {2603#true} is VALID [2018-11-23 12:42:01,446 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2603#true} {2603#true} #231#return; {2603#true} is VALID [2018-11-23 12:42:01,446 INFO L256 TraceCheckUtils]: 3: Hoare triple {2603#true} call #t~ret13 := main(); {2603#true} is VALID [2018-11-23 12:42:01,446 INFO L273 TraceCheckUtils]: 4: Hoare triple {2603#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {2603#true} is VALID [2018-11-23 12:42:01,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {2603#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2603#true} is VALID [2018-11-23 12:42:01,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {2603#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {2603#true} is VALID [2018-11-23 12:42:01,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {2603#true} assume !(0 != ~p1~0); {2603#true} is VALID [2018-11-23 12:42:01,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {2603#true} assume 0 != ~p2~0;~lk2~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,469 INFO L273 TraceCheckUtils]: 11: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {2605#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {2605#(not (= main_~p2~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {2605#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {2605#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:01,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {2605#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {2604#false} is VALID [2018-11-23 12:42:01,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {2604#false} assume 0 != ~p3~0; {2604#false} is VALID [2018-11-23 12:42:01,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {2604#false} assume 1 != ~lk3~0; {2604#false} is VALID [2018-11-23 12:42:01,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {2604#false} assume !false; {2604#false} is VALID [2018-11-23 12:42:01,488 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:01,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:01,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:01,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:01,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:01,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:01,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:01,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:01,537 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-11-23 12:42:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:01,905 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-11-23 12:42:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:01,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-23 12:42:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-23 12:42:01,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2018-11-23 12:42:02,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:02,264 INFO L225 Difference]: With dead ends: 237 [2018-11-23 12:42:02,264 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 12:42:02,265 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:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 12:42:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 12:42:02,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:02,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2018-11-23 12:42:02,535 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2018-11-23 12:42:02,535 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2018-11-23 12:42:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,551 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2018-11-23 12:42:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 283 transitions. [2018-11-23 12:42:02,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:02,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:02,553 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2018-11-23 12:42:02,553 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2018-11-23 12:42:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,570 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2018-11-23 12:42:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 283 transitions. [2018-11-23 12:42:02,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:02,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:02,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:02,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:42:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-11-23 12:42:02,578 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-11-23 12:42:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:02,578 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-11-23 12:42:02,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-11-23 12:42:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:02,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:02,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:02,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:02,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-11-23 12:42:02,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:02,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:02,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:02,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:02,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2018-11-23 12:42:02,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {3353#true} assume true; {3353#true} is VALID [2018-11-23 12:42:02,689 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3353#true} {3353#true} #231#return; {3353#true} is VALID [2018-11-23 12:42:02,689 INFO L256 TraceCheckUtils]: 3: Hoare triple {3353#true} call #t~ret13 := main(); {3353#true} is VALID [2018-11-23 12:42:02,690 INFO L273 TraceCheckUtils]: 4: Hoare triple {3353#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {3353#true} is VALID [2018-11-23 12:42:02,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {3353#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {3353#true} is VALID [2018-11-23 12:42:02,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {3353#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {3353#true} is VALID [2018-11-23 12:42:02,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {3353#true} assume !(0 != ~p1~0); {3353#true} is VALID [2018-11-23 12:42:02,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 != ~p2~0); {3353#true} is VALID [2018-11-23 12:42:02,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {3353#true} assume 0 != ~p3~0;~lk3~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {3355#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {3355#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {3355#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {3355#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3355#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:02,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {3355#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3354#false} is VALID [2018-11-23 12:42:02,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2018-11-23 12:42:02,702 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:02,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:02,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:02,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:02,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:02,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:02,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:02,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:02,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:02,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:02,738 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-11-23 12:42:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:02,942 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-11-23 12:42:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:02,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:42:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:42:02,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 12:42:03,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:03,133 INFO L225 Difference]: With dead ends: 300 [2018-11-23 12:42:03,134 INFO L226 Difference]: Without dead ends: 298 [2018-11-23 12:42:03,134 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:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-23 12:42:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-11-23 12:42:03,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:03,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand 216 states. [2018-11-23 12:42:03,411 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand 216 states. [2018-11-23 12:42:03,411 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 216 states. [2018-11-23 12:42:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:03,422 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2018-11-23 12:42:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 531 transitions. [2018-11-23 12:42:03,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:03,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:03,423 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 298 states. [2018-11-23 12:42:03,423 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 298 states. [2018-11-23 12:42:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:03,433 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2018-11-23 12:42:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 531 transitions. [2018-11-23 12:42:03,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:03,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:03,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:03,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-23 12:42:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-11-23 12:42:03,441 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-11-23 12:42:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:03,441 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-11-23 12:42:03,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-11-23 12:42:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:42:03,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:03,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:03,443 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:03,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-11-23 12:42:03,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:03,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:03,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2018-11-23 12:42:03,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 12:42:03,577 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4496#true} {4496#true} #231#return; {4496#true} is VALID [2018-11-23 12:42:03,578 INFO L256 TraceCheckUtils]: 3: Hoare triple {4496#true} call #t~ret13 := main(); {4496#true} is VALID [2018-11-23 12:42:03,578 INFO L273 TraceCheckUtils]: 4: Hoare triple {4496#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {4496#true} is VALID [2018-11-23 12:42:03,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {4496#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {4496#true} is VALID [2018-11-23 12:42:03,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {4496#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {4496#true} is VALID [2018-11-23 12:42:03,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {4496#true} assume !(0 != ~p1~0); {4496#true} is VALID [2018-11-23 12:42:03,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {4496#true} assume !(0 != ~p2~0); {4496#true} is VALID [2018-11-23 12:42:03,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {4496#true} assume !(0 != ~p3~0); {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {4498#(= main_~p3~0 0)} assume !(0 != ~p8~0); {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {4498#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {4498#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4498#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:03,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {4498#(= main_~p3~0 0)} assume 0 != ~p3~0; {4497#false} is VALID [2018-11-23 12:42:03,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {4497#false} assume 1 != ~lk3~0; {4497#false} is VALID [2018-11-23 12:42:03,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2018-11-23 12:42:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:03,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:03,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:03,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:03,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:03,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:03,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:03,621 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-11-23 12:42:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:04,014 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-11-23 12:42:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:04,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:42:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2018-11-23 12:42:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2018-11-23 12:42:04,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2018-11-23 12:42:04,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:04,910 INFO L225 Difference]: With dead ends: 512 [2018-11-23 12:42:04,910 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 12:42:04,912 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:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 12:42:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 12:42:04,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:04,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 304 states. [2018-11-23 12:42:04,978 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 304 states. [2018-11-23 12:42:04,978 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 304 states. [2018-11-23 12:42:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:04,988 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2018-11-23 12:42:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 531 transitions. [2018-11-23 12:42:04,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:04,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:04,989 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 306 states. [2018-11-23 12:42:04,990 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 306 states. [2018-11-23 12:42:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:04,998 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2018-11-23 12:42:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 531 transitions. [2018-11-23 12:42:04,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:04,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:04,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:05,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 12:42:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-11-23 12:42:05,008 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-11-23 12:42:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:05,008 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-11-23 12:42:05,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-11-23 12:42:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:05,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:05,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:05,010 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:05,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-11-23 12:42:05,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:05,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {5963#true} call ULTIMATE.init(); {5963#true} is VALID [2018-11-23 12:42:05,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {5963#true} assume true; {5963#true} is VALID [2018-11-23 12:42:05,237 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5963#true} {5963#true} #231#return; {5963#true} is VALID [2018-11-23 12:42:05,237 INFO L256 TraceCheckUtils]: 3: Hoare triple {5963#true} call #t~ret13 := main(); {5963#true} is VALID [2018-11-23 12:42:05,238 INFO L273 TraceCheckUtils]: 4: Hoare triple {5963#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {5963#true} is VALID [2018-11-23 12:42:05,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {5963#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {5963#true} is VALID [2018-11-23 12:42:05,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {5963#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {5963#true} is VALID [2018-11-23 12:42:05,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {5963#true} assume !(0 != ~p1~0); {5963#true} is VALID [2018-11-23 12:42:05,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {5963#true} assume !(0 != ~p2~0); {5963#true} is VALID [2018-11-23 12:42:05,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {5963#true} assume 0 != ~p3~0;~lk3~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {5965#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {5965#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {5965#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {5965#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5965#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:05,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {5965#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5964#false} is VALID [2018-11-23 12:42:05,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {5964#false} assume 0 != ~p4~0; {5964#false} is VALID [2018-11-23 12:42:05,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {5964#false} assume 1 != ~lk4~0; {5964#false} is VALID [2018-11-23 12:42:05,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {5964#false} assume !false; {5964#false} is VALID [2018-11-23 12:42:05,390 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:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:05,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:05,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:05,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:05,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:05,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:05,485 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-11-23 12:42:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:05,827 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-11-23 12:42:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:05,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2018-11-23 12:42:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2018-11-23 12:42:05,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2018-11-23 12:42:06,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:06,444 INFO L225 Difference]: With dead ends: 456 [2018-11-23 12:42:06,444 INFO L226 Difference]: Without dead ends: 310 [2018-11-23 12:42:06,445 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:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-23 12:42:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-11-23 12:42:06,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:06,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand 308 states. [2018-11-23 12:42:06,636 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand 308 states. [2018-11-23 12:42:06,636 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 308 states. [2018-11-23 12:42:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:06,644 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2018-11-23 12:42:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 531 transitions. [2018-11-23 12:42:06,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:06,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:06,645 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 310 states. [2018-11-23 12:42:06,645 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 310 states. [2018-11-23 12:42:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:06,652 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2018-11-23 12:42:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 531 transitions. [2018-11-23 12:42:06,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:06,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:06,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:06,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-23 12:42:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-11-23 12:42:06,661 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-11-23 12:42:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:06,662 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-11-23 12:42:06,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-11-23 12:42:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:06,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:06,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:06,663 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:06,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-11-23 12:42:06,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:06,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:06,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {7386#true} call ULTIMATE.init(); {7386#true} is VALID [2018-11-23 12:42:06,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {7386#true} assume true; {7386#true} is VALID [2018-11-23 12:42:06,885 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7386#true} {7386#true} #231#return; {7386#true} is VALID [2018-11-23 12:42:06,885 INFO L256 TraceCheckUtils]: 3: Hoare triple {7386#true} call #t~ret13 := main(); {7386#true} is VALID [2018-11-23 12:42:06,885 INFO L273 TraceCheckUtils]: 4: Hoare triple {7386#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {7386#true} is VALID [2018-11-23 12:42:06,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {7386#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {7386#true} is VALID [2018-11-23 12:42:06,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {7386#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {7386#true} is VALID [2018-11-23 12:42:06,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {7386#true} assume !(0 != ~p1~0); {7386#true} is VALID [2018-11-23 12:42:06,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {7386#true} assume !(0 != ~p2~0); {7386#true} is VALID [2018-11-23 12:42:06,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {7386#true} assume !(0 != ~p3~0); {7386#true} is VALID [2018-11-23 12:42:06,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {7386#true} assume 0 != ~p4~0;~lk4~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {7388#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {7388#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {7388#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {7388#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {7388#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7388#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:06,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {7388#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7387#false} is VALID [2018-11-23 12:42:06,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {7387#false} assume !false; {7387#false} is VALID [2018-11-23 12:42:06,913 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:06,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:06,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:06,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:06,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:06,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:06,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:06,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:06,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:06,936 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-11-23 12:42:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:07,155 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-11-23 12:42:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:07,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 12:42:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 12:42:07,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2018-11-23 12:42:07,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:07,333 INFO L225 Difference]: With dead ends: 572 [2018-11-23 12:42:07,333 INFO L226 Difference]: Without dead ends: 570 [2018-11-23 12:42:07,334 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:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-23 12:42:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-11-23 12:42:07,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:07,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand 424 states. [2018-11-23 12:42:07,493 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand 424 states. [2018-11-23 12:42:07,493 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 424 states. [2018-11-23 12:42:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:07,512 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2018-11-23 12:42:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 991 transitions. [2018-11-23 12:42:07,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:07,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:07,514 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand 570 states. [2018-11-23 12:42:07,514 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 570 states. [2018-11-23 12:42:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:07,534 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2018-11-23 12:42:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 991 transitions. [2018-11-23 12:42:07,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:07,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:07,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:07,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-23 12:42:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-11-23 12:42:07,548 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-11-23 12:42:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:07,549 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-11-23 12:42:07,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-11-23 12:42:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:42:07,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:07,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:07,550 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:07,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:07,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-11-23 12:42:07,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:07,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:07,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {9565#true} call ULTIMATE.init(); {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {9565#true} assume true; {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9565#true} {9565#true} #231#return; {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {9565#true} call #t~ret13 := main(); {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L273 TraceCheckUtils]: 4: Hoare triple {9565#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {9565#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {9565#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {9565#true} is VALID [2018-11-23 12:42:07,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {9565#true} assume !(0 != ~p1~0); {9565#true} is VALID [2018-11-23 12:42:07,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {9565#true} assume !(0 != ~p2~0); {9565#true} is VALID [2018-11-23 12:42:07,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {9565#true} assume !(0 != ~p3~0); {9565#true} is VALID [2018-11-23 12:42:07,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {9565#true} assume !(0 != ~p4~0); {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {9567#(= main_~p4~0 0)} assume !(0 != ~p8~0); {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {9567#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {9567#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {9567#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9567#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:07,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {9567#(= main_~p4~0 0)} assume 0 != ~p4~0; {9566#false} is VALID [2018-11-23 12:42:07,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {9566#false} assume 1 != ~lk4~0; {9566#false} is VALID [2018-11-23 12:42:07,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {9566#false} assume !false; {9566#false} is VALID [2018-11-23 12:42:07,684 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:07,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:07,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:07,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:07,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:07,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:07,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:07,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:07,734 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-11-23 12:42:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:08,698 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-11-23 12:42:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:08,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:42:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2018-11-23 12:42:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2018-11-23 12:42:08,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 218 transitions. [2018-11-23 12:42:08,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:08,961 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 12:42:08,961 INFO L226 Difference]: Without dead ends: 594 [2018-11-23 12:42:08,962 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:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-23 12:42:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-11-23 12:42:09,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:09,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand 592 states. [2018-11-23 12:42:09,062 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand 592 states. [2018-11-23 12:42:09,062 INFO L87 Difference]: Start difference. First operand 594 states. Second operand 592 states. [2018-11-23 12:42:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:09,082 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2018-11-23 12:42:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 999 transitions. [2018-11-23 12:42:09,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:09,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:09,084 INFO L74 IsIncluded]: Start isIncluded. First operand 592 states. Second operand 594 states. [2018-11-23 12:42:09,084 INFO L87 Difference]: Start difference. First operand 592 states. Second operand 594 states. [2018-11-23 12:42:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:09,102 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2018-11-23 12:42:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 999 transitions. [2018-11-23 12:42:09,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:09,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:09,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:09,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-23 12:42:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-11-23 12:42:09,123 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-11-23 12:42:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:09,123 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-11-23 12:42:09,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-11-23 12:42:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:09,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:09,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:09,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:09,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-11-23 12:42:09,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:09,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:09,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:09,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {12408#true} call ULTIMATE.init(); {12408#true} is VALID [2018-11-23 12:42:09,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {12408#true} assume true; {12408#true} is VALID [2018-11-23 12:42:09,365 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12408#true} {12408#true} #231#return; {12408#true} is VALID [2018-11-23 12:42:09,365 INFO L256 TraceCheckUtils]: 3: Hoare triple {12408#true} call #t~ret13 := main(); {12408#true} is VALID [2018-11-23 12:42:09,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {12408#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {12408#true} is VALID [2018-11-23 12:42:09,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {12408#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {12408#true} is VALID [2018-11-23 12:42:09,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {12408#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {12408#true} is VALID [2018-11-23 12:42:09,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {12408#true} assume !(0 != ~p1~0); {12408#true} is VALID [2018-11-23 12:42:09,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {12408#true} assume !(0 != ~p2~0); {12408#true} is VALID [2018-11-23 12:42:09,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {12408#true} assume !(0 != ~p3~0); {12408#true} is VALID [2018-11-23 12:42:09,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {12408#true} assume 0 != ~p4~0;~lk4~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {12410#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {12410#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {12410#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {12410#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {12410#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {12410#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:09,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {12410#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12409#false} is VALID [2018-11-23 12:42:09,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {12409#false} assume 0 != ~p5~0; {12409#false} is VALID [2018-11-23 12:42:09,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {12409#false} assume 1 != ~lk5~0; {12409#false} is VALID [2018-11-23 12:42:09,533 INFO L273 TraceCheckUtils]: 25: Hoare triple {12409#false} assume !false; {12409#false} is VALID [2018-11-23 12:42:09,534 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,534 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 26 [2018-11-23 12:42:09,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:09,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:09,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:09,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:09,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:09,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:09,689 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-11-23 12:42:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:09,924 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-11-23 12:42:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:09,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2018-11-23 12:42:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2018-11-23 12:42:09,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 213 transitions. [2018-11-23 12:42:10,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:10,123 INFO L225 Difference]: With dead ends: 888 [2018-11-23 12:42:10,123 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 12:42:10,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 12:42:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 12:42:10,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:10,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand 600 states. [2018-11-23 12:42:10,266 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand 600 states. [2018-11-23 12:42:10,266 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 600 states. [2018-11-23 12:42:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:10,284 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2018-11-23 12:42:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 999 transitions. [2018-11-23 12:42:10,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:10,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:10,286 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand 602 states. [2018-11-23 12:42:10,286 INFO L87 Difference]: Start difference. First operand 600 states. Second operand 602 states. [2018-11-23 12:42:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:10,305 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2018-11-23 12:42:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 999 transitions. [2018-11-23 12:42:10,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:10,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:10,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:10,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 12:42:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-11-23 12:42:10,327 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-11-23 12:42:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:10,327 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-11-23 12:42:10,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-11-23 12:42:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:10,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:10,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:10,328 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:10,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-11-23 12:42:10,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:10,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:10,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:10,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:10,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:10,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {15159#true} call ULTIMATE.init(); {15159#true} is VALID [2018-11-23 12:42:10,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {15159#true} assume true; {15159#true} is VALID [2018-11-23 12:42:10,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15159#true} {15159#true} #231#return; {15159#true} is VALID [2018-11-23 12:42:10,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {15159#true} call #t~ret13 := main(); {15159#true} is VALID [2018-11-23 12:42:10,429 INFO L273 TraceCheckUtils]: 4: Hoare triple {15159#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {15159#true} is VALID [2018-11-23 12:42:10,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {15159#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {15159#true} is VALID [2018-11-23 12:42:10,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {15159#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {15159#true} is VALID [2018-11-23 12:42:10,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {15159#true} assume !(0 != ~p1~0); {15159#true} is VALID [2018-11-23 12:42:10,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {15159#true} assume !(0 != ~p2~0); {15159#true} is VALID [2018-11-23 12:42:10,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {15159#true} assume !(0 != ~p3~0); {15159#true} is VALID [2018-11-23 12:42:10,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {15159#true} assume !(0 != ~p4~0); {15159#true} is VALID [2018-11-23 12:42:10,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {15159#true} assume 0 != ~p5~0;~lk5~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {15161#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {15161#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {15161#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {15161#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {15161#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {15161#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15161#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:10,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {15161#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15160#false} is VALID [2018-11-23 12:42:10,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {15160#false} assume !false; {15160#false} is VALID [2018-11-23 12:42:10,445 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:10,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:10,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:10,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:10,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:10,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:10,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:10,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:10,471 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-11-23 12:42:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:10,956 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-11-23 12:42:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:10,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:42:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:42:10,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 12:42:11,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:11,130 INFO L225 Difference]: With dead ends: 1100 [2018-11-23 12:42:11,130 INFO L226 Difference]: Without dead ends: 1098 [2018-11-23 12:42:11,130 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:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-11-23 12:42:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-11-23 12:42:11,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:11,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1098 states. Second operand 840 states. [2018-11-23 12:42:11,299 INFO L74 IsIncluded]: Start isIncluded. First operand 1098 states. Second operand 840 states. [2018-11-23 12:42:11,299 INFO L87 Difference]: Start difference. First operand 1098 states. Second operand 840 states. [2018-11-23 12:42:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:11,342 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2018-11-23 12:42:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1847 transitions. [2018-11-23 12:42:11,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:11,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:11,343 INFO L74 IsIncluded]: Start isIncluded. First operand 840 states. Second operand 1098 states. [2018-11-23 12:42:11,344 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 1098 states. [2018-11-23 12:42:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:11,387 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2018-11-23 12:42:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1847 transitions. [2018-11-23 12:42:11,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:11,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:11,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:11,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-23 12:42:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-11-23 12:42:11,414 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-11-23 12:42:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:11,414 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-11-23 12:42:11,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-11-23 12:42:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:42:11,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:11,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:11,415 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:11,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-11-23 12:42:11,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:11,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {19362#true} call ULTIMATE.init(); {19362#true} is VALID [2018-11-23 12:42:11,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {19362#true} assume true; {19362#true} is VALID [2018-11-23 12:42:11,620 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19362#true} {19362#true} #231#return; {19362#true} is VALID [2018-11-23 12:42:11,620 INFO L256 TraceCheckUtils]: 3: Hoare triple {19362#true} call #t~ret13 := main(); {19362#true} is VALID [2018-11-23 12:42:11,620 INFO L273 TraceCheckUtils]: 4: Hoare triple {19362#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {19362#true} is VALID [2018-11-23 12:42:11,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {19362#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {19362#true} is VALID [2018-11-23 12:42:11,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {19362#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {19362#true} is VALID [2018-11-23 12:42:11,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {19362#true} assume !(0 != ~p1~0); {19362#true} is VALID [2018-11-23 12:42:11,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {19362#true} assume !(0 != ~p2~0); {19362#true} is VALID [2018-11-23 12:42:11,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {19362#true} assume !(0 != ~p3~0); {19362#true} is VALID [2018-11-23 12:42:11,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {19362#true} assume !(0 != ~p4~0); {19362#true} is VALID [2018-11-23 12:42:11,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {19362#true} assume !(0 != ~p5~0); {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {19364#(= main_~p5~0 0)} assume !(0 != ~p8~0); {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {19364#(= main_~p5~0 0)} assume !(0 != ~p1~0); {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {19364#(= main_~p5~0 0)} assume !(0 != ~p2~0); {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {19364#(= main_~p5~0 0)} assume !(0 != ~p3~0); {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {19364#(= main_~p5~0 0)} assume !(0 != ~p4~0); {19364#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:11,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {19364#(= main_~p5~0 0)} assume 0 != ~p5~0; {19363#false} is VALID [2018-11-23 12:42:11,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {19363#false} assume 1 != ~lk5~0; {19363#false} is VALID [2018-11-23 12:42:11,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {19363#false} assume !false; {19363#false} is VALID [2018-11-23 12:42:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:11,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:11,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:11,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:11,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:11,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:11,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:11,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:11,757 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-11-23 12:42:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:12,697 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-11-23 12:42:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:12,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:42:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2018-11-23 12:42:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2018-11-23 12:42:12,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2018-11-23 12:42:12,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:12,974 INFO L225 Difference]: With dead ends: 1980 [2018-11-23 12:42:12,975 INFO L226 Difference]: Without dead ends: 1162 [2018-11-23 12:42:12,976 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:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-23 12:42:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-11-23 12:42:13,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:13,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1162 states. Second operand 1160 states. [2018-11-23 12:42:13,668 INFO L74 IsIncluded]: Start isIncluded. First operand 1162 states. Second operand 1160 states. [2018-11-23 12:42:13,668 INFO L87 Difference]: Start difference. First operand 1162 states. Second operand 1160 states. [2018-11-23 12:42:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:13,719 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2018-11-23 12:42:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1879 transitions. [2018-11-23 12:42:13,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:13,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:13,720 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1162 states. [2018-11-23 12:42:13,720 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1162 states. [2018-11-23 12:42:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:13,775 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2018-11-23 12:42:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1879 transitions. [2018-11-23 12:42:13,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:13,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:13,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:13,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 12:42:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-11-23 12:42:13,821 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-11-23 12:42:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:13,821 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-11-23 12:42:13,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-11-23 12:42:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:13,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:13,822 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:13,822 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:13,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-11-23 12:42:13,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:14,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {24925#true} call ULTIMATE.init(); {24925#true} is VALID [2018-11-23 12:42:14,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {24925#true} assume true; {24925#true} is VALID [2018-11-23 12:42:14,042 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24925#true} {24925#true} #231#return; {24925#true} is VALID [2018-11-23 12:42:14,042 INFO L256 TraceCheckUtils]: 3: Hoare triple {24925#true} call #t~ret13 := main(); {24925#true} is VALID [2018-11-23 12:42:14,042 INFO L273 TraceCheckUtils]: 4: Hoare triple {24925#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {24925#true} is VALID [2018-11-23 12:42:14,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {24925#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {24925#true} is VALID [2018-11-23 12:42:14,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {24925#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {24925#true} is VALID [2018-11-23 12:42:14,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {24925#true} assume !(0 != ~p1~0); {24925#true} is VALID [2018-11-23 12:42:14,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {24925#true} assume !(0 != ~p2~0); {24925#true} is VALID [2018-11-23 12:42:14,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {24925#true} assume !(0 != ~p3~0); {24925#true} is VALID [2018-11-23 12:42:14,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {24925#true} assume !(0 != ~p4~0); {24925#true} is VALID [2018-11-23 12:42:14,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {24925#true} assume 0 != ~p5~0;~lk5~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {24927#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {24927#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {24927#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {24927#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {24927#(not (= main_~p5~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {24927#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {24927#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {24927#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {24927#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {24927#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {24927#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {24927#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:14,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {24927#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24926#false} is VALID [2018-11-23 12:42:14,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {24926#false} assume 0 != ~p6~0; {24926#false} is VALID [2018-11-23 12:42:14,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {24926#false} assume 1 != ~lk6~0; {24926#false} is VALID [2018-11-23 12:42:14,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {24926#false} assume !false; {24926#false} is VALID [2018-11-23 12:42:14,147 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:14,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:14,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:14,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:14,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:14,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:14,172 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:14,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:14,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:14,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:14,174 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-11-23 12:42:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:14,632 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-11-23 12:42:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:14,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-23 12:42:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-23 12:42:14,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 210 transitions. [2018-11-23 12:42:14,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:14,881 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 12:42:14,881 INFO L226 Difference]: Without dead ends: 1178 [2018-11-23 12:42:14,882 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:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-23 12:42:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-11-23 12:42:15,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:15,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1178 states. Second operand 1176 states. [2018-11-23 12:42:15,422 INFO L74 IsIncluded]: Start isIncluded. First operand 1178 states. Second operand 1176 states. [2018-11-23 12:42:15,422 INFO L87 Difference]: Start difference. First operand 1178 states. Second operand 1176 states. [2018-11-23 12:42:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:15,476 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2018-11-23 12:42:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1879 transitions. [2018-11-23 12:42:15,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:15,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:15,478 INFO L74 IsIncluded]: Start isIncluded. First operand 1176 states. Second operand 1178 states. [2018-11-23 12:42:15,478 INFO L87 Difference]: Start difference. First operand 1176 states. Second operand 1178 states. [2018-11-23 12:42:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:15,539 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2018-11-23 12:42:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1879 transitions. [2018-11-23 12:42:15,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:15,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:15,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:15,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-23 12:42:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-11-23 12:42:15,595 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-11-23 12:42:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:15,595 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-11-23 12:42:15,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-11-23 12:42:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:15,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:15,597 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:15,597 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:15,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-11-23 12:42:15,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:15,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:15,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {30296#true} call ULTIMATE.init(); {30296#true} is VALID [2018-11-23 12:42:15,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {30296#true} assume true; {30296#true} is VALID [2018-11-23 12:42:15,667 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30296#true} {30296#true} #231#return; {30296#true} is VALID [2018-11-23 12:42:15,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {30296#true} call #t~ret13 := main(); {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 4: Hoare triple {30296#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {30296#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {30296#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {30296#true} assume !(0 != ~p1~0); {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {30296#true} assume !(0 != ~p2~0); {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {30296#true} assume !(0 != ~p3~0); {30296#true} is VALID [2018-11-23 12:42:15,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {30296#true} assume !(0 != ~p4~0); {30296#true} is VALID [2018-11-23 12:42:15,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {30296#true} assume !(0 != ~p5~0); {30296#true} is VALID [2018-11-23 12:42:15,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {30296#true} assume 0 != ~p6~0;~lk6~0 := 1; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {30298#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {30298#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {30298#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {30298#(= main_~lk6~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {30298#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {30298#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {30298#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {30298#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {30298#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {30298#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {30298#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(= main_~lk6~0 1)} assume 0 != ~p6~0; {30298#(= main_~lk6~0 1)} is VALID [2018-11-23 12:42:15,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {30298#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {30297#false} is VALID [2018-11-23 12:42:15,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {30297#false} assume !false; {30297#false} is VALID [2018-11-23 12:42:15,687 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:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:15,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:15,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:15,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:15,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:15,714 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:15,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:15,715 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-11-23 12:42:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:16,532 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-11-23 12:42:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:16,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:42:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:42:16,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 12:42:16,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:16,822 INFO L225 Difference]: With dead ends: 2124 [2018-11-23 12:42:16,823 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 12:42:16,824 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:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 12:42:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-11-23 12:42:17,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:17,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 1672 states. [2018-11-23 12:42:17,166 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 1672 states. [2018-11-23 12:42:17,166 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 1672 states. [2018-11-23 12:42:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:17,308 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2018-11-23 12:42:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3431 transitions. [2018-11-23 12:42:17,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:17,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:17,310 INFO L74 IsIncluded]: Start isIncluded. First operand 1672 states. Second operand 2122 states. [2018-11-23 12:42:17,310 INFO L87 Difference]: Start difference. First operand 1672 states. Second operand 2122 states. [2018-11-23 12:42:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:17,461 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2018-11-23 12:42:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3431 transitions. [2018-11-23 12:42:17,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:17,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:17,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:17,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-11-23 12:42:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-11-23 12:42:17,560 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-11-23 12:42:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:17,560 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-11-23 12:42:17,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-11-23 12:42:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:42:17,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:17,562 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:17,562 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:17,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-11-23 12:42:17,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:17,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {38451#true} call ULTIMATE.init(); {38451#true} is VALID [2018-11-23 12:42:17,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {38451#true} assume true; {38451#true} is VALID [2018-11-23 12:42:17,732 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38451#true} {38451#true} #231#return; {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L256 TraceCheckUtils]: 3: Hoare triple {38451#true} call #t~ret13 := main(); {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 4: Hoare triple {38451#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {38451#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {38451#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {38451#true} assume !(0 != ~p1~0); {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {38451#true} assume !(0 != ~p2~0); {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {38451#true} assume !(0 != ~p3~0); {38451#true} is VALID [2018-11-23 12:42:17,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {38451#true} assume !(0 != ~p4~0); {38451#true} is VALID [2018-11-23 12:42:17,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {38451#true} assume !(0 != ~p5~0); {38451#true} is VALID [2018-11-23 12:42:17,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {38451#true} assume !(0 != ~p6~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {38453#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {38453#(= main_~p6~0 0)} assume !(0 != ~p8~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {38453#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {38453#(= main_~p6~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {38453#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {38453#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {38453#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {38453#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {38453#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {38453#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {38453#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38453#(= main_~p6~0 0)} is VALID [2018-11-23 12:42:17,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {38453#(= main_~p6~0 0)} assume 0 != ~p6~0; {38452#false} is VALID [2018-11-23 12:42:17,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {38452#false} assume 1 != ~lk6~0; {38452#false} is VALID [2018-11-23 12:42:17,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {38452#false} assume !false; {38452#false} is VALID [2018-11-23 12:42:17,742 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:17,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:17,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:17,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:17,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:17,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:17,764 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:17,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:17,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:17,765 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-11-23 12:42:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:19,157 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-11-23 12:42:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:19,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:42:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-23 12:42:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-23 12:42:19,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 212 transitions. [2018-11-23 12:42:19,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:19,572 INFO L225 Difference]: With dead ends: 3916 [2018-11-23 12:42:19,572 INFO L226 Difference]: Without dead ends: 2282 [2018-11-23 12:42:19,575 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:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-11-23 12:42:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-11-23 12:42:20,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:20,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2282 states. Second operand 2280 states. [2018-11-23 12:42:20,168 INFO L74 IsIncluded]: Start isIncluded. First operand 2282 states. Second operand 2280 states. [2018-11-23 12:42:20,168 INFO L87 Difference]: Start difference. First operand 2282 states. Second operand 2280 states. [2018-11-23 12:42:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:20,316 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2018-11-23 12:42:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3527 transitions. [2018-11-23 12:42:20,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:20,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:20,319 INFO L74 IsIncluded]: Start isIncluded. First operand 2280 states. Second operand 2282 states. [2018-11-23 12:42:20,319 INFO L87 Difference]: Start difference. First operand 2280 states. Second operand 2282 states. [2018-11-23 12:42:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:20,481 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2018-11-23 12:42:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3527 transitions. [2018-11-23 12:42:20,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:20,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:20,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:20,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-23 12:42:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-11-23 12:42:20,654 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-11-23 12:42:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:20,654 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-11-23 12:42:20,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-11-23 12:42:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:20,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:20,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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:20,656 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:20,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-11-23 12:42:20,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:20,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:20,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {49390#true} call ULTIMATE.init(); {49390#true} is VALID [2018-11-23 12:42:20,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {49390#true} assume true; {49390#true} is VALID [2018-11-23 12:42:20,709 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {49390#true} {49390#true} #231#return; {49390#true} is VALID [2018-11-23 12:42:20,709 INFO L256 TraceCheckUtils]: 3: Hoare triple {49390#true} call #t~ret13 := main(); {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 4: Hoare triple {49390#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {49390#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {49390#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {49390#true} assume !(0 != ~p1~0); {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {49390#true} assume !(0 != ~p2~0); {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {49390#true} assume !(0 != ~p3~0); {49390#true} is VALID [2018-11-23 12:42:20,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {49390#true} assume !(0 != ~p4~0); {49390#true} is VALID [2018-11-23 12:42:20,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {49390#true} assume !(0 != ~p5~0); {49390#true} is VALID [2018-11-23 12:42:20,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {49390#true} assume 0 != ~p6~0;~lk6~0 := 1; {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {49392#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {49392#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {49392#(not (= main_~p6~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {49392#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {49392#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {49392#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:42:20,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {49392#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {49391#false} is VALID [2018-11-23 12:42:20,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {49391#false} assume 0 != ~p7~0; {49391#false} is VALID [2018-11-23 12:42:20,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {49391#false} assume 1 != ~lk7~0; {49391#false} is VALID [2018-11-23 12:42:20,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {49391#false} assume !false; {49391#false} is VALID [2018-11-23 12:42:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:20,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:20,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:20,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:20,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:20,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:20,753 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:20,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:20,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:20,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:20,754 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-11-23 12:42:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:22,410 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-11-23 12:42:22,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:22,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 12:42:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 12:42:22,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2018-11-23 12:42:22,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:22,895 INFO L225 Difference]: With dead ends: 3420 [2018-11-23 12:42:22,895 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 12:42:22,897 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:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 12:42:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-11-23 12:42:23,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:23,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2314 states. Second operand 2312 states. [2018-11-23 12:42:23,554 INFO L74 IsIncluded]: Start isIncluded. First operand 2314 states. Second operand 2312 states. [2018-11-23 12:42:23,554 INFO L87 Difference]: Start difference. First operand 2314 states. Second operand 2312 states. [2018-11-23 12:42:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:23,706 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2018-11-23 12:42:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3527 transitions. [2018-11-23 12:42:23,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:23,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:23,708 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2314 states. [2018-11-23 12:42:23,708 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2314 states. [2018-11-23 12:42:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:23,867 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2018-11-23 12:42:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3527 transitions. [2018-11-23 12:42:23,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:23,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:23,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:23,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 12:42:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-11-23 12:42:24,063 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-11-23 12:42:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:24,063 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-11-23 12:42:24,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-11-23 12:42:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:24,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:24,066 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:24,066 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:24,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-11-23 12:42:24,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:24,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:24,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:24,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:24,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:24,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {59929#true} call ULTIMATE.init(); {59929#true} is VALID [2018-11-23 12:42:24,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {59929#true} assume true; {59929#true} is VALID [2018-11-23 12:42:24,103 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {59929#true} {59929#true} #231#return; {59929#true} is VALID [2018-11-23 12:42:24,103 INFO L256 TraceCheckUtils]: 3: Hoare triple {59929#true} call #t~ret13 := main(); {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 4: Hoare triple {59929#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {59929#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {59929#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {59929#true} assume !(0 != ~p1~0); {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {59929#true} assume !(0 != ~p2~0); {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {59929#true} assume !(0 != ~p3~0); {59929#true} is VALID [2018-11-23 12:42:24,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {59929#true} assume !(0 != ~p4~0); {59929#true} is VALID [2018-11-23 12:42:24,105 INFO L273 TraceCheckUtils]: 11: Hoare triple {59929#true} assume !(0 != ~p5~0); {59929#true} is VALID [2018-11-23 12:42:24,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {59929#true} assume !(0 != ~p6~0); {59929#true} is VALID [2018-11-23 12:42:24,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {59929#true} assume 0 != ~p7~0;~lk7~0 := 1; {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {59931#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {59931#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {59931#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {59931#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,121 INFO L273 TraceCheckUtils]: 23: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {59931#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {59931#(= main_~lk7~0 1)} assume 0 != ~p7~0; {59931#(= main_~lk7~0 1)} is VALID [2018-11-23 12:42:24,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {59931#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {59930#false} is VALID [2018-11-23 12:42:24,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {59930#false} assume !false; {59930#false} is VALID [2018-11-23 12:42:24,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:42:24,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:24,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:24,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:24,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:24,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:24,161 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:24,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:24,162 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-11-23 12:42:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:25,774 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-11-23 12:42:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:25,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 12:42:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 12:42:25,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2018-11-23 12:42:25,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:26,629 INFO L225 Difference]: With dead ends: 4108 [2018-11-23 12:42:26,629 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 12:42:26,631 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:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 12:42:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-11-23 12:42:27,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:27,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 3336 states. [2018-11-23 12:42:27,309 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 3336 states. [2018-11-23 12:42:27,309 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 3336 states. [2018-11-23 12:42:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:27,915 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2018-11-23 12:42:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 6343 transitions. [2018-11-23 12:42:27,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:27,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:27,920 INFO L74 IsIncluded]: Start isIncluded. First operand 3336 states. Second operand 4106 states. [2018-11-23 12:42:27,920 INFO L87 Difference]: Start difference. First operand 3336 states. Second operand 4106 states. [2018-11-23 12:42:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:28,546 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2018-11-23 12:42:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 6343 transitions. [2018-11-23 12:42:28,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:28,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:28,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:28,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-23 12:42:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-11-23 12:42:29,011 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-11-23 12:42:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:29,012 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-11-23 12:42:29,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-11-23 12:42:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:42:29,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:29,015 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:29,015 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:29,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-11-23 12:42:29,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:29,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:29,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:29,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:29,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {75796#true} call ULTIMATE.init(); {75796#true} is VALID [2018-11-23 12:42:29,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {75796#true} assume true; {75796#true} is VALID [2018-11-23 12:42:29,051 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {75796#true} {75796#true} #231#return; {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L256 TraceCheckUtils]: 3: Hoare triple {75796#true} call #t~ret13 := main(); {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 4: Hoare triple {75796#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {75796#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {75796#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {75796#true} assume !(0 != ~p1~0); {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {75796#true} assume !(0 != ~p2~0); {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {75796#true} assume !(0 != ~p3~0); {75796#true} is VALID [2018-11-23 12:42:29,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {75796#true} assume !(0 != ~p4~0); {75796#true} is VALID [2018-11-23 12:42:29,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {75796#true} assume !(0 != ~p5~0); {75796#true} is VALID [2018-11-23 12:42:29,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {75796#true} assume !(0 != ~p6~0); {75796#true} is VALID [2018-11-23 12:42:29,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {75796#true} assume !(0 != ~p7~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p8~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {75798#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {75798#(= main_~p7~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {75798#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {75798#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {75798#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75798#(= main_~p7~0 0)} is VALID [2018-11-23 12:42:29,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {75798#(= main_~p7~0 0)} assume 0 != ~p7~0; {75797#false} is VALID [2018-11-23 12:42:29,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {75797#false} assume 1 != ~lk7~0; {75797#false} is VALID [2018-11-23 12:42:29,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {75797#false} assume !false; {75797#false} is VALID [2018-11-23 12:42:29,069 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:29,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:29,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:29,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:29,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:29,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:29,105 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:29,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:29,105 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-11-23 12:42:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:33,240 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-11-23 12:42:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:33,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 12:42:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 12:42:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 12:42:33,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2018-11-23 12:42:33,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:34,394 INFO L225 Difference]: With dead ends: 7756 [2018-11-23 12:42:34,394 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 12:42:34,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 12:42:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-11-23 12:42:35,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:35,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4490 states. Second operand 4488 states. [2018-11-23 12:42:35,724 INFO L74 IsIncluded]: Start isIncluded. First operand 4490 states. Second operand 4488 states. [2018-11-23 12:42:35,724 INFO L87 Difference]: Start difference. First operand 4490 states. Second operand 4488 states. [2018-11-23 12:42:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:36,453 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2018-11-23 12:42:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6599 transitions. [2018-11-23 12:42:36,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:36,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:36,458 INFO L74 IsIncluded]: Start isIncluded. First operand 4488 states. Second operand 4490 states. [2018-11-23 12:42:36,458 INFO L87 Difference]: Start difference. First operand 4488 states. Second operand 4490 states. [2018-11-23 12:42:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:37,211 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2018-11-23 12:42:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6599 transitions. [2018-11-23 12:42:37,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:37,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:37,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:37,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-11-23 12:42:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-11-23 12:42:38,043 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-11-23 12:42:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:38,043 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-11-23 12:42:38,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-11-23 12:42:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:38,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:38,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:38,046 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:38,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-11-23 12:42:38,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:38,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:38,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:38,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:38,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:38,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {97359#true} call ULTIMATE.init(); {97359#true} is VALID [2018-11-23 12:42:38,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {97359#true} assume true; {97359#true} is VALID [2018-11-23 12:42:38,097 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {97359#true} {97359#true} #231#return; {97359#true} is VALID [2018-11-23 12:42:38,098 INFO L256 TraceCheckUtils]: 3: Hoare triple {97359#true} call #t~ret13 := main(); {97359#true} is VALID [2018-11-23 12:42:38,098 INFO L273 TraceCheckUtils]: 4: Hoare triple {97359#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {97359#true} is VALID [2018-11-23 12:42:38,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {97359#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {97359#true} is VALID [2018-11-23 12:42:38,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {97359#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {97359#true} is VALID [2018-11-23 12:42:38,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {97359#true} assume !(0 != ~p1~0); {97359#true} is VALID [2018-11-23 12:42:38,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {97359#true} assume !(0 != ~p2~0); {97359#true} is VALID [2018-11-23 12:42:38,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {97359#true} assume !(0 != ~p3~0); {97359#true} is VALID [2018-11-23 12:42:38,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {97359#true} assume !(0 != ~p4~0); {97359#true} is VALID [2018-11-23 12:42:38,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {97359#true} assume !(0 != ~p5~0); {97359#true} is VALID [2018-11-23 12:42:38,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {97359#true} assume !(0 != ~p6~0); {97359#true} is VALID [2018-11-23 12:42:38,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {97359#true} assume 0 != ~p7~0;~lk7~0 := 1; {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {97361#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {97361#(not (= main_~p7~0 0))} assume 0 != ~p10~0;~lk10~0 := 1; {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {97361#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {97361#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {97361#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:42:38,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {97361#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {97360#false} is VALID [2018-11-23 12:42:38,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {97360#false} assume 0 != ~p8~0; {97360#false} is VALID [2018-11-23 12:42:38,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {97360#false} assume 1 != ~lk8~0; {97360#false} is VALID [2018-11-23 12:42:38,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {97360#false} assume !false; {97360#false} is VALID [2018-11-23 12:42:38,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:42:38,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:38,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:38,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:38,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:38,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:38,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:38,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:38,150 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-11-23 12:42:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:41,333 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-11-23 12:42:41,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:41,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 12:42:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 12:42:41,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2018-11-23 12:42:41,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:42,524 INFO L225 Difference]: With dead ends: 6732 [2018-11-23 12:42:42,524 INFO L226 Difference]: Without dead ends: 4554 [2018-11-23 12:42:42,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-23 12:42:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-11-23 12:42:44,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:44,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4554 states. Second operand 4552 states. [2018-11-23 12:42:44,499 INFO L74 IsIncluded]: Start isIncluded. First operand 4554 states. Second operand 4552 states. [2018-11-23 12:42:44,499 INFO L87 Difference]: Start difference. First operand 4554 states. Second operand 4552 states. [2018-11-23 12:42:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,243 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2018-11-23 12:42:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6599 transitions. [2018-11-23 12:42:45,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,248 INFO L74 IsIncluded]: Start isIncluded. First operand 4552 states. Second operand 4554 states. [2018-11-23 12:42:45,248 INFO L87 Difference]: Start difference. First operand 4552 states. Second operand 4554 states. [2018-11-23 12:42:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,027 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2018-11-23 12:42:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6599 transitions. [2018-11-23 12:42:46,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:46,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-11-23 12:42:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-11-23 12:42:46,884 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-11-23 12:42:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:46,884 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-11-23 12:42:46,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-11-23 12:42:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:42:46,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:46,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:46,886 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:46,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-11-23 12:42:46,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:46,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:46,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {118090#true} call ULTIMATE.init(); {118090#true} is VALID [2018-11-23 12:42:46,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {118090#true} assume true; {118090#true} is VALID [2018-11-23 12:42:46,956 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {118090#true} {118090#true} #231#return; {118090#true} is VALID [2018-11-23 12:42:46,956 INFO L256 TraceCheckUtils]: 3: Hoare triple {118090#true} call #t~ret13 := main(); {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 4: Hoare triple {118090#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {118090#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {118090#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {118090#true} assume !(0 != ~p1~0); {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {118090#true} assume !(0 != ~p2~0); {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {118090#true} assume !(0 != ~p3~0); {118090#true} is VALID [2018-11-23 12:42:46,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {118090#true} assume !(0 != ~p4~0); {118090#true} is VALID [2018-11-23 12:42:46,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {118090#true} assume !(0 != ~p5~0); {118090#true} is VALID [2018-11-23 12:42:46,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {118090#true} assume !(0 != ~p6~0); {118090#true} is VALID [2018-11-23 12:42:46,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {118090#true} assume !(0 != ~p7~0); {118090#true} is VALID [2018-11-23 12:42:46,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {118090#true} assume !(0 != ~p8~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {118092#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {118092#(= main_~p8~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {118092#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {118092#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p1~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p2~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p3~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p4~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p5~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p6~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {118092#(= main_~p8~0 0)} assume !(0 != ~p7~0); {118092#(= main_~p8~0 0)} is VALID [2018-11-23 12:42:46,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {118092#(= main_~p8~0 0)} assume 0 != ~p8~0; {118091#false} is VALID [2018-11-23 12:42:46,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {118091#false} assume 1 != ~lk8~0; {118091#false} is VALID [2018-11-23 12:42:46,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {118091#false} assume !false; {118091#false} is VALID [2018-11-23 12:42:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:42:46,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:46,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,995 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-11-23 12:42:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,261 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-11-23 12:42:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:57,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:42:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 12:42:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 12:42:57,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2018-11-23 12:42:57,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:00,377 INFO L225 Difference]: With dead ends: 13260 [2018-11-23 12:43:00,377 INFO L226 Difference]: Without dead ends: 8842 [2018-11-23 12:43:00,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-11-23 12:43:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-11-23 12:43:03,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:03,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8842 states. Second operand 8840 states. [2018-11-23 12:43:03,955 INFO L74 IsIncluded]: Start isIncluded. First operand 8842 states. Second operand 8840 states. [2018-11-23 12:43:03,955 INFO L87 Difference]: Start difference. First operand 8842 states. Second operand 8840 states. [2018-11-23 12:43:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,856 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2018-11-23 12:43:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 12423 transitions. [2018-11-23 12:43:06,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,862 INFO L74 IsIncluded]: Start isIncluded. First operand 8840 states. Second operand 8842 states. [2018-11-23 12:43:06,862 INFO L87 Difference]: Start difference. First operand 8840 states. Second operand 8842 states. [2018-11-23 12:43:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,826 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2018-11-23 12:43:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 12423 transitions. [2018-11-23 12:43:09,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:09,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:09,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:09,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-23 12:43:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-11-23 12:43:13,137 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-11-23 12:43:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:13,137 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-11-23 12:43:13,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-11-23 12:43:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:43:13,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:13,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:13,140 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:13,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:13,140 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-11-23 12:43:13,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:13,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:13,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:13,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {158533#true} call ULTIMATE.init(); {158533#true} is VALID [2018-11-23 12:43:13,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {158533#true} assume true; {158533#true} is VALID [2018-11-23 12:43:13,191 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {158533#true} {158533#true} #231#return; {158533#true} is VALID [2018-11-23 12:43:13,191 INFO L256 TraceCheckUtils]: 3: Hoare triple {158533#true} call #t~ret13 := main(); {158533#true} is VALID [2018-11-23 12:43:13,191 INFO L273 TraceCheckUtils]: 4: Hoare triple {158533#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {158533#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {158533#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {158533#true} assume !(0 != ~p1~0); {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {158533#true} assume !(0 != ~p2~0); {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {158533#true} assume !(0 != ~p3~0); {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {158533#true} assume !(0 != ~p4~0); {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {158533#true} assume !(0 != ~p5~0); {158533#true} is VALID [2018-11-23 12:43:13,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {158533#true} assume !(0 != ~p6~0); {158533#true} is VALID [2018-11-23 12:43:13,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {158533#true} assume !(0 != ~p7~0); {158533#true} is VALID [2018-11-23 12:43:13,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {158533#true} assume 0 != ~p8~0;~lk8~0 := 1; {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {158535#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {158535#(= main_~lk8~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {158535#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {158535#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {158535#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {158535#(= main_~lk8~0 1)} assume 0 != ~p8~0; {158535#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:13,209 INFO L273 TraceCheckUtils]: 27: Hoare triple {158535#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {158534#false} is VALID [2018-11-23 12:43:13,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {158534#false} assume !false; {158534#false} is VALID [2018-11-23 12:43:13,209 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:13,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:13,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:13,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:43:13,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:13,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:13,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:13,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:13,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:13,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:13,234 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-11-23 12:43:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,839 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-11-23 12:43:21,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 12:43:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 12:43:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 12:43:21,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2018-11-23 12:43:21,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:26,305 INFO L225 Difference]: With dead ends: 10124 [2018-11-23 12:43:26,305 INFO L226 Difference]: Without dead ends: 10122 [2018-11-23 12:43:26,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-11-23 12:43:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-11-23 12:43:31,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:31,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10122 states. Second operand 8840 states. [2018-11-23 12:43:31,934 INFO L74 IsIncluded]: Start isIncluded. First operand 10122 states. Second operand 8840 states. [2018-11-23 12:43:31,934 INFO L87 Difference]: Start difference. First operand 10122 states. Second operand 8840 states. [2018-11-23 12:43:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:35,143 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2018-11-23 12:43:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10122 states and 14599 transitions. [2018-11-23 12:43:35,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:35,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:35,152 INFO L74 IsIncluded]: Start isIncluded. First operand 8840 states. Second operand 10122 states. [2018-11-23 12:43:35,153 INFO L87 Difference]: Start difference. First operand 8840 states. Second operand 10122 states. [2018-11-23 12:43:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:39,109 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2018-11-23 12:43:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10122 states and 14599 transitions. [2018-11-23 12:43:39,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:39,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:39,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:39,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-23 12:43:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-11-23 12:43:41,944 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-11-23 12:43:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:41,945 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-11-23 12:43:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-11-23 12:43:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:43:41,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:41,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:41,950 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:41,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-11-23 12:43:41,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:42,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {198400#true} call ULTIMATE.init(); {198400#true} is VALID [2018-11-23 12:43:42,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {198400#true} assume true; {198400#true} is VALID [2018-11-23 12:43:42,177 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {198400#true} {198400#true} #231#return; {198400#true} is VALID [2018-11-23 12:43:42,177 INFO L256 TraceCheckUtils]: 3: Hoare triple {198400#true} call #t~ret13 := main(); {198400#true} is VALID [2018-11-23 12:43:42,177 INFO L273 TraceCheckUtils]: 4: Hoare triple {198400#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {198400#true} is VALID [2018-11-23 12:43:42,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {198400#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {198400#true} is VALID [2018-11-23 12:43:42,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {198400#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {198400#true} is VALID [2018-11-23 12:43:42,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {198400#true} assume !(0 != ~p1~0); {198400#true} is VALID [2018-11-23 12:43:42,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {198400#true} assume !(0 != ~p2~0); {198400#true} is VALID [2018-11-23 12:43:42,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {198400#true} assume !(0 != ~p3~0); {198400#true} is VALID [2018-11-23 12:43:42,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {198400#true} assume !(0 != ~p4~0); {198400#true} is VALID [2018-11-23 12:43:42,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {198400#true} assume !(0 != ~p5~0); {198400#true} is VALID [2018-11-23 12:43:42,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {198400#true} assume !(0 != ~p6~0); {198400#true} is VALID [2018-11-23 12:43:42,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {198400#true} assume !(0 != ~p7~0); {198400#true} is VALID [2018-11-23 12:43:42,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {198400#true} assume !(0 != ~p8~0); {198400#true} is VALID [2018-11-23 12:43:42,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {198400#true} assume 0 != ~p9~0;~lk9~0 := 1; {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {198402#(= main_~lk9~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {198402#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {198402#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {198402#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {198402#(= main_~lk9~0 1)} assume 0 != ~p9~0; {198402#(= main_~lk9~0 1)} is VALID [2018-11-23 12:43:42,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {198402#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {198401#false} is VALID [2018-11-23 12:43:42,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {198401#false} assume !false; {198401#false} is VALID [2018-11-23 12:43:42,358 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:42,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:42,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:42,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:42,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:42,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:42,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:42,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:42,573 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-11-23 12:43:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:59,660 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-11-23 12:43:59,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:59,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:43:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:43:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:43:59,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 12:43:59,807 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:44:10,593 INFO L225 Difference]: With dead ends: 15244 [2018-11-23 12:44:10,594 INFO L226 Difference]: Without dead ends: 15242 [2018-11-23 12:44:10,597 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:44:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-11-23 12:44:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-11-23 12:44:14,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:14,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15242 states. Second operand 13192 states. [2018-11-23 12:44:14,095 INFO L74 IsIncluded]: Start isIncluded. First operand 15242 states. Second operand 13192 states. [2018-11-23 12:44:14,095 INFO L87 Difference]: Start difference. First operand 15242 states. Second operand 13192 states. [2018-11-23 12:44:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:23,597 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2018-11-23 12:44:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 21383 transitions. [2018-11-23 12:44:23,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:23,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:23,607 INFO L74 IsIncluded]: Start isIncluded. First operand 13192 states. Second operand 15242 states. [2018-11-23 12:44:23,608 INFO L87 Difference]: Start difference. First operand 13192 states. Second operand 15242 states. [2018-11-23 12:44:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:33,866 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2018-11-23 12:44:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 21383 transitions. [2018-11-23 12:44:33,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:33,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:33,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:33,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-11-23 12:44:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-11-23 12:44:42,702 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-11-23 12:44:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:42,702 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-11-23 12:44:42,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-11-23 12:44:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:44:42,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:42,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:44:42,709 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:42,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-11-23 12:44:42,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:42,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:42,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:42,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {258107#true} call ULTIMATE.init(); {258107#true} is VALID [2018-11-23 12:44:42,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {258107#true} assume true; {258107#true} is VALID [2018-11-23 12:44:42,838 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {258107#true} {258107#true} #231#return; {258107#true} is VALID [2018-11-23 12:44:42,838 INFO L256 TraceCheckUtils]: 3: Hoare triple {258107#true} call #t~ret13 := main(); {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 4: Hoare triple {258107#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {258107#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {258107#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {258107#true} assume !(0 != ~p1~0); {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {258107#true} assume !(0 != ~p2~0); {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {258107#true} assume !(0 != ~p3~0); {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {258107#true} assume !(0 != ~p4~0); {258107#true} is VALID [2018-11-23 12:44:42,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {258107#true} assume !(0 != ~p5~0); {258107#true} is VALID [2018-11-23 12:44:42,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {258107#true} assume !(0 != ~p6~0); {258107#true} is VALID [2018-11-23 12:44:42,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {258107#true} assume !(0 != ~p7~0); {258107#true} is VALID [2018-11-23 12:44:42,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {258107#true} assume !(0 != ~p8~0); {258107#true} is VALID [2018-11-23 12:44:42,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {258107#true} assume !(0 != ~p9~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {258109#(= main_~p9~0 0)} assume 0 != ~p10~0;~lk10~0 := 1; {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,843 INFO L273 TraceCheckUtils]: 17: Hoare triple {258109#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {258109#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p1~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p2~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p3~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p4~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p5~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p6~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p7~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {258109#(= main_~p9~0 0)} assume !(0 != ~p8~0); {258109#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:42,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {258109#(= main_~p9~0 0)} assume 0 != ~p9~0; {258108#false} is VALID [2018-11-23 12:44:42,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {258108#false} assume 1 != ~lk9~0; {258108#false} is VALID [2018-11-23 12:44:42,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {258108#false} assume !false; {258108#false} is VALID [2018-11-23 12:44:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:44:42,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:42,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:42,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:44:42,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:42,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:42,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:42,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:42,878 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states.