/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:30:54,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:30:54,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:30:54,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:30:54,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:30:54,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:30:54,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:30:54,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:30:54,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:30:54,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:30:54,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:30:54,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:30:54,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:30:54,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:30:54,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:30:54,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:30:54,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:30:54,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:30:54,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:30:54,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:30:54,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:30:54,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:30:54,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:30:54,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:30:54,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:30:54,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:30:54,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:30:54,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:30:54,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:30:54,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:30:54,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:30:54,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:30:54,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:30:54,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:30:54,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:30:54,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:30:54,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:30:54,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:30:54,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:30:54,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:30:54,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:30:54,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:30:54,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:30:54,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:30:54,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:30:54,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:30:54,362 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:30:54,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:30:54,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:30:54,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:30:54,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:30:54,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:30:54,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:30:54,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:30:54,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:30:54,363 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:30:54,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:30:54,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:30:54,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:30:54,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:30:54,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:30:54,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:30:54,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:30:54,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:30:54,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:30:54,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:30:54,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:30:54,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:30:54,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:30:54,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:30:54,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:30:54,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:30:54,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:30:54,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:30:54,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:30:54,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:30:54,651 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:30:54,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:30:54,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79bd81b5/c1f47d9f19ba42abbb25e8e9d6f33177/FLAGaa21c5f66 [2019-11-23 22:30:55,209 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:30:55,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:30:55,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79bd81b5/c1f47d9f19ba42abbb25e8e9d6f33177/FLAGaa21c5f66 [2019-11-23 22:30:55,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79bd81b5/c1f47d9f19ba42abbb25e8e9d6f33177 [2019-11-23 22:30:55,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:30:55,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:30:55,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:30:55,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:30:55,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:30:55,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:30:55" (1/1) ... [2019-11-23 22:30:55,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ba6ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:55, skipping insertion in model container [2019-11-23 22:30:55,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:30:55" (1/1) ... [2019-11-23 22:30:55,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:30:55,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:30:56,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:30:56,114 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:30:56,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:30:56,260 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:30:56,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56 WrapperNode [2019-11-23 22:30:56,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:30:56,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:30:56,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:30:56,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:30:56,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:30:56,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:30:56,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:30:56,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:30:56,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (1/1) ... [2019-11-23 22:30:56,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:30:56,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:30:56,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:30:56,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:30:56,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (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 [2019-11-23 22:30:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:30:56,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:30:57,604 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:30:57,604 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:30:57,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:30:57 BoogieIcfgContainer [2019-11-23 22:30:57,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:30:57,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:30:57,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:30:57,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:30:57,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:30:55" (1/3) ... [2019-11-23 22:30:57,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a8fb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:30:57, skipping insertion in model container [2019-11-23 22:30:57,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:56" (2/3) ... [2019-11-23 22:30:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a8fb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:30:57, skipping insertion in model container [2019-11-23 22:30:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:30:57" (3/3) ... [2019-11-23 22:30:57,615 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:30:57,623 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:30:57,629 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:30:57,639 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:30:57,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:30:57,666 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:30:57,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:30:57,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:30:57,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:30:57,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:30:57,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:30:57,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:30:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-11-23 22:30:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:30:57,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:30:57,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:30:57,701 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:30:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:30:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1885524630, now seen corresponding path program 1 times [2019-11-23 22:30:57,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:30:57,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44053425] [2019-11-23 22:30:57,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:30:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:30:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:30:58,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44053425] [2019-11-23 22:30:58,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:30:58,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:30:58,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819550710] [2019-11-23 22:30:58,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:30:58,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:30:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:30:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:30:58,185 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-11-23 22:30:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:30:58,347 INFO L93 Difference]: Finished difference Result 452 states and 785 transitions. [2019-11-23 22:30:58,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:30:58,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-23 22:30:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:30:58,375 INFO L225 Difference]: With dead ends: 452 [2019-11-23 22:30:58,375 INFO L226 Difference]: Without dead ends: 334 [2019-11-23 22:30:58,379 INFO L630 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 [2019-11-23 22:30:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-23 22:30:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-11-23 22:30:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-23 22:30:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2019-11-23 22:30:58,448 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 95 [2019-11-23 22:30:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:30:58,449 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2019-11-23 22:30:58,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:30:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2019-11-23 22:30:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:30:58,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:30:58,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:30:58,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:30:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:30:58,454 INFO L82 PathProgramCache]: Analyzing trace with hash -614138391, now seen corresponding path program 1 times [2019-11-23 22:30:58,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:30:58,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270162498] [2019-11-23 22:30:58,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:30:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:30:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:30:58,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270162498] [2019-11-23 22:30:58,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:30:58,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:30:58,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707762679] [2019-11-23 22:30:58,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:30:58,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:30:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:30:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:30:58,766 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 4 states. [2019-11-23 22:30:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:30:58,920 INFO L93 Difference]: Finished difference Result 965 states and 1470 transitions. [2019-11-23 22:30:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:30:58,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-23 22:30:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:30:58,927 INFO L225 Difference]: With dead ends: 965 [2019-11-23 22:30:58,927 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 22:30:58,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:30:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 22:30:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-11-23 22:30:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-23 22:30:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 968 transitions. [2019-11-23 22:30:59,041 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 968 transitions. Word has length 95 [2019-11-23 22:30:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:30:59,043 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 968 transitions. [2019-11-23 22:30:59,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:30:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 968 transitions. [2019-11-23 22:30:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 22:30:59,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:30:59,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:30:59,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:30:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:30:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash -779319531, now seen corresponding path program 1 times [2019-11-23 22:30:59,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:30:59,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848464875] [2019-11-23 22:30:59,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:30:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:30:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:30:59,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848464875] [2019-11-23 22:30:59,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:30:59,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:30:59,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196186148] [2019-11-23 22:30:59,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:30:59,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:30:59,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:30:59,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:30:59,165 INFO L87 Difference]: Start difference. First operand 640 states and 968 transitions. Second operand 3 states. [2019-11-23 22:30:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:30:59,221 INFO L93 Difference]: Finished difference Result 1882 states and 2842 transitions. [2019-11-23 22:30:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:30:59,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 22:30:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:30:59,229 INFO L225 Difference]: With dead ends: 1882 [2019-11-23 22:30:59,229 INFO L226 Difference]: Without dead ends: 1270 [2019-11-23 22:30:59,230 INFO L630 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 [2019-11-23 22:30:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-23 22:30:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 642. [2019-11-23 22:30:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 22:30:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 970 transitions. [2019-11-23 22:30:59,275 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 970 transitions. Word has length 96 [2019-11-23 22:30:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:30:59,276 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 970 transitions. [2019-11-23 22:30:59,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:30:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 970 transitions. [2019-11-23 22:30:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:30:59,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:30:59,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:30:59,287 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:30:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:30:59,288 INFO L82 PathProgramCache]: Analyzing trace with hash -611891448, now seen corresponding path program 1 times [2019-11-23 22:30:59,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:30:59,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882218114] [2019-11-23 22:30:59,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:30:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:30:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:30:59,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882218114] [2019-11-23 22:30:59,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:30:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:30:59,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890899998] [2019-11-23 22:30:59,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:30:59,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:30:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:30:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:30:59,471 INFO L87 Difference]: Start difference. First operand 642 states and 970 transitions. Second operand 4 states. [2019-11-23 22:30:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:30:59,517 INFO L93 Difference]: Finished difference Result 1274 states and 1926 transitions. [2019-11-23 22:30:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:30:59,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-23 22:30:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:30:59,521 INFO L225 Difference]: With dead ends: 1274 [2019-11-23 22:30:59,521 INFO L226 Difference]: Without dead ends: 640 [2019-11-23 22:30:59,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:30:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-23 22:30:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-11-23 22:30:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-23 22:30:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 966 transitions. [2019-11-23 22:30:59,551 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 966 transitions. Word has length 97 [2019-11-23 22:30:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:30:59,551 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 966 transitions. [2019-11-23 22:30:59,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:30:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 966 transitions. [2019-11-23 22:30:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:30:59,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:30:59,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:30:59,553 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:30:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:30:59,554 INFO L82 PathProgramCache]: Analyzing trace with hash -981864435, now seen corresponding path program 1 times [2019-11-23 22:30:59,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:30:59,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85968331] [2019-11-23 22:30:59,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:30:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:30:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:30:59,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85968331] [2019-11-23 22:30:59,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:30:59,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:30:59,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662251855] [2019-11-23 22:30:59,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:30:59,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:30:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:30:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:30:59,637 INFO L87 Difference]: Start difference. First operand 640 states and 966 transitions. Second operand 3 states. [2019-11-23 22:30:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:30:59,708 INFO L93 Difference]: Finished difference Result 1414 states and 2157 transitions. [2019-11-23 22:30:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:30:59,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:30:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:30:59,714 INFO L225 Difference]: With dead ends: 1414 [2019-11-23 22:30:59,714 INFO L226 Difference]: Without dead ends: 948 [2019-11-23 22:30:59,715 INFO L630 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 [2019-11-23 22:30:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-11-23 22:30:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 946. [2019-11-23 22:30:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-11-23 22:30:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1411 transitions. [2019-11-23 22:30:59,764 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1411 transitions. Word has length 97 [2019-11-23 22:30:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:30:59,764 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 1411 transitions. [2019-11-23 22:30:59,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:30:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1411 transitions. [2019-11-23 22:30:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:30:59,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:30:59,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:30:59,767 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:30:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:30:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash -83426502, now seen corresponding path program 1 times [2019-11-23 22:30:59,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:30:59,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58156387] [2019-11-23 22:30:59,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:30:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:30:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:30:59,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58156387] [2019-11-23 22:30:59,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:30:59,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:30:59,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977718366] [2019-11-23 22:30:59,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:30:59,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:30:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:30:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:30:59,904 INFO L87 Difference]: Start difference. First operand 946 states and 1411 transitions. Second operand 4 states. [2019-11-23 22:31:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:00,025 INFO L93 Difference]: Finished difference Result 2376 states and 3546 transitions. [2019-11-23 22:31:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:00,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 22:31:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:00,033 INFO L225 Difference]: With dead ends: 2376 [2019-11-23 22:31:00,033 INFO L226 Difference]: Without dead ends: 1449 [2019-11-23 22:31:00,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-11-23 22:31:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2019-11-23 22:31:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-23 22:31:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2139 transitions. [2019-11-23 22:31:00,128 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2139 transitions. Word has length 99 [2019-11-23 22:31:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:00,128 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2139 transitions. [2019-11-23 22:31:00,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2139 transitions. [2019-11-23 22:31:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:31:00,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:00,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:00,131 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1303974225, now seen corresponding path program 1 times [2019-11-23 22:31:00,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:00,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166062472] [2019-11-23 22:31:00,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:00,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166062472] [2019-11-23 22:31:00,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:00,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:00,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823954201] [2019-11-23 22:31:00,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:00,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:00,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:00,244 INFO L87 Difference]: Start difference. First operand 1447 states and 2139 transitions. Second operand 4 states. [2019-11-23 22:31:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:00,331 INFO L93 Difference]: Finished difference Result 2507 states and 3725 transitions. [2019-11-23 22:31:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:00,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 22:31:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:00,339 INFO L225 Difference]: With dead ends: 2507 [2019-11-23 22:31:00,339 INFO L226 Difference]: Without dead ends: 1447 [2019-11-23 22:31:00,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-11-23 22:31:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2019-11-23 22:31:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-23 22:31:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2138 transitions. [2019-11-23 22:31:00,428 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2138 transitions. Word has length 101 [2019-11-23 22:31:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:00,428 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2138 transitions. [2019-11-23 22:31:00,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2138 transitions. [2019-11-23 22:31:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:31:00,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:00,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:00,431 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash 963915244, now seen corresponding path program 1 times [2019-11-23 22:31:00,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:00,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336532692] [2019-11-23 22:31:00,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:00,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336532692] [2019-11-23 22:31:00,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:00,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:00,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794104262] [2019-11-23 22:31:00,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:00,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:00,524 INFO L87 Difference]: Start difference. First operand 1447 states and 2138 transitions. Second operand 3 states. [2019-11-23 22:31:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:00,699 INFO L93 Difference]: Finished difference Result 3304 states and 4953 transitions. [2019-11-23 22:31:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:00,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:31:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:00,710 INFO L225 Difference]: With dead ends: 3304 [2019-11-23 22:31:00,710 INFO L226 Difference]: Without dead ends: 2196 [2019-11-23 22:31:00,714 INFO L630 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 [2019-11-23 22:31:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2019-11-23 22:31:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2194. [2019-11-23 22:31:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2019-11-23 22:31:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 3218 transitions. [2019-11-23 22:31:00,833 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 3218 transitions. Word has length 101 [2019-11-23 22:31:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:00,835 INFO L462 AbstractCegarLoop]: Abstraction has 2194 states and 3218 transitions. [2019-11-23 22:31:00,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 3218 transitions. [2019-11-23 22:31:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:31:00,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:00,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:00,838 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:00,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1817525050, now seen corresponding path program 1 times [2019-11-23 22:31:00,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:00,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646219942] [2019-11-23 22:31:00,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:00,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646219942] [2019-11-23 22:31:00,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:00,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:01,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935064787] [2019-11-23 22:31:01,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:01,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:01,007 INFO L87 Difference]: Start difference. First operand 2194 states and 3218 transitions. Second operand 4 states. [2019-11-23 22:31:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:01,264 INFO L93 Difference]: Finished difference Result 6348 states and 9298 transitions. [2019-11-23 22:31:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:01,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 22:31:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:01,283 INFO L225 Difference]: With dead ends: 6348 [2019-11-23 22:31:01,283 INFO L226 Difference]: Without dead ends: 4193 [2019-11-23 22:31:01,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2019-11-23 22:31:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4191. [2019-11-23 22:31:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-11-23 22:31:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 6087 transitions. [2019-11-23 22:31:01,540 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 6087 transitions. Word has length 103 [2019-11-23 22:31:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:01,540 INFO L462 AbstractCegarLoop]: Abstraction has 4191 states and 6087 transitions. [2019-11-23 22:31:01,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 6087 transitions. [2019-11-23 22:31:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:31:01,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:01,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:01,546 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -399665424, now seen corresponding path program 1 times [2019-11-23 22:31:01,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:01,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578296082] [2019-11-23 22:31:01,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:01,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578296082] [2019-11-23 22:31:01,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:01,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:01,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663463542] [2019-11-23 22:31:01,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:01,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:01,603 INFO L87 Difference]: Start difference. First operand 4191 states and 6087 transitions. Second operand 3 states. [2019-11-23 22:31:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:01,993 INFO L93 Difference]: Finished difference Result 12389 states and 18020 transitions. [2019-11-23 22:31:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:01,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:31:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:02,028 INFO L225 Difference]: With dead ends: 12389 [2019-11-23 22:31:02,028 INFO L226 Difference]: Without dead ends: 8299 [2019-11-23 22:31:02,034 INFO L630 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 [2019-11-23 22:31:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2019-11-23 22:31:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 4197. [2019-11-23 22:31:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4197 states. [2019-11-23 22:31:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 6093 transitions. [2019-11-23 22:31:02,349 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 6093 transitions. Word has length 104 [2019-11-23 22:31:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:02,349 INFO L462 AbstractCegarLoop]: Abstraction has 4197 states and 6093 transitions. [2019-11-23 22:31:02,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 6093 transitions. [2019-11-23 22:31:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:31:02,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:02,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:02,354 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -789174747, now seen corresponding path program 1 times [2019-11-23 22:31:02,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:02,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604215308] [2019-11-23 22:31:02,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:02,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604215308] [2019-11-23 22:31:02,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:02,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:02,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383705504] [2019-11-23 22:31:02,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:02,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:02,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:02,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:02,447 INFO L87 Difference]: Start difference. First operand 4197 states and 6093 transitions. Second operand 4 states. [2019-11-23 22:31:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:02,646 INFO L93 Difference]: Finished difference Result 8291 states and 12052 transitions. [2019-11-23 22:31:02,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:02,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-23 22:31:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:02,664 INFO L225 Difference]: With dead ends: 8291 [2019-11-23 22:31:02,664 INFO L226 Difference]: Without dead ends: 4197 [2019-11-23 22:31:02,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-11-23 22:31:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4194. [2019-11-23 22:31:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4194 states. [2019-11-23 22:31:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 6086 transitions. [2019-11-23 22:31:02,895 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 6086 transitions. Word has length 105 [2019-11-23 22:31:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:02,946 INFO L462 AbstractCegarLoop]: Abstraction has 4194 states and 6086 transitions. [2019-11-23 22:31:02,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 6086 transitions. [2019-11-23 22:31:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:31:02,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:02,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:02,951 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:02,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1175492870, now seen corresponding path program 1 times [2019-11-23 22:31:02,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:02,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081568531] [2019-11-23 22:31:02,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:03,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081568531] [2019-11-23 22:31:03,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:03,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:03,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757698727] [2019-11-23 22:31:03,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:03,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:03,018 INFO L87 Difference]: Start difference. First operand 4194 states and 6086 transitions. Second operand 3 states. [2019-11-23 22:31:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:03,351 INFO L93 Difference]: Finished difference Result 10897 states and 15856 transitions. [2019-11-23 22:31:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:03,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:31:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:03,367 INFO L225 Difference]: With dead ends: 10897 [2019-11-23 22:31:03,368 INFO L226 Difference]: Without dead ends: 7377 [2019-11-23 22:31:03,374 INFO L630 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 [2019-11-23 22:31:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2019-11-23 22:31:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 7375. [2019-11-23 22:31:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-11-23 22:31:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 10504 transitions. [2019-11-23 22:31:03,769 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 10504 transitions. Word has length 105 [2019-11-23 22:31:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:03,769 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 10504 transitions. [2019-11-23 22:31:03,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 10504 transitions. [2019-11-23 22:31:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:31:03,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:03,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:03,778 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash -717867767, now seen corresponding path program 1 times [2019-11-23 22:31:03,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:03,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074208005] [2019-11-23 22:31:03,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:03,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074208005] [2019-11-23 22:31:03,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:03,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:03,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603791673] [2019-11-23 22:31:03,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:03,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:03,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:03,871 INFO L87 Difference]: Start difference. First operand 7375 states and 10504 transitions. Second operand 4 states. [2019-11-23 22:31:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:04,167 INFO L93 Difference]: Finished difference Result 12986 states and 18662 transitions. [2019-11-23 22:31:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-23 22:31:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:04,181 INFO L225 Difference]: With dead ends: 12986 [2019-11-23 22:31:04,182 INFO L226 Difference]: Without dead ends: 6223 [2019-11-23 22:31:04,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2019-11-23 22:31:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 6223. [2019-11-23 22:31:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2019-11-23 22:31:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 8885 transitions. [2019-11-23 22:31:04,524 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 8885 transitions. Word has length 105 [2019-11-23 22:31:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:04,524 INFO L462 AbstractCegarLoop]: Abstraction has 6223 states and 8885 transitions. [2019-11-23 22:31:04,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 8885 transitions. [2019-11-23 22:31:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 22:31:04,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:04,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:04,531 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1323620079, now seen corresponding path program 1 times [2019-11-23 22:31:04,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:04,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065753319] [2019-11-23 22:31:04,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:04,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065753319] [2019-11-23 22:31:04,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:04,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:04,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702650508] [2019-11-23 22:31:04,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:04,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:04,656 INFO L87 Difference]: Start difference. First operand 6223 states and 8885 transitions. Second operand 4 states. [2019-11-23 22:31:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:05,156 INFO L93 Difference]: Finished difference Result 9759 states and 14008 transitions. [2019-11-23 22:31:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:05,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-23 22:31:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:05,166 INFO L225 Difference]: With dead ends: 9759 [2019-11-23 22:31:05,166 INFO L226 Difference]: Without dead ends: 5619 [2019-11-23 22:31:05,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states. [2019-11-23 22:31:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 5582. [2019-11-23 22:31:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5582 states. [2019-11-23 22:31:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 7926 transitions. [2019-11-23 22:31:05,476 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 7926 transitions. Word has length 107 [2019-11-23 22:31:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 5582 states and 7926 transitions. [2019-11-23 22:31:05,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 7926 transitions. [2019-11-23 22:31:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 22:31:05,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:05,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:05,483 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1709812529, now seen corresponding path program 1 times [2019-11-23 22:31:05,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:05,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665255535] [2019-11-23 22:31:05,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:05,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665255535] [2019-11-23 22:31:05,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:05,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:05,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600583713] [2019-11-23 22:31:05,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:05,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:05,528 INFO L87 Difference]: Start difference. First operand 5582 states and 7926 transitions. Second operand 3 states. [2019-11-23 22:31:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:06,515 INFO L93 Difference]: Finished difference Result 14170 states and 20651 transitions. [2019-11-23 22:31:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:06,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-23 22:31:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:06,535 INFO L225 Difference]: With dead ends: 14170 [2019-11-23 22:31:06,535 INFO L226 Difference]: Without dead ends: 10298 [2019-11-23 22:31:06,542 INFO L630 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 [2019-11-23 22:31:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10298 states. [2019-11-23 22:31:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10298 to 10296. [2019-11-23 22:31:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10296 states. [2019-11-23 22:31:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10296 states to 10296 states and 14706 transitions. [2019-11-23 22:31:06,992 INFO L78 Accepts]: Start accepts. Automaton has 10296 states and 14706 transitions. Word has length 109 [2019-11-23 22:31:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:06,992 INFO L462 AbstractCegarLoop]: Abstraction has 10296 states and 14706 transitions. [2019-11-23 22:31:06,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 10296 states and 14706 transitions. [2019-11-23 22:31:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 22:31:07,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:07,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:07,003 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:07,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1172299126, now seen corresponding path program 1 times [2019-11-23 22:31:07,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:07,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821980342] [2019-11-23 22:31:07,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:07,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821980342] [2019-11-23 22:31:07,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:07,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:07,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884192357] [2019-11-23 22:31:07,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:07,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:07,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:07,119 INFO L87 Difference]: Start difference. First operand 10296 states and 14706 transitions. Second operand 4 states. [2019-11-23 22:31:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:07,815 INFO L93 Difference]: Finished difference Result 20649 states and 29486 transitions. [2019-11-23 22:31:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:07,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-23 22:31:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:07,833 INFO L225 Difference]: With dead ends: 20649 [2019-11-23 22:31:07,833 INFO L226 Difference]: Without dead ends: 10502 [2019-11-23 22:31:07,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-11-23 22:31:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10408. [2019-11-23 22:31:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10408 states. [2019-11-23 22:31:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10408 states to 10408 states and 14827 transitions. [2019-11-23 22:31:08,442 INFO L78 Accepts]: Start accepts. Automaton has 10408 states and 14827 transitions. Word has length 109 [2019-11-23 22:31:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:08,443 INFO L462 AbstractCegarLoop]: Abstraction has 10408 states and 14827 transitions. [2019-11-23 22:31:08,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10408 states and 14827 transitions. [2019-11-23 22:31:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 22:31:08,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:08,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:08,453 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash 808379514, now seen corresponding path program 1 times [2019-11-23 22:31:08,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:08,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132748026] [2019-11-23 22:31:08,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:08,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132748026] [2019-11-23 22:31:08,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:08,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:08,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352941141] [2019-11-23 22:31:08,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:08,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:08,939 INFO L87 Difference]: Start difference. First operand 10408 states and 14827 transitions. Second operand 3 states. [2019-11-23 22:31:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:09,862 INFO L93 Difference]: Finished difference Result 28055 states and 40150 transitions. [2019-11-23 22:31:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:09,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-23 22:31:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:09,890 INFO L225 Difference]: With dead ends: 28055 [2019-11-23 22:31:09,891 INFO L226 Difference]: Without dead ends: 20618 [2019-11-23 22:31:09,901 INFO L630 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 [2019-11-23 22:31:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20618 states. [2019-11-23 22:31:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20618 to 10418. [2019-11-23 22:31:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10418 states. [2019-11-23 22:31:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 14837 transitions. [2019-11-23 22:31:10,493 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 14837 transitions. Word has length 110 [2019-11-23 22:31:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:10,493 INFO L462 AbstractCegarLoop]: Abstraction has 10418 states and 14837 transitions. [2019-11-23 22:31:10,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 14837 transitions. [2019-11-23 22:31:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:10,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:10,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:10,501 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 744989516, now seen corresponding path program 1 times [2019-11-23 22:31:10,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:10,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081672294] [2019-11-23 22:31:10,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:10,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081672294] [2019-11-23 22:31:10,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:10,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:10,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63807729] [2019-11-23 22:31:10,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:10,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:10,558 INFO L87 Difference]: Start difference. First operand 10418 states and 14837 transitions. Second operand 3 states. [2019-11-23 22:31:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:11,415 INFO L93 Difference]: Finished difference Result 22638 states and 34147 transitions. [2019-11-23 22:31:11,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:11,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-23 22:31:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:11,434 INFO L225 Difference]: With dead ends: 22638 [2019-11-23 22:31:11,434 INFO L226 Difference]: Without dead ends: 16528 [2019-11-23 22:31:11,443 INFO L630 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 [2019-11-23 22:31:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2019-11-23 22:31:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 16484. [2019-11-23 22:31:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16484 states. [2019-11-23 22:31:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16484 states to 16484 states and 24155 transitions. [2019-11-23 22:31:12,333 INFO L78 Accepts]: Start accepts. Automaton has 16484 states and 24155 transitions. Word has length 111 [2019-11-23 22:31:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:12,334 INFO L462 AbstractCegarLoop]: Abstraction has 16484 states and 24155 transitions. [2019-11-23 22:31:12,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16484 states and 24155 transitions. [2019-11-23 22:31:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:12,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:12,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:12,339 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1518514165, now seen corresponding path program 1 times [2019-11-23 22:31:12,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:12,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899974683] [2019-11-23 22:31:12,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:12,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899974683] [2019-11-23 22:31:12,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:12,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-23 22:31:12,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712503243] [2019-11-23 22:31:12,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:31:12,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:31:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:31:12,670 INFO L87 Difference]: Start difference. First operand 16484 states and 24155 transitions. Second operand 15 states. [2019-11-23 22:31:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:18,377 INFO L93 Difference]: Finished difference Result 66341 states and 101068 transitions. [2019-11-23 22:31:18,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:31:18,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 111 [2019-11-23 22:31:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:18,435 INFO L225 Difference]: With dead ends: 66341 [2019-11-23 22:31:18,436 INFO L226 Difference]: Without dead ends: 53512 [2019-11-23 22:31:18,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:31:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53512 states. [2019-11-23 22:31:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53512 to 53496. [2019-11-23 22:31:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53496 states. [2019-11-23 22:31:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53496 states to 53496 states and 80894 transitions. [2019-11-23 22:31:22,176 INFO L78 Accepts]: Start accepts. Automaton has 53496 states and 80894 transitions. Word has length 111 [2019-11-23 22:31:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:22,177 INFO L462 AbstractCegarLoop]: Abstraction has 53496 states and 80894 transitions. [2019-11-23 22:31:22,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:31:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53496 states and 80894 transitions. [2019-11-23 22:31:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:22,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:22,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:22,188 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1157308592, now seen corresponding path program 1 times [2019-11-23 22:31:22,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:22,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293529434] [2019-11-23 22:31:22,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:22,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293529434] [2019-11-23 22:31:22,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:22,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:31:22,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749452498] [2019-11-23 22:31:22,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:31:22,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:31:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:31:22,404 INFO L87 Difference]: Start difference. First operand 53496 states and 80894 transitions. Second operand 12 states. [2019-11-23 22:31:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:28,507 INFO L93 Difference]: Finished difference Result 87634 states and 134104 transitions. [2019-11-23 22:31:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:31:28,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-11-23 22:31:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:28,577 INFO L225 Difference]: With dead ends: 87634 [2019-11-23 22:31:28,577 INFO L226 Difference]: Without dead ends: 58169 [2019-11-23 22:31:28,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:31:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58169 states. [2019-11-23 22:31:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58169 to 34849. [2019-11-23 22:31:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34849 states. [2019-11-23 22:31:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34849 states to 34849 states and 52560 transitions. [2019-11-23 22:31:31,632 INFO L78 Accepts]: Start accepts. Automaton has 34849 states and 52560 transitions. Word has length 111 [2019-11-23 22:31:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:31,633 INFO L462 AbstractCegarLoop]: Abstraction has 34849 states and 52560 transitions. [2019-11-23 22:31:31,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:31:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34849 states and 52560 transitions. [2019-11-23 22:31:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:31,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:31,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:31,639 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1352743846, now seen corresponding path program 1 times [2019-11-23 22:31:31,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:31,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586617016] [2019-11-23 22:31:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:31,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586617016] [2019-11-23 22:31:31,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:31,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:31:31,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768853976] [2019-11-23 22:31:31,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:31:31,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:31:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:31:31,921 INFO L87 Difference]: Start difference. First operand 34849 states and 52560 transitions. Second operand 12 states. [2019-11-23 22:31:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:40,246 INFO L93 Difference]: Finished difference Result 106920 states and 163735 transitions. [2019-11-23 22:31:40,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:31:40,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-11-23 22:31:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:40,343 INFO L225 Difference]: With dead ends: 106920 [2019-11-23 22:31:40,343 INFO L226 Difference]: Without dead ends: 80331 [2019-11-23 22:31:40,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:31:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80331 states. [2019-11-23 22:31:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80331 to 35330. [2019-11-23 22:31:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35330 states. [2019-11-23 22:31:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35330 states to 35330 states and 53109 transitions. [2019-11-23 22:31:43,682 INFO L78 Accepts]: Start accepts. Automaton has 35330 states and 53109 transitions. Word has length 111 [2019-11-23 22:31:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:43,683 INFO L462 AbstractCegarLoop]: Abstraction has 35330 states and 53109 transitions. [2019-11-23 22:31:43,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:31:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 35330 states and 53109 transitions. [2019-11-23 22:31:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:43,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:43,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:43,690 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash -266400693, now seen corresponding path program 1 times [2019-11-23 22:31:43,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:43,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217831600] [2019-11-23 22:31:43,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:44,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217831600] [2019-11-23 22:31:44,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:44,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:31:44,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675335099] [2019-11-23 22:31:44,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:31:44,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:31:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:31:44,012 INFO L87 Difference]: Start difference. First operand 35330 states and 53109 transitions. Second operand 8 states. [2019-11-23 22:31:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:47,912 INFO L93 Difference]: Finished difference Result 65942 states and 100697 transitions. [2019-11-23 22:31:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:47,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-11-23 22:31:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:47,946 INFO L225 Difference]: With dead ends: 65942 [2019-11-23 22:31:47,946 INFO L226 Difference]: Without dead ends: 35332 [2019-11-23 22:31:47,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35332 states. [2019-11-23 22:31:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35332 to 22620. [2019-11-23 22:31:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22620 states. [2019-11-23 22:31:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22620 states to 22620 states and 33449 transitions. [2019-11-23 22:31:50,006 INFO L78 Accepts]: Start accepts. Automaton has 22620 states and 33449 transitions. Word has length 111 [2019-11-23 22:31:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:50,006 INFO L462 AbstractCegarLoop]: Abstraction has 22620 states and 33449 transitions. [2019-11-23 22:31:50,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:31:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22620 states and 33449 transitions. [2019-11-23 22:31:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:50,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:50,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:50,012 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2048402849, now seen corresponding path program 1 times [2019-11-23 22:31:50,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:50,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808777063] [2019-11-23 22:31:50,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:50,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808777063] [2019-11-23 22:31:50,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:50,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:50,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135343473] [2019-11-23 22:31:50,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:50,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:50,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:50,111 INFO L87 Difference]: Start difference. First operand 22620 states and 33449 transitions. Second operand 4 states. [2019-11-23 22:31:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:52,314 INFO L93 Difference]: Finished difference Result 45407 states and 67107 transitions. [2019-11-23 22:31:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:52,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 22:31:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:52,337 INFO L225 Difference]: With dead ends: 45407 [2019-11-23 22:31:52,338 INFO L226 Difference]: Without dead ends: 23121 [2019-11-23 22:31:52,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23121 states. [2019-11-23 22:31:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23121 to 22901. [2019-11-23 22:31:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22901 states. [2019-11-23 22:31:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22901 states to 22901 states and 33750 transitions. [2019-11-23 22:31:54,568 INFO L78 Accepts]: Start accepts. Automaton has 22901 states and 33750 transitions. Word has length 111 [2019-11-23 22:31:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:54,569 INFO L462 AbstractCegarLoop]: Abstraction has 22901 states and 33750 transitions. [2019-11-23 22:31:54,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22901 states and 33750 transitions. [2019-11-23 22:31:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:31:54,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:54,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:54,575 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1191527915, now seen corresponding path program 1 times [2019-11-23 22:31:54,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:54,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996073725] [2019-11-23 22:31:54,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:54,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996073725] [2019-11-23 22:31:54,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:54,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:54,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126332497] [2019-11-23 22:31:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:54,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:54,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:54,664 INFO L87 Difference]: Start difference. First operand 22901 states and 33750 transitions. Second operand 4 states. [2019-11-23 22:31:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:56,908 INFO L93 Difference]: Finished difference Result 32520 states and 47979 transitions. [2019-11-23 22:31:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:56,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 22:31:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:56,926 INFO L225 Difference]: With dead ends: 32520 [2019-11-23 22:31:56,926 INFO L226 Difference]: Without dead ends: 19857 [2019-11-23 22:31:56,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19857 states. [2019-11-23 22:31:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19857 to 19857. [2019-11-23 22:31:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19857 states. [2019-11-23 22:31:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19857 states to 19857 states and 29199 transitions. [2019-11-23 22:31:58,760 INFO L78 Accepts]: Start accepts. Automaton has 19857 states and 29199 transitions. Word has length 111 [2019-11-23 22:31:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:58,760 INFO L462 AbstractCegarLoop]: Abstraction has 19857 states and 29199 transitions. [2019-11-23 22:31:58,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19857 states and 29199 transitions. [2019-11-23 22:31:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 22:31:58,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:58,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:58,764 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1910968843, now seen corresponding path program 1 times [2019-11-23 22:31:58,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:58,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069080328] [2019-11-23 22:31:58,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:59,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069080328] [2019-11-23 22:31:59,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:59,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-23 22:31:59,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217163340] [2019-11-23 22:31:59,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 22:31:59,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 22:31:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:31:59,847 INFO L87 Difference]: Start difference. First operand 19857 states and 29199 transitions. Second operand 23 states. [2019-11-23 22:32:00,358 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-23 22:32:00,521 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-23 22:32:00,901 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-23 22:32:01,143 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:32:01,525 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-23 22:32:01,826 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-11-23 22:32:02,199 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-23 22:32:02,452 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-23 22:32:02,688 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-23 22:32:02,970 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-23 22:32:03,144 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-11-23 22:32:03,548 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-23 22:32:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:11,618 INFO L93 Difference]: Finished difference Result 64360 states and 97302 transitions. [2019-11-23 22:32:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:32:11,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 113 [2019-11-23 22:32:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:11,720 INFO L225 Difference]: With dead ends: 64360 [2019-11-23 22:32:11,720 INFO L226 Difference]: Without dead ends: 57246 [2019-11-23 22:32:11,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:32:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57246 states. [2019-11-23 22:32:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57246 to 20420. [2019-11-23 22:32:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20420 states. [2019-11-23 22:32:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20420 states to 20420 states and 29896 transitions. [2019-11-23 22:32:14,315 INFO L78 Accepts]: Start accepts. Automaton has 20420 states and 29896 transitions. Word has length 113 [2019-11-23 22:32:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:14,315 INFO L462 AbstractCegarLoop]: Abstraction has 20420 states and 29896 transitions. [2019-11-23 22:32:14,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 22:32:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20420 states and 29896 transitions. [2019-11-23 22:32:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 22:32:14,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:14,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:14,321 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 655744324, now seen corresponding path program 1 times [2019-11-23 22:32:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:14,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853659237] [2019-11-23 22:32:14,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:32:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:32:14,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:32:14,489 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:32:14,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:32:14 BoogieIcfgContainer [2019-11-23 22:32:14,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:32:14,668 INFO L168 Benchmark]: Toolchain (without parser) took 79116.61 ms. Allocated memory was 144.7 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-11-23 22:32:14,668 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 22:32:14,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.43 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 172.7 MB in the end (delta: -71.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:32:14,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.95 ms. Allocated memory is still 202.4 MB. Free memory was 172.7 MB in the beginning and 168.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:32:14,670 INFO L168 Benchmark]: Boogie Preprocessor took 74.75 ms. Allocated memory is still 202.4 MB. Free memory was 168.6 MB in the beginning and 166.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:32:14,670 INFO L168 Benchmark]: RCFGBuilder took 1185.26 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 166.5 MB in the beginning and 194.3 MB in the end (delta: -27.8 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:32:14,671 INFO L168 Benchmark]: TraceAbstraction took 77059.50 ms. Allocated memory was 234.9 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 194.3 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-11-23 22:32:14,673 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.43 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 172.7 MB in the end (delta: -71.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.95 ms. Allocated memory is still 202.4 MB. Free memory was 172.7 MB in the beginning and 168.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.75 ms. Allocated memory is still 202.4 MB. Free memory was 168.6 MB in the beginning and 166.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1185.26 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 166.5 MB in the beginning and 194.3 MB in the end (delta: -27.8 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77059.50 ms. Allocated memory was 234.9 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 194.3 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 536]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] char id2 = '\x0'; [L45] unsigned char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] char id3 = '\x0'; [L52] unsigned char r3 = '\x0'; [L53] char st3 = '\x0'; [L54] char nl3 = '\x0'; [L55] char m3 = '\x0'; [L56] char max3 = '\x0'; [L57] _Bool mode3 = 0; [L65] int __return_1142; [L66] int __return_1270; [L67] int __return_1389; [L68] int __return_1499; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L17] port_t p13 = 0; [L21] port_t p21 = 0; [L25] port_t p23 = 0; [L29] port_t p31 = 0; [L33] port_t p32 = 0; [L61] void (*nodes[3])() = { &node1, &node2, &node3 }; VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L71] int main__c1; [L72] int main__i2; [L73] main__c1 = 0 [L74] ep12 = __VERIFIER_nondet_bool() [L75] ep13 = __VERIFIER_nondet_bool() [L76] ep21 = __VERIFIER_nondet_bool() [L77] ep23 = __VERIFIER_nondet_bool() [L78] ep31 = __VERIFIER_nondet_bool() [L79] ep32 = __VERIFIER_nondet_bool() [L80] id1 = __VERIFIER_nondet_char() [L81] r1 = __VERIFIER_nondet_uchar() [L82] st1 = __VERIFIER_nondet_char() [L83] nl1 = __VERIFIER_nondet_char() [L84] m1 = __VERIFIER_nondet_char() [L85] max1 = __VERIFIER_nondet_char() [L86] mode1 = __VERIFIER_nondet_bool() [L87] id2 = __VERIFIER_nondet_char() [L88] r2 = __VERIFIER_nondet_uchar() [L89] st2 = __VERIFIER_nondet_char() [L90] nl2 = __VERIFIER_nondet_char() [L91] m2 = __VERIFIER_nondet_char() [L92] max2 = __VERIFIER_nondet_char() [L93] mode2 = __VERIFIER_nondet_bool() [L94] id3 = __VERIFIER_nondet_char() [L95] r3 = __VERIFIER_nondet_uchar() [L96] st3 = __VERIFIER_nondet_char() [L97] nl3 = __VERIFIER_nondet_char() [L98] m3 = __VERIFIER_nondet_char() [L99] max3 = __VERIFIER_nondet_char() [L100] mode3 = __VERIFIER_nondet_bool() [L102] _Bool init__r121; [L103] _Bool init__r131; [L104] _Bool init__r211; [L105] _Bool init__r231; [L106] _Bool init__r311; [L107] _Bool init__r321; [L108] _Bool init__r122; [L109] int init__tmp; [L110] _Bool init__r132; [L111] int init__tmp___0; [L112] _Bool init__r212; [L113] int init__tmp___1; [L114] _Bool init__r232; [L115] int init__tmp___2; [L116] _Bool init__r312; [L117] int init__tmp___3; [L118] _Bool init__r322; [L119] int init__tmp___4; [L120] int init__tmp___5; [L121] init__r121 = ep12 [L122] init__r131 = ep13 [L123] init__r211 = ep21 [L124] init__r231 = ep23 [L125] init__r311 = ep31 [L126] init__r321 = ep32 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L127] COND TRUE !(init__r121 == 0) [L129] init__tmp = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L131] init__r122 = (_Bool)init__tmp VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L132] COND FALSE !(!(init__r131 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1612] COND TRUE !(init__r121 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1614] COND TRUE !(ep23 == 0) [L1616] init__tmp___0 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L136] init__r132 = (_Bool)init__tmp___0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L137] COND FALSE !(!(init__r211 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1589] COND TRUE !(init__r231 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1591] COND TRUE !(ep31 == 0) [L1593] init__tmp___1 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L141] init__r212 = (_Bool)init__tmp___1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L142] COND TRUE !(init__r231 == 0) [L144] init__tmp___2 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L146] init__r232 = (_Bool)init__tmp___2 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] COND TRUE !(init__r311 == 0) [L149] init__tmp___3 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L151] init__r312 = (_Bool)init__tmp___3 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] COND FALSE !(!(init__r321 == 0)) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1520] COND TRUE !(init__r311 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1522] COND TRUE !(ep12 == 0) [L1524] init__tmp___4 = 1 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L156] init__r322 = (_Bool)init__tmp___4 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L159] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L161] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id2) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id3) >= 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)r1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)r2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)r3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE !(init__r122 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE !(init__r132 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE !(init__r212 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE !(init__r232 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r312 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r322 == 0) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)st1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)st2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)st3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)nl1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)nl2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)nl3) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)mode1) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)mode2) == 0 VAL [__return_1142=0, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)mode3) == 0 [L211] init__tmp___5 = 1 [L212] __return_1142 = init__tmp___5 [L213] main__i2 = __return_1142 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE main__i2 != 0 [L216] p12_old = nomsg [L217] p12_new = nomsg [L218] p13_old = nomsg [L219] p13_new = nomsg [L220] p21_old = nomsg [L221] p21_new = nomsg [L222] p23_old = nomsg [L223] p23_new = nomsg [L224] p31_old = nomsg [L225] p31_new = nomsg [L226] p32_old = nomsg [L227] p32_new = nomsg [L228] main__i2 = 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND FALSE !(!(mode1 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L236] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L238] COND TRUE !(ep12 == 0) [L240] int node1____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND TRUE max1 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L243] COND TRUE p12_new == nomsg [L245] node1____CPAchecker_TMP_0 = max1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L247] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L249] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L260] mode1 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L262] COND FALSE !(!(mode2 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE ((int)r2) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L281] COND TRUE !(ep23 == 0) [L283] int node2____CPAchecker_TMP_1; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND TRUE max2 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE p23_new == nomsg [L288] node2____CPAchecker_TMP_1 = max2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L290] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] mode2 = 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L294] COND FALSE !(!(mode3 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L300] COND TRUE ((int)r3) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE !(ep31 == 0) [L304] int node3____CPAchecker_TMP_0; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND TRUE max3 != nomsg VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L307] COND TRUE p31_new == nomsg [L309] node3____CPAchecker_TMP_0 = max3 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L311] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L313] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L324] mode3 = 1 [L325] p12_old = p12_new [L326] p12_new = nomsg [L327] p13_old = p13_new [L328] p13_new = nomsg [L329] p21_old = p21_new [L330] p21_new = nomsg [L331] p23_old = p23_new [L332] p23_new = nomsg [L333] p31_old = p31_new [L334] p31_new = nomsg [L335] p32_old = p32_new [L336] p32_new = nomsg [L338] int check__tmp; VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L339] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L345] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE ((int)r1) < 2 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1142=1, __return_1270=0, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE ((int)r1) < 2 [L367] check__tmp = 1 [L368] __return_1270 = check__tmp [L369] main__c1 = __return_1270 [L371] _Bool __tmp_1; [L372] __tmp_1 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND TRUE !(mode1 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND FALSE !(r1 == 255) [L390] r1 = r1 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(!(ep21 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE !(ep31 == 0) [L401] m1 = p31_old [L402] p31_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE ((int)r1) == 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)max1) == ((int)id1) [L411] st1 = 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L413] mode1 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L415] COND TRUE !(mode2 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L417] COND FALSE !(r2 == 255) [L423] r2 = r2 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L424] COND TRUE !(ep12 == 0) [L426] m2 = p12_old [L427] p12_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L428] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L432] COND FALSE !(!(ep32 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L440] COND FALSE !(((int)r2) == 2) [L446] mode2 = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L448] COND TRUE !(mode3 == 0) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L450] COND FALSE !(r3 == 255) [L456] r3 = r3 + 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L457] COND FALSE !(!(ep13 == 0)) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L465] COND TRUE !(ep23 == 0) [L467] m3 = p23_old [L468] p23_old = nomsg VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L469] COND TRUE ((int)m3) > ((int)max3) [L471] max3 = m3 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L473] COND FALSE !(((int)r3) == 2) [L479] mode3 = 0 [L480] p12_old = p12_new [L481] p12_new = nomsg [L482] p13_old = p13_new [L483] p13_new = nomsg [L484] p21_old = p21_new [L485] p21_new = nomsg [L486] p23_old = p23_new [L487] p23_new = nomsg [L488] p31_old = p31_new [L489] p31_new = nomsg [L490] p32_old = p32_new [L491] p32_new = nomsg [L493] int check__tmp; VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L494] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L496] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L498] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L500] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L502] COND FALSE !(((int)r1) >= 2) VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1090] check__tmp = 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L526] __return_1389 = check__tmp [L527] main__c1 = __return_1389 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L530] _Bool __tmp_2; [L531] __tmp_2 = main__c1 [L532] _Bool assert__arg; [L533] assert__arg = __tmp_2 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L534] COND TRUE assert__arg == 0 VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L536] __VERIFIER_error() VAL [__return_1142=1, __return_1270=1, __return_1389=0, __return_1499=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 224 locations, 1 error locations. Result: UNSAFE, OverallTime: 76.9s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11114 SDtfs, 19271 SDslu, 22701 SDs, 0 SdLazy, 6882 SolverSat, 753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53496occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 133219 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2741 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2603 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...