./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc1e09d0a185b5e28aca558590d685af7160ef3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 20:08:47,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 20:08:47,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 20:08:47,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 20:08:47,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 20:08:47,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 20:08:47,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 20:08:47,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 20:08:47,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 20:08:47,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 20:08:47,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 20:08:47,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 20:08:47,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 20:08:47,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 20:08:47,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 20:08:47,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 20:08:47,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 20:08:47,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 20:08:47,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 20:08:47,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 20:08:47,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 20:08:47,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 20:08:47,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 20:08:47,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 20:08:47,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 20:08:47,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 20:08:47,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 20:08:47,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 20:08:47,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 20:08:47,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 20:08:47,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 20:08:47,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 20:08:47,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 20:08:47,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 20:08:47,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 20:08:47,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 20:08:47,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 20:08:47,596 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 20:08:47,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 20:08:47,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 20:08:47,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 20:08:47,601 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 20:08:47,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 20:08:47,601 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 20:08:47,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 20:08:47,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 20:08:47,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 20:08:47,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 20:08:47,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 20:08:47,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 20:08:47,603 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 20:08:47,605 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 20:08:47,605 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 20:08:47,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 20:08:47,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 20:08:47,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 20:08:47,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 20:08:47,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 20:08:47,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 20:08:47,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 20:08:47,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 20:08:47,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 20:08:47,607 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 20:08:47,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 20:08:47,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 20:08:47,608 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2019-01-12 20:08:47,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 20:08:47,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 20:08:47,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 20:08:47,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 20:08:47,692 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 20:08:47,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-01-12 20:08:47,742 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189d37790/24b32649df0f428eaafe9aa6efb15b25/FLAGb2718a84b [2019-01-12 20:08:48,306 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 20:08:48,307 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-01-12 20:08:48,322 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189d37790/24b32649df0f428eaafe9aa6efb15b25/FLAGb2718a84b [2019-01-12 20:08:48,521 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189d37790/24b32649df0f428eaafe9aa6efb15b25 [2019-01-12 20:08:48,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 20:08:48,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 20:08:48,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 20:08:48,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 20:08:48,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 20:08:48,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:08:48" (1/1) ... [2019-01-12 20:08:48,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425dcf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:48, skipping insertion in model container [2019-01-12 20:08:48,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:08:48" (1/1) ... [2019-01-12 20:08:48,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 20:08:48,622 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 20:08:48,964 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 20:08:48,979 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 20:08:49,112 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 20:08:49,143 INFO L195 MainTranslator]: Completed translation [2019-01-12 20:08:49,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49 WrapperNode [2019-01-12 20:08:49,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 20:08:49,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 20:08:49,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 20:08:49,145 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 20:08:49,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 20:08:49,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 20:08:49,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 20:08:49,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 20:08:49,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (1/1) ... [2019-01-12 20:08:49,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 20:08:49,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 20:08:49,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 20:08:49,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 20:08:49,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (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-01-12 20:08:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 20:08:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 20:08:51,304 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 20:08:51,305 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 20:08:51,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:08:51 BoogieIcfgContainer [2019-01-12 20:08:51,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 20:08:51,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 20:08:51,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 20:08:51,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 20:08:51,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:08:48" (1/3) ... [2019-01-12 20:08:51,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d56312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:08:51, skipping insertion in model container [2019-01-12 20:08:51,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:08:49" (2/3) ... [2019-01-12 20:08:51,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d56312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:08:51, skipping insertion in model container [2019-01-12 20:08:51,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:08:51" (3/3) ... [2019-01-12 20:08:51,314 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-01-12 20:08:51,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 20:08:51,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 20:08:51,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 20:08:51,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 20:08:51,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 20:08:51,375 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 20:08:51,375 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 20:08:51,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 20:08:51,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 20:08:51,376 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 20:08:51,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 20:08:51,376 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 20:08:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2019-01-12 20:08:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 20:08:51,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:51,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:51,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2019-01-12 20:08:51,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:51,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:52,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:52,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:52,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:52,157 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 4 states. [2019-01-12 20:08:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:52,647 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2019-01-12 20:08:52,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:08:52,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 20:08:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:52,691 INFO L225 Difference]: With dead ends: 714 [2019-01-12 20:08:52,691 INFO L226 Difference]: Without dead ends: 470 [2019-01-12 20:08:52,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-12 20:08:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-01-12 20:08:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-01-12 20:08:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2019-01-12 20:08:52,864 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2019-01-12 20:08:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:52,865 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2019-01-12 20:08:52,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2019-01-12 20:08:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 20:08:52,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:52,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:52,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2019-01-12 20:08:52,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:52,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:53,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:53,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:53,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:53,030 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand 3 states. [2019-01-12 20:08:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:53,114 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2019-01-12 20:08:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:08:53,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-12 20:08:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:53,125 INFO L225 Difference]: With dead ends: 1366 [2019-01-12 20:08:53,126 INFO L226 Difference]: Without dead ends: 926 [2019-01-12 20:08:53,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-01-12 20:08:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2019-01-12 20:08:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-01-12 20:08:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2019-01-12 20:08:53,200 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2019-01-12 20:08:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:53,202 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2019-01-12 20:08:53,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:08:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2019-01-12 20:08:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 20:08:53,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:53,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:53,212 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2019-01-12 20:08:53,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:53,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:53,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:53,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:53,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:53,402 INFO L87 Difference]: Start difference. First operand 470 states and 691 transitions. Second operand 3 states. [2019-01-12 20:08:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:53,558 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2019-01-12 20:08:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:08:53,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-12 20:08:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:53,567 INFO L225 Difference]: With dead ends: 977 [2019-01-12 20:08:53,567 INFO L226 Difference]: Without dead ends: 634 [2019-01-12 20:08:53,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-01-12 20:08:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2019-01-12 20:08:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-01-12 20:08:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2019-01-12 20:08:53,610 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2019-01-12 20:08:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:53,611 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2019-01-12 20:08:53,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:08:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2019-01-12 20:08:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 20:08:53,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:53,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:53,614 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2019-01-12 20:08:53,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:53,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:53,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:53,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:53,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:53,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:53,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:53,810 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand 4 states. [2019-01-12 20:08:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:53,931 INFO L93 Difference]: Finished difference Result 1226 states and 1856 transitions. [2019-01-12 20:08:53,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:08:53,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 20:08:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:53,935 INFO L225 Difference]: With dead ends: 1226 [2019-01-12 20:08:53,935 INFO L226 Difference]: Without dead ends: 616 [2019-01-12 20:08:53,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-01-12 20:08:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-01-12 20:08:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-01-12 20:08:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 931 transitions. [2019-01-12 20:08:54,012 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 931 transitions. Word has length 103 [2019-01-12 20:08:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:54,012 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 931 transitions. [2019-01-12 20:08:54,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 931 transitions. [2019-01-12 20:08:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 20:08:54,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:54,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:54,014 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 101799940, now seen corresponding path program 1 times [2019-01-12 20:08:54,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:54,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:54,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:54,137 INFO L87 Difference]: Start difference. First operand 616 states and 931 transitions. Second operand 3 states. [2019-01-12 20:08:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:54,432 INFO L93 Difference]: Finished difference Result 1334 states and 2039 transitions. [2019-01-12 20:08:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:08:54,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-12 20:08:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:54,439 INFO L225 Difference]: With dead ends: 1334 [2019-01-12 20:08:54,440 INFO L226 Difference]: Without dead ends: 909 [2019-01-12 20:08:54,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-01-12 20:08:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-01-12 20:08:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-01-12 20:08:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1355 transitions. [2019-01-12 20:08:54,504 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1355 transitions. Word has length 103 [2019-01-12 20:08:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:54,504 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1355 transitions. [2019-01-12 20:08:54,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:08:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1355 transitions. [2019-01-12 20:08:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 20:08:54,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:54,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:54,507 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2115732183, now seen corresponding path program 1 times [2019-01-12 20:08:54,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:54,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:54,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:54,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:54,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:54,597 INFO L87 Difference]: Start difference. First operand 907 states and 1355 transitions. Second operand 3 states. [2019-01-12 20:08:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:54,951 INFO L93 Difference]: Finished difference Result 1976 states and 3065 transitions. [2019-01-12 20:08:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:08:54,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-12 20:08:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:54,963 INFO L225 Difference]: With dead ends: 1976 [2019-01-12 20:08:54,964 INFO L226 Difference]: Without dead ends: 1335 [2019-01-12 20:08:54,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-01-12 20:08:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1291. [2019-01-12 20:08:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-12 20:08:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1978 transitions. [2019-01-12 20:08:55,099 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1978 transitions. Word has length 105 [2019-01-12 20:08:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:55,099 INFO L480 AbstractCegarLoop]: Abstraction has 1291 states and 1978 transitions. [2019-01-12 20:08:55,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:08:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1978 transitions. [2019-01-12 20:08:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 20:08:55,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:55,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:55,102 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash -602590006, now seen corresponding path program 1 times [2019-01-12 20:08:55,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:55,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:55,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:55,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:55,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:55,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:08:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:08:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:55,494 INFO L87 Difference]: Start difference. First operand 1291 states and 1978 transitions. Second operand 5 states. [2019-01-12 20:08:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:57,696 INFO L93 Difference]: Finished difference Result 3370 states and 5285 transitions. [2019-01-12 20:08:57,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 20:08:57,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-01-12 20:08:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:57,710 INFO L225 Difference]: With dead ends: 3370 [2019-01-12 20:08:57,710 INFO L226 Difference]: Without dead ends: 2255 [2019-01-12 20:08:57,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 20:08:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-01-12 20:08:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2253. [2019-01-12 20:08:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-01-12 20:08:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3506 transitions. [2019-01-12 20:08:57,899 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3506 transitions. Word has length 106 [2019-01-12 20:08:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:57,899 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 3506 transitions. [2019-01-12 20:08:57,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:08:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3506 transitions. [2019-01-12 20:08:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 20:08:57,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:57,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:57,903 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash -404241499, now seen corresponding path program 1 times [2019-01-12 20:08:57,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:58,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:58,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:58,217 INFO L87 Difference]: Start difference. First operand 2253 states and 3506 transitions. Second operand 4 states. [2019-01-12 20:08:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:59,094 INFO L93 Difference]: Finished difference Result 5824 states and 9079 transitions. [2019-01-12 20:08:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:08:59,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-01-12 20:08:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:59,116 INFO L225 Difference]: With dead ends: 5824 [2019-01-12 20:08:59,116 INFO L226 Difference]: Without dead ends: 3590 [2019-01-12 20:08:59,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-01-12 20:08:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2019-01-12 20:08:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-01-12 20:08:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5553 transitions. [2019-01-12 20:08:59,458 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5553 transitions. Word has length 106 [2019-01-12 20:08:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:59,459 INFO L480 AbstractCegarLoop]: Abstraction has 3588 states and 5553 transitions. [2019-01-12 20:08:59,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5553 transitions. [2019-01-12 20:08:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 20:08:59,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:59,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:08:59,462 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1846587040, now seen corresponding path program 1 times [2019-01-12 20:08:59,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:59,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:59,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:59,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:59,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:59,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:59,587 INFO L87 Difference]: Start difference. First operand 3588 states and 5553 transitions. Second operand 3 states. [2019-01-12 20:09:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:00,169 INFO L93 Difference]: Finished difference Result 10000 states and 15600 transitions. [2019-01-12 20:09:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:09:00,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-01-12 20:09:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:00,204 INFO L225 Difference]: With dead ends: 10000 [2019-01-12 20:09:00,204 INFO L226 Difference]: Without dead ends: 6784 [2019-01-12 20:09:00,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2019-01-12 20:09:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 6782. [2019-01-12 20:09:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6782 states. [2019-01-12 20:09:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 10446 transitions. [2019-01-12 20:09:00,793 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 10446 transitions. Word has length 108 [2019-01-12 20:09:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:00,794 INFO L480 AbstractCegarLoop]: Abstraction has 6782 states and 10446 transitions. [2019-01-12 20:09:00,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:09:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 10446 transitions. [2019-01-12 20:09:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 20:09:00,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:00,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:00,799 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash -953475971, now seen corresponding path program 1 times [2019-01-12 20:09:00,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:00,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:00,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:00,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:00,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:00,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:00,959 INFO L87 Difference]: Start difference. First operand 6782 states and 10446 transitions. Second operand 4 states. [2019-01-12 20:09:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:01,394 INFO L93 Difference]: Finished difference Result 10729 states and 16558 transitions. [2019-01-12 20:09:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:01,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 20:09:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:01,413 INFO L225 Difference]: With dead ends: 10729 [2019-01-12 20:09:01,413 INFO L226 Difference]: Without dead ends: 5526 [2019-01-12 20:09:01,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2019-01-12 20:09:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5526. [2019-01-12 20:09:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5526 states. [2019-01-12 20:09:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 8479 transitions. [2019-01-12 20:09:01,800 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 8479 transitions. Word has length 108 [2019-01-12 20:09:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:01,800 INFO L480 AbstractCegarLoop]: Abstraction has 5526 states and 8479 transitions. [2019-01-12 20:09:01,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 8479 transitions. [2019-01-12 20:09:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 20:09:01,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:01,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:01,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash 224725848, now seen corresponding path program 1 times [2019-01-12 20:09:01,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:01,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:01,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:01,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:01,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:09:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:09:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:09:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:01,896 INFO L87 Difference]: Start difference. First operand 5526 states and 8479 transitions. Second operand 3 states. [2019-01-12 20:09:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:02,442 INFO L93 Difference]: Finished difference Result 14566 states and 22766 transitions. [2019-01-12 20:09:02,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:09:02,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-12 20:09:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:02,475 INFO L225 Difference]: With dead ends: 14566 [2019-01-12 20:09:02,475 INFO L226 Difference]: Without dead ends: 9372 [2019-01-12 20:09:02,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9372 states. [2019-01-12 20:09:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9372 to 8962. [2019-01-12 20:09:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2019-01-12 20:09:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 13974 transitions. [2019-01-12 20:09:03,000 INFO L78 Accepts]: Start accepts. Automaton has 8962 states and 13974 transitions. Word has length 110 [2019-01-12 20:09:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:03,000 INFO L480 AbstractCegarLoop]: Abstraction has 8962 states and 13974 transitions. [2019-01-12 20:09:03,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:09:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8962 states and 13974 transitions. [2019-01-12 20:09:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 20:09:03,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:03,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:03,003 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1189364322, now seen corresponding path program 1 times [2019-01-12 20:09:03,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:03,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:03,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:03,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:03,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:03,294 INFO L87 Difference]: Start difference. First operand 8962 states and 13974 transitions. Second operand 4 states. [2019-01-12 20:09:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:04,450 INFO L93 Difference]: Finished difference Result 25027 states and 38954 transitions. [2019-01-12 20:09:04,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:04,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-01-12 20:09:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:04,483 INFO L225 Difference]: With dead ends: 25027 [2019-01-12 20:09:04,483 INFO L226 Difference]: Without dead ends: 16104 [2019-01-12 20:09:04,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-01-12 20:09:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2019-01-12 20:09:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-01-12 20:09:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24827 transitions. [2019-01-12 20:09:05,356 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24827 transitions. Word has length 111 [2019-01-12 20:09:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:05,356 INFO L480 AbstractCegarLoop]: Abstraction has 16102 states and 24827 transitions. [2019-01-12 20:09:05,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24827 transitions. [2019-01-12 20:09:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 20:09:05,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:05,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:05,363 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2128482264, now seen corresponding path program 1 times [2019-01-12 20:09:05,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:05,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:05,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:05,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:05,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:09:05,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:09:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:09:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:05,447 INFO L87 Difference]: Start difference. First operand 16102 states and 24827 transitions. Second operand 3 states. [2019-01-12 20:09:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:07,091 INFO L93 Difference]: Finished difference Result 48114 states and 74234 transitions. [2019-01-12 20:09:07,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:09:07,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-01-12 20:09:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:07,147 INFO L225 Difference]: With dead ends: 48114 [2019-01-12 20:09:07,148 INFO L226 Difference]: Without dead ends: 32117 [2019-01-12 20:09:07,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32117 states. [2019-01-12 20:09:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32117 to 16108. [2019-01-12 20:09:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16108 states. [2019-01-12 20:09:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16108 states to 16108 states and 24833 transitions. [2019-01-12 20:09:08,313 INFO L78 Accepts]: Start accepts. Automaton has 16108 states and 24833 transitions. Word has length 112 [2019-01-12 20:09:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:08,313 INFO L480 AbstractCegarLoop]: Abstraction has 16108 states and 24833 transitions. [2019-01-12 20:09:08,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:09:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 16108 states and 24833 transitions. [2019-01-12 20:09:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 20:09:08,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:08,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:08,319 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1621970129, now seen corresponding path program 1 times [2019-01-12 20:09:08,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:08,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:08,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:08,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:08,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:09:08,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:09:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:09:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:08,449 INFO L87 Difference]: Start difference. First operand 16108 states and 24833 transitions. Second operand 3 states. [2019-01-12 20:09:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:10,552 INFO L93 Difference]: Finished difference Result 41746 states and 64349 transitions. [2019-01-12 20:09:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:09:10,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-01-12 20:09:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:10,592 INFO L225 Difference]: With dead ends: 41746 [2019-01-12 20:09:10,592 INFO L226 Difference]: Without dead ends: 26384 [2019-01-12 20:09:10,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2019-01-12 20:09:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26382. [2019-01-12 20:09:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26382 states. [2019-01-12 20:09:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26382 states to 26382 states and 40027 transitions. [2019-01-12 20:09:12,493 INFO L78 Accepts]: Start accepts. Automaton has 26382 states and 40027 transitions. Word has length 113 [2019-01-12 20:09:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:12,494 INFO L480 AbstractCegarLoop]: Abstraction has 26382 states and 40027 transitions. [2019-01-12 20:09:12,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:09:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26382 states and 40027 transitions. [2019-01-12 20:09:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 20:09:12,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:12,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:12,505 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1799632340, now seen corresponding path program 1 times [2019-01-12 20:09:12,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:12,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:12,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:12,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:12,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:12,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:12,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:12,682 INFO L87 Difference]: Start difference. First operand 26382 states and 40027 transitions. Second operand 4 states. [2019-01-12 20:09:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:14,549 INFO L93 Difference]: Finished difference Result 48995 states and 74626 transitions. [2019-01-12 20:09:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:14,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-01-12 20:09:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:14,578 INFO L225 Difference]: With dead ends: 48995 [2019-01-12 20:09:14,578 INFO L226 Difference]: Without dead ends: 23283 [2019-01-12 20:09:14,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-01-12 20:09:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 23283. [2019-01-12 20:09:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23283 states. [2019-01-12 20:09:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23283 states to 23283 states and 35373 transitions. [2019-01-12 20:09:16,053 INFO L78 Accepts]: Start accepts. Automaton has 23283 states and 35373 transitions. Word has length 113 [2019-01-12 20:09:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:16,054 INFO L480 AbstractCegarLoop]: Abstraction has 23283 states and 35373 transitions. [2019-01-12 20:09:16,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23283 states and 35373 transitions. [2019-01-12 20:09:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 20:09:16,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:16,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:16,060 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash -812664826, now seen corresponding path program 1 times [2019-01-12 20:09:16,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:16,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:16,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:16,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:16,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:16,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:16,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:16,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:16,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:16,222 INFO L87 Difference]: Start difference. First operand 23283 states and 35373 transitions. Second operand 4 states. [2019-01-12 20:09:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:17,800 INFO L93 Difference]: Finished difference Result 44591 states and 67806 transitions. [2019-01-12 20:09:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:17,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-01-12 20:09:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:17,828 INFO L225 Difference]: With dead ends: 44591 [2019-01-12 20:09:17,828 INFO L226 Difference]: Without dead ends: 21601 [2019-01-12 20:09:17,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21601 states. [2019-01-12 20:09:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21601 to 21559. [2019-01-12 20:09:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21559 states. [2019-01-12 20:09:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21559 states to 21559 states and 32717 transitions. [2019-01-12 20:09:19,264 INFO L78 Accepts]: Start accepts. Automaton has 21559 states and 32717 transitions. Word has length 116 [2019-01-12 20:09:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:19,265 INFO L480 AbstractCegarLoop]: Abstraction has 21559 states and 32717 transitions. [2019-01-12 20:09:19,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 21559 states and 32717 transitions. [2019-01-12 20:09:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 20:09:19,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:19,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:19,270 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash -929354459, now seen corresponding path program 1 times [2019-01-12 20:09:19,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:19,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:19,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:19,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:19,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:19,606 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 6 [2019-01-12 20:09:20,119 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2019-01-12 20:09:20,500 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-12 20:09:20,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-01-12 20:09:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:20,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 20:09:20,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 20:09:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 20:09:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-01-12 20:09:20,902 INFO L87 Difference]: Start difference. First operand 21559 states and 32717 transitions. Second operand 16 states. [2019-01-12 20:09:21,634 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-01-12 20:09:22,364 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 20:09:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:27,525 INFO L93 Difference]: Finished difference Result 70500 states and 107892 transitions. [2019-01-12 20:09:27,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 20:09:27,526 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2019-01-12 20:09:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:27,591 INFO L225 Difference]: With dead ends: 70500 [2019-01-12 20:09:27,591 INFO L226 Difference]: Without dead ends: 59819 [2019-01-12 20:09:27,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2019-01-12 20:09:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59819 states. [2019-01-12 20:09:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59819 to 22186. [2019-01-12 20:09:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22186 states. [2019-01-12 20:09:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22186 states to 22186 states and 33451 transitions. [2019-01-12 20:09:29,715 INFO L78 Accepts]: Start accepts. Automaton has 22186 states and 33451 transitions. Word has length 118 [2019-01-12 20:09:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:29,715 INFO L480 AbstractCegarLoop]: Abstraction has 22186 states and 33451 transitions. [2019-01-12 20:09:29,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 20:09:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 22186 states and 33451 transitions. [2019-01-12 20:09:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 20:09:29,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:29,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:29,721 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2037476919, now seen corresponding path program 1 times [2019-01-12 20:09:29,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:29,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:29,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:29,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:29,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:29,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:29,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:29,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:29,928 INFO L87 Difference]: Start difference. First operand 22186 states and 33451 transitions. Second operand 4 states. [2019-01-12 20:09:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:32,516 INFO L93 Difference]: Finished difference Result 44463 states and 67020 transitions. [2019-01-12 20:09:32,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:32,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-01-12 20:09:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:32,546 INFO L225 Difference]: With dead ends: 44463 [2019-01-12 20:09:32,546 INFO L226 Difference]: Without dead ends: 22432 [2019-01-12 20:09:32,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22432 states. [2019-01-12 20:09:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22432 to 22328. [2019-01-12 20:09:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22328 states. [2019-01-12 20:09:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22328 states to 22328 states and 33602 transitions. [2019-01-12 20:09:35,357 INFO L78 Accepts]: Start accepts. Automaton has 22328 states and 33602 transitions. Word has length 118 [2019-01-12 20:09:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:35,358 INFO L480 AbstractCegarLoop]: Abstraction has 22328 states and 33602 transitions. [2019-01-12 20:09:35,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 22328 states and 33602 transitions. [2019-01-12 20:09:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 20:09:35,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:35,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:35,365 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:35,365 INFO L82 PathProgramCache]: Analyzing trace with hash 382637137, now seen corresponding path program 1 times [2019-01-12 20:09:35,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:35,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:35,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:35,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:35,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:35,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:35,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:09:35,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:09:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:09:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:35,443 INFO L87 Difference]: Start difference. First operand 22328 states and 33602 transitions. Second operand 3 states. [2019-01-12 20:09:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:39,551 INFO L93 Difference]: Finished difference Result 60738 states and 91608 transitions. [2019-01-12 20:09:39,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:09:39,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-01-12 20:09:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:39,606 INFO L225 Difference]: With dead ends: 60738 [2019-01-12 20:09:39,607 INFO L226 Difference]: Without dead ends: 44449 [2019-01-12 20:09:39,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:09:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44449 states. [2019-01-12 20:09:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44449 to 22338. [2019-01-12 20:09:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22338 states. [2019-01-12 20:09:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22338 states to 22338 states and 33612 transitions. [2019-01-12 20:09:42,216 INFO L78 Accepts]: Start accepts. Automaton has 22338 states and 33612 transitions. Word has length 119 [2019-01-12 20:09:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:42,352 INFO L480 AbstractCegarLoop]: Abstraction has 22338 states and 33612 transitions. [2019-01-12 20:09:42,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:09:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 22338 states and 33612 transitions. [2019-01-12 20:09:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 20:09:42,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:42,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:42,357 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1972916280, now seen corresponding path program 1 times [2019-01-12 20:09:42,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:42,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:42,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:42,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:42,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:42,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:42,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:09:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:09:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:09:42,517 INFO L87 Difference]: Start difference. First operand 22338 states and 33612 transitions. Second operand 4 states. [2019-01-12 20:09:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:44,632 INFO L93 Difference]: Finished difference Result 39172 states and 58870 transitions. [2019-01-12 20:09:44,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:44,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-01-12 20:09:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:44,656 INFO L225 Difference]: With dead ends: 39172 [2019-01-12 20:09:44,656 INFO L226 Difference]: Without dead ends: 22328 [2019-01-12 20:09:44,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22328 states. [2019-01-12 20:09:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22328 to 22328. [2019-01-12 20:09:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22328 states. [2019-01-12 20:09:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22328 states to 22328 states and 33597 transitions. [2019-01-12 20:09:46,907 INFO L78 Accepts]: Start accepts. Automaton has 22328 states and 33597 transitions. Word has length 120 [2019-01-12 20:09:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:46,908 INFO L480 AbstractCegarLoop]: Abstraction has 22328 states and 33597 transitions. [2019-01-12 20:09:46,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:09:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22328 states and 33597 transitions. [2019-01-12 20:09:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 20:09:46,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:46,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:46,913 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:46,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1572545800, now seen corresponding path program 1 times [2019-01-12 20:09:46,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:46,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:46,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:47,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:47,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 20:09:47,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:09:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:09:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:47,152 INFO L87 Difference]: Start difference. First operand 22328 states and 33597 transitions. Second operand 5 states. [2019-01-12 20:09:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:49,467 INFO L93 Difference]: Finished difference Result 42919 states and 64553 transitions. [2019-01-12 20:09:49,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:49,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-01-12 20:09:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:49,495 INFO L225 Difference]: With dead ends: 42919 [2019-01-12 20:09:49,495 INFO L226 Difference]: Without dead ends: 20873 [2019-01-12 20:09:49,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20873 states. [2019-01-12 20:09:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20873 to 20601. [2019-01-12 20:09:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20601 states. [2019-01-12 20:09:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20601 states to 20601 states and 30936 transitions. [2019-01-12 20:09:51,643 INFO L78 Accepts]: Start accepts. Automaton has 20601 states and 30936 transitions. Word has length 120 [2019-01-12 20:09:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:51,643 INFO L480 AbstractCegarLoop]: Abstraction has 20601 states and 30936 transitions. [2019-01-12 20:09:51,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:09:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 20601 states and 30936 transitions. [2019-01-12 20:09:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 20:09:51,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:51,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:51,649 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1343086903, now seen corresponding path program 1 times [2019-01-12 20:09:51,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:51,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:51,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:51,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:51,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:09:51,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:09:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:09:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:51,851 INFO L87 Difference]: Start difference. First operand 20601 states and 30936 transitions. Second operand 5 states. [2019-01-12 20:09:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:54,422 INFO L93 Difference]: Finished difference Result 39713 states and 60156 transitions. [2019-01-12 20:09:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 20:09:54,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-01-12 20:09:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:54,445 INFO L225 Difference]: With dead ends: 39713 [2019-01-12 20:09:54,445 INFO L226 Difference]: Without dead ends: 20601 [2019-01-12 20:09:54,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 20:09:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20601 states. [2019-01-12 20:09:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20601 to 20601. [2019-01-12 20:09:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20601 states. [2019-01-12 20:09:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20601 states to 20601 states and 30690 transitions. [2019-01-12 20:09:56,674 INFO L78 Accepts]: Start accepts. Automaton has 20601 states and 30690 transitions. Word has length 122 [2019-01-12 20:09:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:09:56,674 INFO L480 AbstractCegarLoop]: Abstraction has 20601 states and 30690 transitions. [2019-01-12 20:09:56,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:09:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 20601 states and 30690 transitions. [2019-01-12 20:09:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 20:09:56,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:09:56,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:09:56,679 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:09:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:09:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1090994532, now seen corresponding path program 1 times [2019-01-12 20:09:56,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:09:56,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:09:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:56,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:09:56,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:09:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:09:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:09:56,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:09:56,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 20:09:56,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:09:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:09:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:09:56,812 INFO L87 Difference]: Start difference. First operand 20601 states and 30690 transitions. Second operand 5 states. [2019-01-12 20:09:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:09:59,358 INFO L93 Difference]: Finished difference Result 38429 states and 58206 transitions. [2019-01-12 20:09:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:09:59,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-01-12 20:09:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:09:59,381 INFO L225 Difference]: With dead ends: 38429 [2019-01-12 20:09:59,381 INFO L226 Difference]: Without dead ends: 20603 [2019-01-12 20:09:59,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 20:09:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20603 states. [2019-01-12 20:10:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20603 to 20601. [2019-01-12 20:10:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20601 states. [2019-01-12 20:10:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20601 states to 20601 states and 30594 transitions. [2019-01-12 20:10:01,826 INFO L78 Accepts]: Start accepts. Automaton has 20601 states and 30594 transitions. Word has length 122 [2019-01-12 20:10:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:10:01,826 INFO L480 AbstractCegarLoop]: Abstraction has 20601 states and 30594 transitions. [2019-01-12 20:10:01,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:10:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20601 states and 30594 transitions. [2019-01-12 20:10:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 20:10:01,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:10:01,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:10:01,831 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:10:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:10:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -82654240, now seen corresponding path program 1 times [2019-01-12 20:10:01,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:10:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:10:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:10:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:10:01,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-01-12 20:10:01,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:10:01,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:10:01,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:10:01,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:10:01,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:10:01,938 INFO L87 Difference]: Start difference. First operand 20601 states and 30594 transitions. Second operand 3 states. [2019-01-12 20:10:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:10:06,510 INFO L93 Difference]: Finished difference Result 55297 states and 84344 transitions. [2019-01-12 20:10:06,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:10:06,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-01-12 20:10:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:10:06,554 INFO L225 Difference]: With dead ends: 55297 [2019-01-12 20:10:06,555 INFO L226 Difference]: Without dead ends: 37949 [2019-01-12 20:10:06,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:10:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37949 states. [2019-01-12 20:10:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37949 to 37875. [2019-01-12 20:10:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37875 states. [2019-01-12 20:10:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37875 states to 37875 states and 56514 transitions. [2019-01-12 20:10:11,180 INFO L78 Accepts]: Start accepts. Automaton has 37875 states and 56514 transitions. Word has length 122 [2019-01-12 20:10:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:10:11,180 INFO L480 AbstractCegarLoop]: Abstraction has 37875 states and 56514 transitions. [2019-01-12 20:10:11,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:10:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37875 states and 56514 transitions. [2019-01-12 20:10:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 20:10:11,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:10:11,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:10:11,185 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:10:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:10:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1976470388, now seen corresponding path program 1 times [2019-01-12 20:10:11,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:10:11,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:10:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:11,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:10:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:10:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:10:11,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:10:11,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 20:10:11,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 20:10:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 20:10:11,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 20:10:11,323 INFO L87 Difference]: Start difference. First operand 37875 states and 56514 transitions. Second operand 6 states. [2019-01-12 20:10:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:10:24,584 INFO L93 Difference]: Finished difference Result 143531 states and 216319 transitions. [2019-01-12 20:10:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 20:10:24,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-01-12 20:10:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:10:24,712 INFO L225 Difference]: With dead ends: 143531 [2019-01-12 20:10:24,713 INFO L226 Difference]: Without dead ends: 106975 [2019-01-12 20:10:24,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 20:10:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106975 states. [2019-01-12 20:10:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106975 to 106971. [2019-01-12 20:10:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106971 states. [2019-01-12 20:10:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106971 states to 106971 states and 160821 transitions. [2019-01-12 20:10:38,092 INFO L78 Accepts]: Start accepts. Automaton has 106971 states and 160821 transitions. Word has length 122 [2019-01-12 20:10:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:10:38,093 INFO L480 AbstractCegarLoop]: Abstraction has 106971 states and 160821 transitions. [2019-01-12 20:10:38,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 20:10:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 106971 states and 160821 transitions. [2019-01-12 20:10:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 20:10:38,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:10:38,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:10:38,098 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:10:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:10:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1986267249, now seen corresponding path program 1 times [2019-01-12 20:10:38,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:10:38,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:10:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:38,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:10:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:10:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:10:38,412 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-12 20:10:41,009 WARN L181 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-12 20:10:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:10:41,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:10:41,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-12 20:10:41,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 20:10:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 20:10:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-01-12 20:10:41,675 INFO L87 Difference]: Start difference. First operand 106971 states and 160821 transitions. Second operand 21 states. [2019-01-12 20:10:42,089 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-12 20:10:42,298 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-12 20:10:42,509 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-01-12 20:10:43,023 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-01-12 20:10:43,314 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-12 20:10:43,749 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-12 20:10:44,085 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-01-12 20:10:44,452 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-01-12 20:10:44,801 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-01-12 20:10:45,038 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-01-12 20:10:45,456 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 20:10:45,685 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-01-12 20:10:46,114 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-12 20:11:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:11:24,119 INFO L93 Difference]: Finished difference Result 305233 states and 460102 transitions. [2019-01-12 20:11:24,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 20:11:24,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-01-12 20:11:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:11:24,467 INFO L225 Difference]: With dead ends: 305233 [2019-01-12 20:11:24,468 INFO L226 Difference]: Without dead ends: 258899 [2019-01-12 20:11:24,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 20:11:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258899 states. [2019-01-12 20:11:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258899 to 107448. [2019-01-12 20:11:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107448 states. [2019-01-12 20:11:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107448 states to 107448 states and 161373 transitions. [2019-01-12 20:11:43,452 INFO L78 Accepts]: Start accepts. Automaton has 107448 states and 161373 transitions. Word has length 122 [2019-01-12 20:11:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:11:43,452 INFO L480 AbstractCegarLoop]: Abstraction has 107448 states and 161373 transitions. [2019-01-12 20:11:43,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 20:11:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107448 states and 161373 transitions. [2019-01-12 20:11:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-12 20:11:43,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:11:43,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 20:11:43,458 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:11:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:11:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash -270948014, now seen corresponding path program 1 times [2019-01-12 20:11:43,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:11:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:11:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:11:43,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:11:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:11:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 20:11:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 20:11:43,637 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 20:11:43,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:11:43 BoogieIcfgContainer [2019-01-12 20:11:43,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 20:11:43,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 20:11:43,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 20:11:43,863 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 20:11:43,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:08:51" (3/4) ... [2019-01-12 20:11:43,868 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 20:11:44,113 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 20:11:44,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 20:11:44,114 INFO L168 Benchmark]: Toolchain (without parser) took 175588.65 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 952.7 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,115 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 20:11:44,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,116 INFO L168 Benchmark]: Boogie Preprocessor took 48.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,117 INFO L168 Benchmark]: RCFGBuilder took 1952.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.1 MB). Peak memory consumption was 104.1 MB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,117 INFO L168 Benchmark]: TraceAbstraction took 172555.27 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,117 INFO L168 Benchmark]: Witness Printer took 250.08 ms. Allocated memory is still 5.6 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2019-01-12 20:11:44,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 617.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1952.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.1 MB). Peak memory consumption was 104.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 172555.27 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 250.08 ms. Allocated memory is still 5.6 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 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] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=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, newmax1=0, newmax2=0, newmax3=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] [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L133] COND TRUE !(init__r121 == 0) [L135] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L138] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1759] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1761] COND TRUE !(ep23 == 0) [L1763] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L143] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1736] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1738] COND TRUE !(ep31 == 0) [L1740] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L148] COND TRUE !(init__r231 == 0) [L150] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L153] COND TRUE !(init__r311 == 0) [L155] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L158] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1667] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1669] COND TRUE !(ep12 == 0) [L1671] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND TRUE !(newmax1 == 0) [L256] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L259] COND TRUE p12_new == nomsg [L261] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L263] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L265] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L303] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L305] COND TRUE !(newmax2 == 0) [L307] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L308] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L310] COND TRUE p23_new == nomsg [L312] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L314] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L328] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L330] COND TRUE !(newmax3 == 0) [L332] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L333] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L335] COND TRUE p31_new == nomsg [L337] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L339] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=0, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE !(ep31 == 0) [L434] m1 = p31_old [L435] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L436] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L442] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=0, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L461] COND TRUE !(ep12 == 0) [L463] m2 = p12_old [L464] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=5, 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] [L465] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=5, 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] [L470] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=5, 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] [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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=5, 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] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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=5, 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] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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=5, 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] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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=5, 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] [L499] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=0, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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=5, 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 TRUE !(ep23 == 0) [L510] m3 = p23_old [L511] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L512] COND TRUE ((int)m3) > ((int)max3) [L514] max3 = m3 [L515] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=3, m1=3, m2=4, m3=5, max1=4, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 1 error locations. UNSAFE Result, 172.4s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 99.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12837 SDtfs, 16656 SDslu, 22244 SDs, 0 SdLazy, 4371 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107448occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 62.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 228642 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3047 NumberOfCodeBlocks, 3047 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2899 ConstructedInterpolants, 0 QuantifiedInterpolants, 1501965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...