./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.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_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.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 7f647c6008697302f06b1d1dda080bf4ccd77afb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:55:03,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 17:55:03,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 17:55:03,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 17:55:03,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 17:55:03,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 17:55:03,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 17:55:03,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 17:55:03,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 17:55:03,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 17:55:03,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 17:55:03,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 17:55:03,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 17:55:03,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 17:55:03,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 17:55:03,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 17:55:03,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 17:55:03,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 17:55:03,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 17:55:03,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 17:55:03,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 17:55:03,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 17:55:03,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 17:55:03,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 17:55:03,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 17:55:03,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 17:55:03,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 17:55:03,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 17:55:03,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 17:55:03,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 17:55:03,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 17:55:03,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 17:55:03,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 17:55:03,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 17:55:03,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 17:55:03,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 17:55:03,445 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 17:55:03,472 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 17:55:03,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 17:55:03,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 17:55:03,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 17:55:03,474 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 17:55:03,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 17:55:03,474 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 17:55:03,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 17:55:03,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 17:55:03,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 17:55:03,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 17:55:03,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 17:55:03,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 17:55:03,476 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 17:55:03,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 17:55:03,477 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 17:55:03,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 17:55:03,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 17:55:03,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 17:55:03,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 17:55:03,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 17:55:03,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:55:03,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 17:55:03,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 17:55:03,479 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 17:55:03,480 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 17:55:03,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 17:55:03,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 17:55:03,480 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 -> 7f647c6008697302f06b1d1dda080bf4ccd77afb [2019-01-12 17:55:03,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 17:55:03,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 17:55:03,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 17:55:03,540 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 17:55:03,540 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 17:55:03,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-01-12 17:55:03,600 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74c5acae/90c6c32e4abd49bba48dcfd4f563a822/FLAG386accaa1 [2019-01-12 17:55:04,076 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 17:55:04,077 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-01-12 17:55:04,093 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74c5acae/90c6c32e4abd49bba48dcfd4f563a822/FLAG386accaa1 [2019-01-12 17:55:04,373 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f74c5acae/90c6c32e4abd49bba48dcfd4f563a822 [2019-01-12 17:55:04,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 17:55:04,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 17:55:04,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:04,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 17:55:04,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 17:55:04,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5457b1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04, skipping insertion in model container [2019-01-12 17:55:04,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:04,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 17:55:04,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 17:55:04,830 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:04,846 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 17:55:04,957 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:55:04,980 INFO L195 MainTranslator]: Completed translation [2019-01-12 17:55:04,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04 WrapperNode [2019-01-12 17:55:04,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 17:55:04,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:04,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 17:55:04,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 17:55:05,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 17:55:05,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 17:55:05,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 17:55:05,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 17:55:05,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (1/1) ... [2019-01-12 17:55:05,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 17:55:05,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 17:55:05,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 17:55:05,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 17:55:05,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (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 17:55:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 17:55:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 17:55:07,097 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 17:55:07,098 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 17:55:07,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:07 BoogieIcfgContainer [2019-01-12 17:55:07,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 17:55:07,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 17:55:07,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 17:55:07,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 17:55:07,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:55:04" (1/3) ... [2019-01-12 17:55:07,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50387788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:07, skipping insertion in model container [2019-01-12 17:55:07,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:55:04" (2/3) ... [2019-01-12 17:55:07,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50387788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:55:07, skipping insertion in model container [2019-01-12 17:55:07,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:07" (3/3) ... [2019-01-12 17:55:07,110 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-01-12 17:55:07,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 17:55:07,130 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 17:55:07,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 17:55:07,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 17:55:07,192 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 17:55:07,192 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 17:55:07,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 17:55:07,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 17:55:07,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 17:55:07,195 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 17:55:07,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 17:55:07,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 17:55:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2019-01-12 17:55:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 17:55:07,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:07,231 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] [2019-01-12 17:55:07,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1207420229, now seen corresponding path program 1 times [2019-01-12 17:55:07,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:07,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:07,697 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 17:55:07,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:07,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:07,722 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 3 states. [2019-01-12 17:55:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:08,057 INFO L93 Difference]: Finished difference Result 432 states and 754 transitions. [2019-01-12 17:55:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:08,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-12 17:55:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:08,093 INFO L225 Difference]: With dead ends: 432 [2019-01-12 17:55:08,093 INFO L226 Difference]: Without dead ends: 321 [2019-01-12 17:55:08,098 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 17:55:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-12 17:55:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2019-01-12 17:55:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-01-12 17:55:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 488 transitions. [2019-01-12 17:55:08,186 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 488 transitions. Word has length 94 [2019-01-12 17:55:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:08,187 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 488 transitions. [2019-01-12 17:55:08,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 488 transitions. [2019-01-12 17:55:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 17:55:08,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:08,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:55:08,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1721200426, now seen corresponding path program 1 times [2019-01-12 17:55:08,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:08,438 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 17:55:08,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:08,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:08,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:08,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:08,442 INFO L87 Difference]: Start difference. First operand 319 states and 488 transitions. Second operand 4 states. [2019-01-12 17:55:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:08,875 INFO L93 Difference]: Finished difference Result 926 states and 1413 transitions. [2019-01-12 17:55:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:08,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 17:55:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:08,881 INFO L225 Difference]: With dead ends: 926 [2019-01-12 17:55:08,881 INFO L226 Difference]: Without dead ends: 616 [2019-01-12 17:55:08,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-01-12 17:55:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-01-12 17:55:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-01-12 17:55:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 930 transitions. [2019-01-12 17:55:08,957 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 930 transitions. Word has length 94 [2019-01-12 17:55:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:08,958 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 930 transitions. [2019-01-12 17:55:08,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 930 transitions. [2019-01-12 17:55:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 17:55:08,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:08,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:55:08,962 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1731479778, now seen corresponding path program 1 times [2019-01-12 17:55:08,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:08,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:08,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:08,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:09,076 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 17:55:09,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:09,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:09,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:09,080 INFO L87 Difference]: Start difference. First operand 614 states and 930 transitions. Second operand 3 states. [2019-01-12 17:55:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:09,221 INFO L93 Difference]: Finished difference Result 1804 states and 2728 transitions. [2019-01-12 17:55:09,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:09,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 17:55:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:09,231 INFO L225 Difference]: With dead ends: 1804 [2019-01-12 17:55:09,232 INFO L226 Difference]: Without dead ends: 1218 [2019-01-12 17:55:09,234 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 17:55:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-01-12 17:55:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 616. [2019-01-12 17:55:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-01-12 17:55:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 932 transitions. [2019-01-12 17:55:09,293 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 932 transitions. Word has length 95 [2019-01-12 17:55:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:09,294 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 932 transitions. [2019-01-12 17:55:09,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 932 transitions. [2019-01-12 17:55:09,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 17:55:09,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:09,296 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] [2019-01-12 17:55:09,296 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 852300571, now seen corresponding path program 1 times [2019-01-12 17:55:09,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:09,458 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 17:55:09,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:09,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:09,461 INFO L87 Difference]: Start difference. First operand 616 states and 932 transitions. Second operand 3 states. [2019-01-12 17:55:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:09,814 INFO L93 Difference]: Finished difference Result 1628 states and 2489 transitions. [2019-01-12 17:55:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:09,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-12 17:55:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:09,824 INFO L225 Difference]: With dead ends: 1628 [2019-01-12 17:55:09,824 INFO L226 Difference]: Without dead ends: 1190 [2019-01-12 17:55:09,826 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 17:55:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-01-12 17:55:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1188. [2019-01-12 17:55:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-01-12 17:55:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1783 transitions. [2019-01-12 17:55:09,996 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1783 transitions. Word has length 96 [2019-01-12 17:55:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:09,997 INFO L480 AbstractCegarLoop]: Abstraction has 1188 states and 1783 transitions. [2019-01-12 17:55:09,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1783 transitions. [2019-01-12 17:55:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 17:55:10,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:10,001 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] [2019-01-12 17:55:10,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash 809550136, now seen corresponding path program 1 times [2019-01-12 17:55:10,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:10,205 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 17:55:10,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:10,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:10,207 INFO L87 Difference]: Start difference. First operand 1188 states and 1783 transitions. Second operand 4 states. [2019-01-12 17:55:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:10,505 INFO L93 Difference]: Finished difference Result 1927 states and 2914 transitions. [2019-01-12 17:55:10,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:10,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-12 17:55:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:10,511 INFO L225 Difference]: With dead ends: 1927 [2019-01-12 17:55:10,511 INFO L226 Difference]: Without dead ends: 907 [2019-01-12 17:55:10,514 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 17:55:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-01-12 17:55:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2019-01-12 17:55:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-01-12 17:55:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1354 transitions. [2019-01-12 17:55:10,585 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1354 transitions. Word has length 96 [2019-01-12 17:55:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:10,586 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1354 transitions. [2019-01-12 17:55:10,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1354 transitions. [2019-01-12 17:55:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 17:55:10,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:10,588 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] [2019-01-12 17:55:10,589 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1935153407, now seen corresponding path program 1 times [2019-01-12 17:55:10,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:10,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:10,768 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 17:55:10,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:10,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:10,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:55:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:55:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:10,769 INFO L87 Difference]: Start difference. First operand 907 states and 1354 transitions. Second operand 5 states. [2019-01-12 17:55:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:12,729 INFO L93 Difference]: Finished difference Result 1649 states and 2494 transitions. [2019-01-12 17:55:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:55:12,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-01-12 17:55:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:12,735 INFO L225 Difference]: With dead ends: 1649 [2019-01-12 17:55:12,736 INFO L226 Difference]: Without dead ends: 909 [2019-01-12 17:55:12,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:55:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-01-12 17:55:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-01-12 17:55:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-01-12 17:55:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1344 transitions. [2019-01-12 17:55:12,831 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1344 transitions. Word has length 98 [2019-01-12 17:55:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1344 transitions. [2019-01-12 17:55:12,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:55:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1344 transitions. [2019-01-12 17:55:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 17:55:12,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:12,833 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] [2019-01-12 17:55:12,834 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:12,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1498627686, now seen corresponding path program 1 times [2019-01-12 17:55:12,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:12,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:13,102 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 17:55:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:13,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:13,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:13,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:13,104 INFO L87 Difference]: Start difference. First operand 907 states and 1344 transitions. Second operand 4 states. [2019-01-12 17:55:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:13,664 INFO L93 Difference]: Finished difference Result 2271 states and 3370 transitions. [2019-01-12 17:55:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:13,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-12 17:55:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:13,672 INFO L225 Difference]: With dead ends: 2271 [2019-01-12 17:55:13,672 INFO L226 Difference]: Without dead ends: 1383 [2019-01-12 17:55:13,674 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 17:55:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-01-12 17:55:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1381. [2019-01-12 17:55:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2019-01-12 17:55:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2030 transitions. [2019-01-12 17:55:13,772 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2030 transitions. Word has length 98 [2019-01-12 17:55:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:13,773 INFO L480 AbstractCegarLoop]: Abstraction has 1381 states and 2030 transitions. [2019-01-12 17:55:13,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2030 transitions. [2019-01-12 17:55:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 17:55:13,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:13,775 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] [2019-01-12 17:55:13,776 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1326444855, now seen corresponding path program 1 times [2019-01-12 17:55:13,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:13,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:13,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:13,871 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 17:55:13,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:13,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:13,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:13,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:13,873 INFO L87 Difference]: Start difference. First operand 1381 states and 2030 transitions. Second operand 3 states. [2019-01-12 17:55:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:14,283 INFO L93 Difference]: Finished difference Result 3595 states and 5371 transitions. [2019-01-12 17:55:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:14,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 17:55:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:14,297 INFO L225 Difference]: With dead ends: 3595 [2019-01-12 17:55:14,297 INFO L226 Difference]: Without dead ends: 2553 [2019-01-12 17:55:14,300 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 17:55:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-01-12 17:55:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2551. [2019-01-12 17:55:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2019-01-12 17:55:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3739 transitions. [2019-01-12 17:55:14,497 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3739 transitions. Word has length 100 [2019-01-12 17:55:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:14,498 INFO L480 AbstractCegarLoop]: Abstraction has 2551 states and 3739 transitions. [2019-01-12 17:55:14,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3739 transitions. [2019-01-12 17:55:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 17:55:14,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:14,501 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] [2019-01-12 17:55:14,501 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash 540060070, now seen corresponding path program 1 times [2019-01-12 17:55:14,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:14,631 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 17:55:14,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:14,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:14,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:14,632 INFO L87 Difference]: Start difference. First operand 2551 states and 3739 transitions. Second operand 4 states. [2019-01-12 17:55:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:14,794 INFO L93 Difference]: Finished difference Result 3919 states and 5775 transitions. [2019-01-12 17:55:14,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:14,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 17:55:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:14,803 INFO L225 Difference]: With dead ends: 3919 [2019-01-12 17:55:14,804 INFO L226 Difference]: Without dead ends: 2087 [2019-01-12 17:55:14,806 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 17:55:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2019-01-12 17:55:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2087. [2019-01-12 17:55:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-01-12 17:55:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3043 transitions. [2019-01-12 17:55:14,939 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3043 transitions. Word has length 100 [2019-01-12 17:55:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:14,939 INFO L480 AbstractCegarLoop]: Abstraction has 2087 states and 3043 transitions. [2019-01-12 17:55:14,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3043 transitions. [2019-01-12 17:55:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 17:55:14,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:14,942 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 17:55:14,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1007064308, now seen corresponding path program 1 times [2019-01-12 17:55:14,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:14,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:14,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:14,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:15,208 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 17:55:15,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:15,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:15,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:15,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:15,209 INFO L87 Difference]: Start difference. First operand 2087 states and 3043 transitions. Second operand 4 states. [2019-01-12 17:55:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:15,619 INFO L93 Difference]: Finished difference Result 6026 states and 8773 transitions. [2019-01-12 17:55:15,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:15,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-12 17:55:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:15,637 INFO L225 Difference]: With dead ends: 6026 [2019-01-12 17:55:15,637 INFO L226 Difference]: Without dead ends: 3978 [2019-01-12 17:55:15,640 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 17:55:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2019-01-12 17:55:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3976. [2019-01-12 17:55:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-01-12 17:55:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5737 transitions. [2019-01-12 17:55:16,041 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5737 transitions. Word has length 102 [2019-01-12 17:55:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 3976 states and 5737 transitions. [2019-01-12 17:55:16,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5737 transitions. [2019-01-12 17:55:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 17:55:16,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:16,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:55:16,046 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1753273302, now seen corresponding path program 1 times [2019-01-12 17:55:16,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:16,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:16,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:16,121 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 17:55:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:16,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:16,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:16,122 INFO L87 Difference]: Start difference. First operand 3976 states and 5737 transitions. Second operand 3 states. [2019-01-12 17:55:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:16,420 INFO L93 Difference]: Finished difference Result 11742 states and 16970 transitions. [2019-01-12 17:55:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:16,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-12 17:55:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:16,444 INFO L225 Difference]: With dead ends: 11742 [2019-01-12 17:55:16,444 INFO L226 Difference]: Without dead ends: 7868 [2019-01-12 17:55:16,451 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 17:55:16,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-01-12 17:55:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 3982. [2019-01-12 17:55:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2019-01-12 17:55:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5743 transitions. [2019-01-12 17:55:16,811 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5743 transitions. Word has length 103 [2019-01-12 17:55:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:16,812 INFO L480 AbstractCegarLoop]: Abstraction has 3982 states and 5743 transitions. [2019-01-12 17:55:16,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5743 transitions. [2019-01-12 17:55:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 17:55:16,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:16,817 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] [2019-01-12 17:55:16,817 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1236928437, now seen corresponding path program 1 times [2019-01-12 17:55:16,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:16,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:16,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:17,019 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 17:55:17,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:17,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:17,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:17,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:17,021 INFO L87 Difference]: Start difference. First operand 3982 states and 5743 transitions. Second operand 4 states. [2019-01-12 17:55:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:17,425 INFO L93 Difference]: Finished difference Result 7926 states and 11434 transitions. [2019-01-12 17:55:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:17,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-01-12 17:55:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:17,440 INFO L225 Difference]: With dead ends: 7926 [2019-01-12 17:55:17,440 INFO L226 Difference]: Without dead ends: 3976 [2019-01-12 17:55:17,445 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 17:55:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2019-01-12 17:55:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 3976. [2019-01-12 17:55:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2019-01-12 17:55:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5731 transitions. [2019-01-12 17:55:17,665 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5731 transitions. Word has length 104 [2019-01-12 17:55:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:17,665 INFO L480 AbstractCegarLoop]: Abstraction has 3976 states and 5731 transitions. [2019-01-12 17:55:17,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5731 transitions. [2019-01-12 17:55:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-12 17:55:17,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:17,670 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] [2019-01-12 17:55:17,670 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1273450697, now seen corresponding path program 1 times [2019-01-12 17:55:17,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:17,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:17,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:17,773 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 17:55:17,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:17,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:17,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:17,774 INFO L87 Difference]: Start difference. First operand 3976 states and 5731 transitions. Second operand 3 states. [2019-01-12 17:55:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:18,222 INFO L93 Difference]: Finished difference Result 9203 states and 13379 transitions. [2019-01-12 17:55:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:18,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-12 17:55:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:18,235 INFO L225 Difference]: With dead ends: 9203 [2019-01-12 17:55:18,235 INFO L226 Difference]: Without dead ends: 5907 [2019-01-12 17:55:18,241 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 17:55:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5907 states. [2019-01-12 17:55:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5907 to 5905. [2019-01-12 17:55:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5905 states. [2019-01-12 17:55:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5905 states to 5905 states and 8371 transitions. [2019-01-12 17:55:18,638 INFO L78 Accepts]: Start accepts. Automaton has 5905 states and 8371 transitions. Word has length 104 [2019-01-12 17:55:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:18,639 INFO L480 AbstractCegarLoop]: Abstraction has 5905 states and 8371 transitions. [2019-01-12 17:55:18,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5905 states and 8371 transitions. [2019-01-12 17:55:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 17:55:18,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:18,645 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 17:55:18,645 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1563202857, now seen corresponding path program 1 times [2019-01-12 17:55:18,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:18,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:18,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:18,846 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 17:55:18,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:18,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:18,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:18,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:18,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:18,848 INFO L87 Difference]: Start difference. First operand 5905 states and 8371 transitions. Second operand 4 states. [2019-01-12 17:55:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:19,225 INFO L93 Difference]: Finished difference Result 10977 states and 15574 transitions. [2019-01-12 17:55:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:19,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-01-12 17:55:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:19,235 INFO L225 Difference]: With dead ends: 10977 [2019-01-12 17:55:19,235 INFO L226 Difference]: Without dead ends: 5340 [2019-01-12 17:55:19,242 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 17:55:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2019-01-12 17:55:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5303. [2019-01-12 17:55:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-01-12 17:55:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 7467 transitions. [2019-01-12 17:55:19,700 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 7467 transitions. Word has length 106 [2019-01-12 17:55:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:19,701 INFO L480 AbstractCegarLoop]: Abstraction has 5303 states and 7467 transitions. [2019-01-12 17:55:19,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 7467 transitions. [2019-01-12 17:55:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 17:55:19,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:19,706 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 17:55:19,706 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1863296286, now seen corresponding path program 1 times [2019-01-12 17:55:19,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:19,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:19,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:19,897 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 17:55:19,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:19,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:19,898 INFO L87 Difference]: Start difference. First operand 5303 states and 7467 transitions. Second operand 4 states. [2019-01-12 17:55:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:20,364 INFO L93 Difference]: Finished difference Result 10601 states and 14931 transitions. [2019-01-12 17:55:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:20,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 17:55:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:20,374 INFO L225 Difference]: With dead ends: 10601 [2019-01-12 17:55:20,375 INFO L226 Difference]: Without dead ends: 5449 [2019-01-12 17:55:20,381 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 17:55:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-01-12 17:55:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5395. [2019-01-12 17:55:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5395 states. [2019-01-12 17:55:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 7560 transitions. [2019-01-12 17:55:20,902 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 7560 transitions. Word has length 108 [2019-01-12 17:55:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:20,902 INFO L480 AbstractCegarLoop]: Abstraction has 5395 states and 7560 transitions. [2019-01-12 17:55:20,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 7560 transitions. [2019-01-12 17:55:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 17:55:20,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:20,907 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] [2019-01-12 17:55:20,907 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash -739400144, now seen corresponding path program 1 times [2019-01-12 17:55:20,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:20,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:20,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:20,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:20,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:20,983 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 17:55:20,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:20,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:20,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:20,984 INFO L87 Difference]: Start difference. First operand 5395 states and 7560 transitions. Second operand 3 states. [2019-01-12 17:55:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:21,826 INFO L93 Difference]: Finished difference Result 14244 states and 20130 transitions. [2019-01-12 17:55:21,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:21,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-12 17:55:21,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:21,840 INFO L225 Difference]: With dead ends: 14244 [2019-01-12 17:55:21,840 INFO L226 Difference]: Without dead ends: 10589 [2019-01-12 17:55:21,846 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 17:55:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10589 states. [2019-01-12 17:55:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10589 to 5405. [2019-01-12 17:55:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-01-12 17:55:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7570 transitions. [2019-01-12 17:55:22,361 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7570 transitions. Word has length 109 [2019-01-12 17:55:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:22,361 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 7570 transitions. [2019-01-12 17:55:22,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7570 transitions. [2019-01-12 17:55:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:55:22,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:22,366 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 17:55:22,366 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 457490185, now seen corresponding path program 1 times [2019-01-12 17:55:22,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:22,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:22,458 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 17:55:22,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:22,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:55:22,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:55:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:55:22,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:55:22,459 INFO L87 Difference]: Start difference. First operand 5405 states and 7570 transitions. Second operand 3 states. [2019-01-12 17:55:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:23,221 INFO L93 Difference]: Finished difference Result 11159 states and 16678 transitions. [2019-01-12 17:55:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:55:23,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-12 17:55:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:23,234 INFO L225 Difference]: With dead ends: 11159 [2019-01-12 17:55:23,234 INFO L226 Difference]: Without dead ends: 8282 [2019-01-12 17:55:23,240 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 17:55:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-01-12 17:55:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 8259. [2019-01-12 17:55:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-01-12 17:55:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 11955 transitions. [2019-01-12 17:55:23,990 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 11955 transitions. Word has length 110 [2019-01-12 17:55:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:23,990 INFO L480 AbstractCegarLoop]: Abstraction has 8259 states and 11955 transitions. [2019-01-12 17:55:23,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:55:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 11955 transitions. [2019-01-12 17:55:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:55:23,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:23,993 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 17:55:23,994 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 279020462, now seen corresponding path program 1 times [2019-01-12 17:55:23,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:23,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:23,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:23,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:23,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:24,286 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 17:55:24,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:24,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 17:55:24,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:55:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:55:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:55:24,288 INFO L87 Difference]: Start difference. First operand 8259 states and 11955 transitions. Second operand 5 states. [2019-01-12 17:55:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:25,221 INFO L93 Difference]: Finished difference Result 14429 states and 21458 transitions. [2019-01-12 17:55:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:25,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-01-12 17:55:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:25,230 INFO L225 Difference]: With dead ends: 14429 [2019-01-12 17:55:25,230 INFO L226 Difference]: Without dead ends: 8261 [2019-01-12 17:55:25,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 17:55:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2019-01-12 17:55:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 8259. [2019-01-12 17:55:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8259 states. [2019-01-12 17:55:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8259 states to 8259 states and 11892 transitions. [2019-01-12 17:55:26,081 INFO L78 Accepts]: Start accepts. Automaton has 8259 states and 11892 transitions. Word has length 110 [2019-01-12 17:55:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:26,081 INFO L480 AbstractCegarLoop]: Abstraction has 8259 states and 11892 transitions. [2019-01-12 17:55:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:55:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8259 states and 11892 transitions. [2019-01-12 17:55:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:55:26,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:26,085 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 17:55:26,086 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash -747341858, now seen corresponding path program 1 times [2019-01-12 17:55:26,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:26,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:26,294 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 17:55:26,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:26,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:26,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:26,295 INFO L87 Difference]: Start difference. First operand 8259 states and 11892 transitions. Second operand 4 states. [2019-01-12 17:55:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:27,030 INFO L93 Difference]: Finished difference Result 16626 states and 23899 transitions. [2019-01-12 17:55:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:27,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-01-12 17:55:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:27,038 INFO L225 Difference]: With dead ends: 16626 [2019-01-12 17:55:27,038 INFO L226 Difference]: Without dead ends: 8622 [2019-01-12 17:55:27,045 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 17:55:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8622 states. [2019-01-12 17:55:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8622 to 8485. [2019-01-12 17:55:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8485 states. [2019-01-12 17:55:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8485 states to 8485 states and 12125 transitions. [2019-01-12 17:55:27,853 INFO L78 Accepts]: Start accepts. Automaton has 8485 states and 12125 transitions. Word has length 110 [2019-01-12 17:55:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:27,853 INFO L480 AbstractCegarLoop]: Abstraction has 8485 states and 12125 transitions. [2019-01-12 17:55:27,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 8485 states and 12125 transitions. [2019-01-12 17:55:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 17:55:27,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:27,857 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 17:55:27,857 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash 277574495, now seen corresponding path program 1 times [2019-01-12 17:55:27,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:27,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:27,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:28,043 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 17:55:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:55:28,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:55:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:55:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:55:28,047 INFO L87 Difference]: Start difference. First operand 8485 states and 12125 transitions. Second operand 4 states. [2019-01-12 17:55:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:28,992 INFO L93 Difference]: Finished difference Result 11836 states and 17001 transitions. [2019-01-12 17:55:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:55:28,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-01-12 17:55:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:28,999 INFO L225 Difference]: With dead ends: 11836 [2019-01-12 17:55:28,999 INFO L226 Difference]: Without dead ends: 7346 [2019-01-12 17:55:29,004 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 17:55:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2019-01-12 17:55:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 7346. [2019-01-12 17:55:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7346 states. [2019-01-12 17:55:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7346 states to 7346 states and 10477 transitions. [2019-01-12 17:55:29,580 INFO L78 Accepts]: Start accepts. Automaton has 7346 states and 10477 transitions. Word has length 110 [2019-01-12 17:55:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:29,580 INFO L480 AbstractCegarLoop]: Abstraction has 7346 states and 10477 transitions. [2019-01-12 17:55:29,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:55:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7346 states and 10477 transitions. [2019-01-12 17:55:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 17:55:29,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:29,584 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 17:55:29,584 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1751147279, now seen corresponding path program 1 times [2019-01-12 17:55:29,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:29,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:55:30,179 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-01-12 17:55:31,146 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 17:55:31,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:55:31,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-12 17:55:31,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 17:55:31,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 17:55:31,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-01-12 17:55:31,148 INFO L87 Difference]: Start difference. First operand 7346 states and 10477 transitions. Second operand 23 states. [2019-01-12 17:55:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:55:35,984 INFO L93 Difference]: Finished difference Result 15589 states and 22626 transitions. [2019-01-12 17:55:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 17:55:35,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 112 [2019-01-12 17:55:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:55:36,002 INFO L225 Difference]: With dead ends: 15589 [2019-01-12 17:55:36,002 INFO L226 Difference]: Without dead ends: 13213 [2019-01-12 17:55:36,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 17:55:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13213 states. [2019-01-12 17:55:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13213 to 7847. [2019-01-12 17:55:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7847 states. [2019-01-12 17:55:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7847 states to 7847 states and 11090 transitions. [2019-01-12 17:55:36,970 INFO L78 Accepts]: Start accepts. Automaton has 7847 states and 11090 transitions. Word has length 112 [2019-01-12 17:55:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:55:36,971 INFO L480 AbstractCegarLoop]: Abstraction has 7847 states and 11090 transitions. [2019-01-12 17:55:36,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 17:55:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7847 states and 11090 transitions. [2019-01-12 17:55:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 17:55:36,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:55:36,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:55:36,975 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:55:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:55:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash 26877819, now seen corresponding path program 1 times [2019-01-12 17:55:36,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:55:36,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:55:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:36,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:55:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:55:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:55:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 17:55:37,149 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 17:55:37,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:55:37 BoogieIcfgContainer [2019-01-12 17:55:37,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 17:55:37,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 17:55:37,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 17:55:37,350 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 17:55:37,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:55:07" (3/4) ... [2019-01-12 17:55:37,354 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 17:55:37,587 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 17:55:37,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 17:55:37,588 INFO L168 Benchmark]: Toolchain (without parser) took 33211.37 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 951.4 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 425.9 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:37,589 INFO L168 Benchmark]: CDTParser took 0.15 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 17:55:37,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:37,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:37,591 INFO L168 Benchmark]: Boogie Preprocessor took 55.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 17:55:37,591 INFO L168 Benchmark]: RCFGBuilder took 1906.20 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: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:37,592 INFO L168 Benchmark]: TraceAbstraction took 30245.84 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 319.8 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:37,593 INFO L168 Benchmark]: Witness Printer took 238.87 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-01-12 17:55:37,595 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.15 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 603.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 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 155.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1906.20 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: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30245.84 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 319.8 MB. Max. memory is 11.5 GB. * Witness Printer took 238.87 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 527]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L64] int __return_1131; [L65] int __return_1259; [L66] int __return_1378; [L67] int __tmp_1379_0; [L68] int __return_1487; [L69] int __return_1392; VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L72] int main__c1; [L73] int main__i2; [L74] main__c1 = 0 [L75] ep12 = __VERIFIER_nondet_bool() [L76] ep13 = __VERIFIER_nondet_bool() [L77] ep21 = __VERIFIER_nondet_bool() [L78] ep23 = __VERIFIER_nondet_bool() [L79] ep31 = __VERIFIER_nondet_bool() [L80] ep32 = __VERIFIER_nondet_bool() [L81] id1 = __VERIFIER_nondet_char() [L82] r1 = __VERIFIER_nondet_char() [L83] st1 = __VERIFIER_nondet_char() [L84] nl1 = __VERIFIER_nondet_char() [L85] m1 = __VERIFIER_nondet_char() [L86] max1 = __VERIFIER_nondet_char() [L87] mode1 = __VERIFIER_nondet_bool() [L88] id2 = __VERIFIER_nondet_char() [L89] r2 = __VERIFIER_nondet_char() [L90] st2 = __VERIFIER_nondet_char() [L91] nl2 = __VERIFIER_nondet_char() [L92] m2 = __VERIFIER_nondet_char() [L93] max2 = __VERIFIER_nondet_char() [L94] mode2 = __VERIFIER_nondet_bool() [L95] id3 = __VERIFIER_nondet_char() [L96] r3 = __VERIFIER_nondet_char() [L97] st3 = __VERIFIER_nondet_char() [L98] nl3 = __VERIFIER_nondet_char() [L99] m3 = __VERIFIER_nondet_char() [L100] max3 = __VERIFIER_nondet_char() [L101] mode3 = __VERIFIER_nondet_bool() [L103] _Bool init__r121; [L104] _Bool init__r131; [L105] _Bool init__r211; [L106] _Bool init__r231; [L107] _Bool init__r311; [L108] _Bool init__r321; [L109] _Bool init__r122; [L110] int init__tmp; [L111] _Bool init__r132; [L112] int init__tmp___0; [L113] _Bool init__r212; [L114] int init__tmp___1; [L115] _Bool init__r232; [L116] int init__tmp___2; [L117] _Bool init__r312; [L118] int init__tmp___3; [L119] _Bool init__r322; [L120] int init__tmp___4; [L121] int init__tmp___5; [L122] init__r121 = ep12 [L123] init__r131 = ep13 [L124] init__r211 = ep21 [L125] init__r231 = ep23 [L126] init__r311 = ep31 [L127] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L128] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1617] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1619] COND TRUE !(ep32 == 0) [L1621] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L132] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L133] COND TRUE !(init__r131 == 0) [L135] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L137] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] COND TRUE !(init__r211 == 0) [L140] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L142] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1548] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1550] COND TRUE !(ep13 == 0) [L1552] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1525] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1527] COND TRUE !(ep21 == 0) [L1529] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r321 == 0) [L155] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L160] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)mode3) == 0 [L212] init__tmp___5 = 1 [L213] __return_1131 = init__tmp___5 [L214] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE main__i2 != 0 [L217] p12_old = nomsg [L218] p12_new = nomsg [L219] p13_old = nomsg [L220] p13_new = nomsg [L221] p21_old = nomsg [L222] p21_new = nomsg [L223] p23_old = nomsg [L224] p23_new = nomsg [L225] p31_old = nomsg [L226] p31_new = nomsg [L227] p32_old = nomsg [L228] p32_new = nomsg [L229] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L233] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE !(ep13 == 0) [L254] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND TRUE p13_new == nomsg [L259] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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 !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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] [L271] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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] [L273] COND TRUE !(ep21 == 0) [L275] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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] [L276] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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] COND TRUE p21_new == nomsg [L280] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, 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] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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] [L295] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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] [L297] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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 ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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 FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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] [L316] COND TRUE !(ep32 == 0) [L318] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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] [L319] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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] [L321] COND TRUE p32_new == nomsg [L323] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, 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] [L325] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=124, p13_old=-1, p21=0, p21_new=123, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=122, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L327] mode3 = 1 [L328] p12_old = p12_new [L329] p12_new = nomsg [L330] p13_old = p13_new [L331] p13_new = nomsg [L332] p21_old = p21_new [L333] p21_new = nomsg [L334] p23_old = p23_new [L335] p23_new = nomsg [L336] p31_old = p31_new [L337] p31_new = nomsg [L338] p32_old = p32_new [L339] p32_new = nomsg [L341] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((int)r1) < 2 [L370] check__tmp = 1 [L371] __return_1259 = check__tmp [L372] main__c1 = __return_1259 [L374] _Bool __tmp_1; [L375] __tmp_1 = main__c1 [L376] _Bool assert__arg; [L377] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(assert__arg == 0) [L384] int main____CPAchecker_TMP_0 = main__i2; [L385] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND TRUE !(mode1 == 0) [L391] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=0, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=123, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE !(ep21 == 0) [L394] m1 = p21_old [L395] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((int)max1) == ((int)id1) [L412] st1 = 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L414] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L416] COND TRUE !(mode2 == 0) [L418] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L419] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=0, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=122, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L427] COND TRUE !(ep32 == 0) [L429] m2 = p32_old [L430] p32_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=0, st1=1, st2=0, st3=0] [L431] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=0, st1=1, st2=0, st3=0] [L435] COND FALSE !(((int)r2) == 2) [L441] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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=0, st1=1, st2=0, st3=0] [L443] COND TRUE !(mode3 == 0) [L445] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=0, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=124, 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] [L446] COND TRUE !(ep13 == 0) [L448] m3 = p13_old [L449] p13_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=122, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L450] COND TRUE ((int)m3) > ((int)max3) [L452] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L454] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L462] COND FALSE !(((int)r3) == 2) [L468] mode3 = 0 [L469] p12_old = p12_new [L470] p12_new = nomsg [L471] p13_old = p13_new [L472] p13_new = nomsg [L473] p21_old = p21_new [L474] p21_new = nomsg [L475] p23_old = p23_new [L476] p23_new = nomsg [L477] p31_old = p31_new [L478] p31_new = nomsg [L479] p32_old = p32_new [L480] p32_new = nomsg [L482] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L483] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L485] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L487] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L489] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L491] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1065] check__tmp = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L515] __return_1378 = check__tmp [L516] main__c1 = __return_1378 [L517] __tmp_1379_0 = main____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L519] main____CPAchecker_TMP_0 = __tmp_1379_0 [L521] _Bool __tmp_2; [L522] __tmp_2 = main__c1 [L523] _Bool assert__arg; [L524] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L525] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L527] __VERIFIER_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=124, id2=123, id3=122, m1=123, m2=122, m3=124, max1=124, max2=123, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 218 locations, 1 error locations. UNSAFE Result, 30.1s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9284 SDtfs, 11092 SDslu, 11562 SDs, 0 SdLazy, 2470 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8485occurred in iteration=19, 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: 7.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 15307 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2271 NumberOfCodeBlocks, 2271 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2138 ConstructedInterpolants, 0 QuantifiedInterpolants, 874064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...