./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-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 5502f9672f054c34b790763a9f35b59444705f97 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 20:07:15,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 20:07:15,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 20:07:15,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 20:07:15,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 20:07:15,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 20:07:15,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 20:07:15,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 20:07:15,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 20:07:15,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 20:07:15,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 20:07:15,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 20:07:15,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 20:07:15,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 20:07:15,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 20:07:15,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 20:07:15,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 20:07:15,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 20:07:15,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 20:07:15,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 20:07:15,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 20:07:15,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 20:07:15,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 20:07:15,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 20:07:15,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 20:07:15,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 20:07:15,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 20:07:15,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 20:07:15,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 20:07:15,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 20:07:15,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 20:07:15,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 20:07:15,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 20:07:15,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 20:07:15,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 20:07:15,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 20:07:15,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 20:07:15,222 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 20:07:15,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 20:07:15,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 20:07:15,224 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 20:07:15,224 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 20:07:15,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 20:07:15,224 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 20:07:15,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 20:07:15,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 20:07:15,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 20:07:15,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 20:07:15,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 20:07:15,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 20:07:15,226 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 20:07:15,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 20:07:15,227 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 20:07:15,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 20:07:15,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 20:07:15,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 20:07:15,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 20:07:15,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 20:07:15,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 20:07:15,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 20:07:15,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 20:07:15,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 20:07:15,229 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 20:07:15,229 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 20:07:15,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 20:07:15,230 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 -> 5502f9672f054c34b790763a9f35b59444705f97 [2019-01-12 20:07:15,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 20:07:15,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 20:07:15,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 20:07:15,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 20:07:15,300 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 20:07:15,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-01-12 20:07:15,357 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8115076c/8bd38d6d03c84e72a686560a81dd037a/FLAG71aba8c90 [2019-01-12 20:07:15,835 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 20:07:15,836 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-01-12 20:07:15,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8115076c/8bd38d6d03c84e72a686560a81dd037a/FLAG71aba8c90 [2019-01-12 20:07:16,163 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8115076c/8bd38d6d03c84e72a686560a81dd037a [2019-01-12 20:07:16,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 20:07:16,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 20:07:16,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 20:07:16,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 20:07:16,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 20:07:16,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:16,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ef7ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16, skipping insertion in model container [2019-01-12 20:07:16,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:16,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 20:07:16,253 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 20:07:16,691 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 20:07:16,715 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 20:07:16,956 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 20:07:16,978 INFO L195 MainTranslator]: Completed translation [2019-01-12 20:07:16,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16 WrapperNode [2019-01-12 20:07:16,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 20:07:16,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 20:07:16,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 20:07:16,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 20:07:16,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 20:07:17,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 20:07:17,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 20:07:17,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 20:07:17,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... [2019-01-12 20:07:17,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 20:07:17,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 20:07:17,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 20:07:17,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 20:07:17,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 20:07:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 20:07:17,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 20:07:19,475 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 20:07:19,476 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 20:07:19,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:07:19 BoogieIcfgContainer [2019-01-12 20:07:19,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 20:07:19,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 20:07:19,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 20:07:19,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 20:07:19,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:07:16" (1/3) ... [2019-01-12 20:07:19,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340af52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:07:19, skipping insertion in model container [2019-01-12 20:07:19,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:07:16" (2/3) ... [2019-01-12 20:07:19,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340af52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:07:19, skipping insertion in model container [2019-01-12 20:07:19,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:07:19" (3/3) ... [2019-01-12 20:07:19,485 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-01-12 20:07:19,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 20:07:19,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 20:07:19,521 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 20:07:19,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 20:07:19,557 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 20:07:19,557 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 20:07:19,557 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 20:07:19,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 20:07:19,558 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 20:07:19,558 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 20:07:19,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 20:07:19,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 20:07:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2019-01-12 20:07:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 20:07:19,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:19,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:19,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1276327155, now seen corresponding path program 1 times [2019-01-12 20:07:19,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:19,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:20,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:20,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:20,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:20,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:20,428 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 4 states. [2019-01-12 20:07:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:20,835 INFO L93 Difference]: Finished difference Result 782 states and 1378 transitions. [2019-01-12 20:07:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:20,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-12 20:07:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:20,864 INFO L225 Difference]: With dead ends: 782 [2019-01-12 20:07:20,864 INFO L226 Difference]: Without dead ends: 515 [2019-01-12 20:07:20,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-01-12 20:07:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 492. [2019-01-12 20:07:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-01-12 20:07:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 718 transitions. [2019-01-12 20:07:20,998 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 718 transitions. Word has length 98 [2019-01-12 20:07:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:21,000 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 718 transitions. [2019-01-12 20:07:21,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 718 transitions. [2019-01-12 20:07:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 20:07:21,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:21,009 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] [2019-01-12 20:07:21,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1180437433, now seen corresponding path program 1 times [2019-01-12 20:07:21,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:21,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:21,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:21,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:21,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:21,125 INFO L87 Difference]: Start difference. First operand 492 states and 718 transitions. Second operand 3 states. [2019-01-12 20:07:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:21,262 INFO L93 Difference]: Finished difference Result 1438 states and 2092 transitions. [2019-01-12 20:07:21,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:21,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-12 20:07:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:21,275 INFO L225 Difference]: With dead ends: 1438 [2019-01-12 20:07:21,275 INFO L226 Difference]: Without dead ends: 974 [2019-01-12 20:07:21,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-01-12 20:07:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 494. [2019-01-12 20:07:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-01-12 20:07:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 720 transitions. [2019-01-12 20:07:21,352 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 720 transitions. Word has length 99 [2019-01-12 20:07:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:21,353 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 720 transitions. [2019-01-12 20:07:21,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 720 transitions. [2019-01-12 20:07:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 20:07:21,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:21,361 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 20:07:21,362 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -56994056, now seen corresponding path program 1 times [2019-01-12 20:07:21,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:21,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:21,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:21,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:21,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:21,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:21,521 INFO L87 Difference]: Start difference. First operand 494 states and 720 transitions. Second operand 3 states. [2019-01-12 20:07:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:21,731 INFO L93 Difference]: Finished difference Result 1025 states and 1550 transitions. [2019-01-12 20:07:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 20:07:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:21,740 INFO L225 Difference]: With dead ends: 1025 [2019-01-12 20:07:21,741 INFO L226 Difference]: Without dead ends: 658 [2019-01-12 20:07:21,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-01-12 20:07:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 642. [2019-01-12 20:07:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-01-12 20:07:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 964 transitions. [2019-01-12 20:07:21,795 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 964 transitions. Word has length 100 [2019-01-12 20:07:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:21,796 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 964 transitions. [2019-01-12 20:07:21,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 964 transitions. [2019-01-12 20:07:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 20:07:21,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:21,803 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 20:07:21,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:21,804 INFO L82 PathProgramCache]: Analyzing trace with hash 329606004, now seen corresponding path program 1 times [2019-01-12 20:07:21,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:21,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:22,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:22,003 INFO L87 Difference]: Start difference. First operand 642 states and 964 transitions. Second operand 4 states. [2019-01-12 20:07:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:22,168 INFO L93 Difference]: Finished difference Result 1274 states and 1914 transitions. [2019-01-12 20:07:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:22,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 20:07:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:22,173 INFO L225 Difference]: With dead ends: 1274 [2019-01-12 20:07:22,173 INFO L226 Difference]: Without dead ends: 640 [2019-01-12 20:07:22,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-01-12 20:07:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-01-12 20:07:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-01-12 20:07:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2019-01-12 20:07:22,252 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 100 [2019-01-12 20:07:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:22,253 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2019-01-12 20:07:22,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2019-01-12 20:07:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 20:07:22,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:22,254 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 20:07:22,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:22,255 INFO L82 PathProgramCache]: Analyzing trace with hash 902258575, now seen corresponding path program 1 times [2019-01-12 20:07:22,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:22,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:22,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:22,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:22,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:22,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:22,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:22,398 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 3 states. [2019-01-12 20:07:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:22,718 INFO L93 Difference]: Finished difference Result 1404 states and 2123 transitions. [2019-01-12 20:07:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:22,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 20:07:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:22,726 INFO L225 Difference]: With dead ends: 1404 [2019-01-12 20:07:22,726 INFO L226 Difference]: Without dead ends: 955 [2019-01-12 20:07:22,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-01-12 20:07:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 934. [2019-01-12 20:07:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-01-12 20:07:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1387 transitions. [2019-01-12 20:07:22,798 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1387 transitions. Word has length 100 [2019-01-12 20:07:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:22,799 INFO L480 AbstractCegarLoop]: Abstraction has 934 states and 1387 transitions. [2019-01-12 20:07:22,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1387 transitions. [2019-01-12 20:07:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 20:07:22,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:22,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:22,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash -569395796, now seen corresponding path program 1 times [2019-01-12 20:07:22,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:22,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:22,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:22,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:22,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:22,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:22,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:22,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:22,897 INFO L87 Difference]: Start difference. First operand 934 states and 1387 transitions. Second operand 3 states. [2019-01-12 20:07:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:23,233 INFO L93 Difference]: Finished difference Result 2030 states and 3129 transitions. [2019-01-12 20:07:23,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:23,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-12 20:07:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:23,245 INFO L225 Difference]: With dead ends: 2030 [2019-01-12 20:07:23,245 INFO L226 Difference]: Without dead ends: 1362 [2019-01-12 20:07:23,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2019-01-12 20:07:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1318. [2019-01-12 20:07:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-01-12 20:07:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 2010 transitions. [2019-01-12 20:07:23,382 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 2010 transitions. Word has length 102 [2019-01-12 20:07:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:23,384 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 2010 transitions. [2019-01-12 20:07:23,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 2010 transitions. [2019-01-12 20:07:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 20:07:23,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:23,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:23,388 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1182950444, now seen corresponding path program 1 times [2019-01-12 20:07:23,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:23,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:23,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:23,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:23,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:23,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:23,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:23,757 INFO L87 Difference]: Start difference. First operand 1318 states and 2010 transitions. Second operand 4 states. [2019-01-12 20:07:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:24,542 INFO L93 Difference]: Finished difference Result 3362 states and 5134 transitions. [2019-01-12 20:07:24,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:24,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 20:07:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:24,556 INFO L225 Difference]: With dead ends: 3362 [2019-01-12 20:07:24,556 INFO L226 Difference]: Without dead ends: 2063 [2019-01-12 20:07:24,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-01-12 20:07:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2048. [2019-01-12 20:07:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-01-12 20:07:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3110 transitions. [2019-01-12 20:07:24,773 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3110 transitions. Word has length 103 [2019-01-12 20:07:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:24,774 INFO L480 AbstractCegarLoop]: Abstraction has 2048 states and 3110 transitions. [2019-01-12 20:07:24,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3110 transitions. [2019-01-12 20:07:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 20:07:24,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:24,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:24,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2046313953, now seen corresponding path program 1 times [2019-01-12 20:07:24,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:24,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:24,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:24,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:24,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:24,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:24,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:24,964 INFO L87 Difference]: Start difference. First operand 2048 states and 3110 transitions. Second operand 4 states. [2019-01-12 20:07:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:25,399 INFO L93 Difference]: Finished difference Result 3587 states and 5470 transitions. [2019-01-12 20:07:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:25,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-01-12 20:07:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:25,416 INFO L225 Difference]: With dead ends: 3587 [2019-01-12 20:07:25,416 INFO L226 Difference]: Without dead ends: 2048 [2019-01-12 20:07:25,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-01-12 20:07:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-01-12 20:07:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-01-12 20:07:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3109 transitions. [2019-01-12 20:07:25,664 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3109 transitions. Word has length 105 [2019-01-12 20:07:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:25,665 INFO L480 AbstractCegarLoop]: Abstraction has 2048 states and 3109 transitions. [2019-01-12 20:07:25,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3109 transitions. [2019-01-12 20:07:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 20:07:25,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:25,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:25,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash 499752606, now seen corresponding path program 1 times [2019-01-12 20:07:25,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:25,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:25,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:25,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 20:07:25,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:25,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:25,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:25,775 INFO L87 Difference]: Start difference. First operand 2048 states and 3109 transitions. Second operand 3 states. [2019-01-12 20:07:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:26,262 INFO L93 Difference]: Finished difference Result 4814 states and 7397 transitions. [2019-01-12 20:07:26,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:26,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-12 20:07:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:26,279 INFO L225 Difference]: With dead ends: 4814 [2019-01-12 20:07:26,280 INFO L226 Difference]: Without dead ends: 3121 [2019-01-12 20:07:26,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2019-01-12 20:07:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3108. [2019-01-12 20:07:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2019-01-12 20:07:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4693 transitions. [2019-01-12 20:07:26,512 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4693 transitions. Word has length 105 [2019-01-12 20:07:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:26,513 INFO L480 AbstractCegarLoop]: Abstraction has 3108 states and 4693 transitions. [2019-01-12 20:07:26,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4693 transitions. [2019-01-12 20:07:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 20:07:26,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:26,517 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] [2019-01-12 20:07:26,517 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1602371620, now seen corresponding path program 1 times [2019-01-12 20:07:26,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:26,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:26,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:26,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:26,619 INFO L87 Difference]: Start difference. First operand 3108 states and 4693 transitions. Second operand 3 states. [2019-01-12 20:07:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:27,144 INFO L93 Difference]: Finished difference Result 7808 states and 12102 transitions. [2019-01-12 20:07:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:27,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-01-12 20:07:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:27,169 INFO L225 Difference]: With dead ends: 7808 [2019-01-12 20:07:27,169 INFO L226 Difference]: Without dead ends: 5032 [2019-01-12 20:07:27,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2019-01-12 20:07:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4826. [2019-01-12 20:07:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4826 states. [2019-01-12 20:07:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 7456 transitions. [2019-01-12 20:07:27,596 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 7456 transitions. Word has length 107 [2019-01-12 20:07:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:27,596 INFO L480 AbstractCegarLoop]: Abstraction has 4826 states and 7456 transitions. [2019-01-12 20:07:27,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 7456 transitions. [2019-01-12 20:07:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 20:07:27,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:27,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:27,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1761194430, now seen corresponding path program 1 times [2019-01-12 20:07:27,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:27,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:27,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:27,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:27,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:27,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:27,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:27,692 INFO L87 Difference]: Start difference. First operand 4826 states and 7456 transitions. Second operand 3 states. [2019-01-12 20:07:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:28,959 INFO L93 Difference]: Finished difference Result 13613 states and 21275 transitions. [2019-01-12 20:07:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:28,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-01-12 20:07:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:29,005 INFO L225 Difference]: With dead ends: 13613 [2019-01-12 20:07:29,006 INFO L226 Difference]: Without dead ends: 9343 [2019-01-12 20:07:29,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9343 states. [2019-01-12 20:07:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9343 to 9271. [2019-01-12 20:07:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9271 states. [2019-01-12 20:07:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9271 states to 9271 states and 14362 transitions. [2019-01-12 20:07:29,672 INFO L78 Accepts]: Start accepts. Automaton has 9271 states and 14362 transitions. Word has length 108 [2019-01-12 20:07:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:29,672 INFO L480 AbstractCegarLoop]: Abstraction has 9271 states and 14362 transitions. [2019-01-12 20:07:29,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9271 states and 14362 transitions. [2019-01-12 20:07:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 20:07:29,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:29,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:29,676 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1561444797, now seen corresponding path program 1 times [2019-01-12 20:07:29,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:29,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:29,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:29,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:29,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:29,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:29,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:29,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:29,940 INFO L87 Difference]: Start difference. First operand 9271 states and 14362 transitions. Second operand 4 states. [2019-01-12 20:07:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:31,041 INFO L93 Difference]: Finished difference Result 25944 states and 40109 transitions. [2019-01-12 20:07:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:31,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 20:07:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:31,076 INFO L225 Difference]: With dead ends: 25944 [2019-01-12 20:07:31,077 INFO L226 Difference]: Without dead ends: 16712 [2019-01-12 20:07:31,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16712 states. [2019-01-12 20:07:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16712 to 16640. [2019-01-12 20:07:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16640 states. [2019-01-12 20:07:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16640 states to 16640 states and 25493 transitions. [2019-01-12 20:07:32,013 INFO L78 Accepts]: Start accepts. Automaton has 16640 states and 25493 transitions. Word has length 108 [2019-01-12 20:07:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:32,013 INFO L480 AbstractCegarLoop]: Abstraction has 16640 states and 25493 transitions. [2019-01-12 20:07:32,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 16640 states and 25493 transitions. [2019-01-12 20:07:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 20:07:32,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:32,026 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 20:07:32,026 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1148788313, now seen corresponding path program 1 times [2019-01-12 20:07:32,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:32,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:32,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:32,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:32,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:32,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:32,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:32,095 INFO L87 Difference]: Start difference. First operand 16640 states and 25493 transitions. Second operand 3 states. [2019-01-12 20:07:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:33,979 INFO L93 Difference]: Finished difference Result 49722 states and 76224 transitions. [2019-01-12 20:07:33,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:33,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-12 20:07:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:34,035 INFO L225 Difference]: With dead ends: 49722 [2019-01-12 20:07:34,036 INFO L226 Difference]: Without dead ends: 33190 [2019-01-12 20:07:34,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33190 states. [2019-01-12 20:07:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33190 to 16646. [2019-01-12 20:07:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16646 states. [2019-01-12 20:07:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 25499 transitions. [2019-01-12 20:07:35,445 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 25499 transitions. Word has length 109 [2019-01-12 20:07:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:35,445 INFO L480 AbstractCegarLoop]: Abstraction has 16646 states and 25499 transitions. [2019-01-12 20:07:35,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 25499 transitions. [2019-01-12 20:07:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 20:07:35,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:35,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:35,452 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash -248848316, now seen corresponding path program 1 times [2019-01-12 20:07:35,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:35,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:35,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:35,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:35,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:35,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:35,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:35,613 INFO L87 Difference]: Start difference. First operand 16646 states and 25499 transitions. Second operand 4 states. [2019-01-12 20:07:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:37,004 INFO L93 Difference]: Finished difference Result 33254 states and 50946 transitions. [2019-01-12 20:07:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:37,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-01-12 20:07:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:37,032 INFO L225 Difference]: With dead ends: 33254 [2019-01-12 20:07:37,032 INFO L226 Difference]: Without dead ends: 16640 [2019-01-12 20:07:37,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16640 states. [2019-01-12 20:07:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16640 to 16640. [2019-01-12 20:07:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16640 states. [2019-01-12 20:07:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16640 states to 16640 states and 25487 transitions. [2019-01-12 20:07:38,366 INFO L78 Accepts]: Start accepts. Automaton has 16640 states and 25487 transitions. Word has length 110 [2019-01-12 20:07:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:38,366 INFO L480 AbstractCegarLoop]: Abstraction has 16640 states and 25487 transitions. [2019-01-12 20:07:38,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16640 states and 25487 transitions. [2019-01-12 20:07:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 20:07:38,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:38,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:38,373 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1186160317, now seen corresponding path program 1 times [2019-01-12 20:07:38,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:38,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:38,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:38,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:38,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:07:38,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:07:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:07:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:38,496 INFO L87 Difference]: Start difference. First operand 16640 states and 25487 transitions. Second operand 3 states. [2019-01-12 20:07:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:40,012 INFO L93 Difference]: Finished difference Result 39717 states and 60981 transitions. [2019-01-12 20:07:40,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:07:40,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-12 20:07:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:40,043 INFO L225 Difference]: With dead ends: 39717 [2019-01-12 20:07:40,043 INFO L226 Difference]: Without dead ends: 24107 [2019-01-12 20:07:40,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:07:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24107 states. [2019-01-12 20:07:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24107 to 24035. [2019-01-12 20:07:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-01-12 20:07:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 36269 transitions. [2019-01-12 20:07:41,567 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 36269 transitions. Word has length 110 [2019-01-12 20:07:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:41,567 INFO L480 AbstractCegarLoop]: Abstraction has 24035 states and 36269 transitions. [2019-01-12 20:07:41,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:07:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 36269 transitions. [2019-01-12 20:07:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 20:07:41,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:41,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:41,576 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1247226342, now seen corresponding path program 1 times [2019-01-12 20:07:41,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:41,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:41,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 20:07:41,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:07:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:07:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:41,871 INFO L87 Difference]: Start difference. First operand 24035 states and 36269 transitions. Second operand 5 states. [2019-01-12 20:07:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:43,984 INFO L93 Difference]: Finished difference Result 44351 states and 68138 transitions. [2019-01-12 20:07:43,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:43,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-01-12 20:07:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:44,015 INFO L225 Difference]: With dead ends: 44351 [2019-01-12 20:07:44,015 INFO L226 Difference]: Without dead ends: 24131 [2019-01-12 20:07:44,036 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 20:07:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24131 states. [2019-01-12 20:07:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24131 to 24131. [2019-01-12 20:07:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24131 states. [2019-01-12 20:07:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24131 states to 24131 states and 36213 transitions. [2019-01-12 20:07:45,446 INFO L78 Accepts]: Start accepts. Automaton has 24131 states and 36213 transitions. Word has length 113 [2019-01-12 20:07:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:45,446 INFO L480 AbstractCegarLoop]: Abstraction has 24131 states and 36213 transitions. [2019-01-12 20:07:45,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:07:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 24131 states and 36213 transitions. [2019-01-12 20:07:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-12 20:07:45,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:45,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:45,454 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1602851438, now seen corresponding path program 1 times [2019-01-12 20:07:45,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:45,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:45,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:45,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:45,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:45,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:45,708 INFO L87 Difference]: Start difference. First operand 24131 states and 36213 transitions. Second operand 4 states. [2019-01-12 20:07:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:47,666 INFO L93 Difference]: Finished difference Result 46159 states and 69346 transitions. [2019-01-12 20:07:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:47,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-01-12 20:07:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:47,688 INFO L225 Difference]: With dead ends: 46159 [2019-01-12 20:07:47,688 INFO L226 Difference]: Without dead ends: 22410 [2019-01-12 20:07:47,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22410 states. [2019-01-12 20:07:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22410 to 22320. [2019-01-12 20:07:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22320 states. [2019-01-12 20:07:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22320 states to 22320 states and 33467 transitions. [2019-01-12 20:07:49,053 INFO L78 Accepts]: Start accepts. Automaton has 22320 states and 33467 transitions. Word has length 113 [2019-01-12 20:07:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:49,053 INFO L480 AbstractCegarLoop]: Abstraction has 22320 states and 33467 transitions. [2019-01-12 20:07:49,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:07:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 22320 states and 33467 transitions. [2019-01-12 20:07:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 20:07:49,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:49,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:49,060 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash -684328491, now seen corresponding path program 1 times [2019-01-12 20:07:49,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:49,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:49,491 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2019-01-12 20:07:49,652 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-01-12 20:07:49,948 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-12 20:07:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:07:50,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:50,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 20:07:50,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 20:07:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 20:07:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-01-12 20:07:50,304 INFO L87 Difference]: Start difference. First operand 22320 states and 33467 transitions. Second operand 16 states. [2019-01-12 20:07:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:55,229 INFO L93 Difference]: Finished difference Result 61871 states and 94392 transitions. [2019-01-12 20:07:55,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 20:07:55,230 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2019-01-12 20:07:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:55,276 INFO L225 Difference]: With dead ends: 61871 [2019-01-12 20:07:55,276 INFO L226 Difference]: Without dead ends: 42143 [2019-01-12 20:07:55,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-12 20:07:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42143 states. [2019-01-12 20:07:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42143 to 21508. [2019-01-12 20:07:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21508 states. [2019-01-12 20:07:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21508 states to 21508 states and 32472 transitions. [2019-01-12 20:07:57,436 INFO L78 Accepts]: Start accepts. Automaton has 21508 states and 32472 transitions. Word has length 115 [2019-01-12 20:07:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:07:57,436 INFO L480 AbstractCegarLoop]: Abstraction has 21508 states and 32472 transitions. [2019-01-12 20:07:57,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 20:07:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 21508 states and 32472 transitions. [2019-01-12 20:07:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 20:07:57,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:07:57,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:07:57,441 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:07:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:07:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2063879370, now seen corresponding path program 1 times [2019-01-12 20:07:57,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:07:57,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:07:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:07:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:07:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:07:57,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 20:07:57,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:07:57,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:07:57,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:07:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:07:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:07:57,633 INFO L87 Difference]: Start difference. First operand 21508 states and 32472 transitions. Second operand 4 states. [2019-01-12 20:07:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:07:59,676 INFO L93 Difference]: Finished difference Result 43253 states and 65231 transitions. [2019-01-12 20:07:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:07:59,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-01-12 20:07:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:07:59,702 INFO L225 Difference]: With dead ends: 43253 [2019-01-12 20:07:59,702 INFO L226 Difference]: Without dead ends: 21900 [2019-01-12 20:07:59,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:07:59,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21900 states. [2019-01-12 20:08:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21900 to 21660. [2019-01-12 20:08:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21660 states. [2019-01-12 20:08:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21660 states to 21660 states and 32638 transitions. [2019-01-12 20:08:02,266 INFO L78 Accepts]: Start accepts. Automaton has 21660 states and 32638 transitions. Word has length 115 [2019-01-12 20:08:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:02,267 INFO L480 AbstractCegarLoop]: Abstraction has 21660 states and 32638 transitions. [2019-01-12 20:08:02,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21660 states and 32638 transitions. [2019-01-12 20:08:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 20:08:02,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:02,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:02,271 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1314650694, now seen corresponding path program 1 times [2019-01-12 20:08:02,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:02,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:02,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:02,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:02,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 20:08:02,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 20:08:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 20:08:02,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:02,333 INFO L87 Difference]: Start difference. First operand 21660 states and 32638 transitions. Second operand 3 states. [2019-01-12 20:08:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:06,334 INFO L93 Difference]: Finished difference Result 58881 states and 88927 transitions. [2019-01-12 20:08:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 20:08:06,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-12 20:08:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:06,383 INFO L225 Difference]: With dead ends: 58881 [2019-01-12 20:08:06,383 INFO L226 Difference]: Without dead ends: 43113 [2019-01-12 20:08:06,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 20:08:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43113 states. [2019-01-12 20:08:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43113 to 21670. [2019-01-12 20:08:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21670 states. [2019-01-12 20:08:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21670 states to 21670 states and 32648 transitions. [2019-01-12 20:08:08,876 INFO L78 Accepts]: Start accepts. Automaton has 21670 states and 32648 transitions. Word has length 116 [2019-01-12 20:08:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:08,876 INFO L480 AbstractCegarLoop]: Abstraction has 21670 states and 32648 transitions. [2019-01-12 20:08:08,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 20:08:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21670 states and 32648 transitions. [2019-01-12 20:08:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 20:08:08,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:08,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:08,881 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -426513610, now seen corresponding path program 1 times [2019-01-12 20:08:08,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:08,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:08,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:09,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:09,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:09,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 20:08:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 20:08:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:09,097 INFO L87 Difference]: Start difference. First operand 21670 states and 32648 transitions. Second operand 5 states. [2019-01-12 20:08:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:11,648 INFO L93 Difference]: Finished difference Result 40171 states and 60967 transitions. [2019-01-12 20:08:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 20:08:11,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-01-12 20:08:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:11,672 INFO L225 Difference]: With dead ends: 40171 [2019-01-12 20:08:11,672 INFO L226 Difference]: Without dead ends: 21670 [2019-01-12 20:08:11,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 20:08:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21670 states. [2019-01-12 20:08:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21670 to 21670. [2019-01-12 20:08:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21670 states. [2019-01-12 20:08:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21670 states to 21670 states and 32405 transitions. [2019-01-12 20:08:14,315 INFO L78 Accepts]: Start accepts. Automaton has 21670 states and 32405 transitions. Word has length 117 [2019-01-12 20:08:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:14,315 INFO L480 AbstractCegarLoop]: Abstraction has 21670 states and 32405 transitions. [2019-01-12 20:08:14,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 20:08:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 21670 states and 32405 transitions. [2019-01-12 20:08:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 20:08:14,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:14,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:14,320 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1750980389, now seen corresponding path program 1 times [2019-01-12 20:08:14,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:14,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:14,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:14,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:14,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:14,484 INFO L87 Difference]: Start difference. First operand 21670 states and 32405 transitions. Second operand 4 states. [2019-01-12 20:08:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:17,000 INFO L93 Difference]: Finished difference Result 43690 states and 65222 transitions. [2019-01-12 20:08:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:08:17,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-12 20:08:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:17,026 INFO L225 Difference]: With dead ends: 43690 [2019-01-12 20:08:17,026 INFO L226 Difference]: Without dead ends: 22306 [2019-01-12 20:08:17,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22306 states. [2019-01-12 20:08:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22306 to 21978. [2019-01-12 20:08:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21978 states. [2019-01-12 20:08:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21978 states to 21978 states and 32738 transitions. [2019-01-12 20:08:19,674 INFO L78 Accepts]: Start accepts. Automaton has 21978 states and 32738 transitions. Word has length 117 [2019-01-12 20:08:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:19,675 INFO L480 AbstractCegarLoop]: Abstraction has 21978 states and 32738 transitions. [2019-01-12 20:08:19,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21978 states and 32738 transitions. [2019-01-12 20:08:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 20:08:19,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:19,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:19,679 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash 861547669, now seen corresponding path program 1 times [2019-01-12 20:08:19,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:19,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:19,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:19,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:19,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 20:08:19,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 20:08:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 20:08:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 20:08:19,836 INFO L87 Difference]: Start difference. First operand 21978 states and 32738 transitions. Second operand 4 states. [2019-01-12 20:08:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:22,147 INFO L93 Difference]: Finished difference Result 31856 states and 47501 transitions. [2019-01-12 20:08:22,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 20:08:22,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-12 20:08:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:22,169 INFO L225 Difference]: With dead ends: 31856 [2019-01-12 20:08:22,169 INFO L226 Difference]: Without dead ends: 20054 [2019-01-12 20:08:22,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 20:08:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20054 states. [2019-01-12 20:08:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20054 to 20054. [2019-01-12 20:08:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20054 states. [2019-01-12 20:08:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20054 states to 20054 states and 29884 transitions. [2019-01-12 20:08:24,382 INFO L78 Accepts]: Start accepts. Automaton has 20054 states and 29884 transitions. Word has length 117 [2019-01-12 20:08:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:24,382 INFO L480 AbstractCegarLoop]: Abstraction has 20054 states and 29884 transitions. [2019-01-12 20:08:24,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 20:08:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20054 states and 29884 transitions. [2019-01-12 20:08:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 20:08:24,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:24,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:24,386 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1756219013, now seen corresponding path program 1 times [2019-01-12 20:08:24,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:24,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 20:08:24,713 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-12 20:08:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 20:08:25,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 20:08:25,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-01-12 20:08:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 20:08:25,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 20:08:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-01-12 20:08:25,789 INFO L87 Difference]: Start difference. First operand 20054 states and 29884 transitions. Second operand 22 states. [2019-01-12 20:08:26,098 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-01-12 20:08:26,439 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-01-12 20:08:26,809 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-01-12 20:08:27,165 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-12 20:08:27,795 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-12 20:08:28,258 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-12 20:08:28,838 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-12 20:08:29,333 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-01-12 20:08:29,880 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 20:08:30,401 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 20:08:30,818 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-01-12 20:08:31,263 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-01-12 20:08:31,618 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-01-12 20:08:32,150 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-12 20:08:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 20:08:38,429 INFO L93 Difference]: Finished difference Result 38452 states and 57887 transitions. [2019-01-12 20:08:38,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 20:08:38,430 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2019-01-12 20:08:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 20:08:38,478 INFO L225 Difference]: With dead ends: 38452 [2019-01-12 20:08:38,479 INFO L226 Difference]: Without dead ends: 38441 [2019-01-12 20:08:38,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 20:08:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38441 states. [2019-01-12 20:08:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38441 to 20412. [2019-01-12 20:08:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20412 states. [2019-01-12 20:08:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20412 states to 20412 states and 30309 transitions. [2019-01-12 20:08:43,111 INFO L78 Accepts]: Start accepts. Automaton has 20412 states and 30309 transitions. Word has length 119 [2019-01-12 20:08:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 20:08:43,111 INFO L480 AbstractCegarLoop]: Abstraction has 20412 states and 30309 transitions. [2019-01-12 20:08:43,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 20:08:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 20412 states and 30309 transitions. [2019-01-12 20:08:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 20:08:43,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 20:08:43,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 20:08:43,116 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 20:08:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 20:08:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1483364393, now seen corresponding path program 1 times [2019-01-12 20:08:43,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 20:08:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 20:08:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:43,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 20:08:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 20:08:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 20:08:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 20:08:43,288 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 20:08:43,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:08:43 BoogieIcfgContainer [2019-01-12 20:08:43,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 20:08:43,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 20:08:43,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 20:08:43,487 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 20:08:43,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:07:19" (3/4) ... [2019-01-12 20:08:43,493 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 20:08:43,749 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 20:08:43,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 20:08:43,751 INFO L168 Benchmark]: Toolchain (without parser) took 87583.27 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 951.3 MB in the beginning and 1.6 GB in the end (delta: -687.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,751 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 20:08:43,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,753 INFO L168 Benchmark]: Boogie Preprocessor took 53.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,753 INFO L168 Benchmark]: RCFGBuilder took 2354.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 113.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,755 INFO L168 Benchmark]: TraceAbstraction took 84007.82 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 995.7 MB in the beginning and 1.7 GB in the end (delta: -724.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,755 INFO L168 Benchmark]: Witness Printer took 262.50 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 80.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. [2019-01-12 20:08:43,758 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.16 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 808.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2354.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 113.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84007.82 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 995.7 MB in the beginning and 1.7 GB in the end (delta: -724.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 262.50 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 80.6 MB). Peak memory consumption was 80.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1872; [L71] int __return_1528; [L72] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_uchar() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_uchar() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_uchar() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L134] COND TRUE !(init__r121 == 0) [L136] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L138] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L139] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1964] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1966] COND TRUE !(ep23 == 0) [L1968] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L144] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1941] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1943] COND TRUE !(ep31 == 0) [L1945] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L149] COND TRUE !(init__r231 == 0) [L151] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L154] COND TRUE !(init__r311 == 0) [L156] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L159] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1872] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1874] COND TRUE !(ep12 == 0) [L1876] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1248 = init__tmp___5 [L226] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 [L243] _Bool node1__newmax; [L244] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L251] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE !(newmax1 == 0) [L257] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L258] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L260] COND TRUE p12_new == nomsg [L262] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] mode1 = 1 [L281] _Bool node2__newmax; [L282] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L283] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L304] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L306] COND TRUE !(newmax2 == 0) [L308] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L309] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L311] COND TRUE p23_new == nomsg [L313] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L315] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L317] mode2 = 1 [L319] _Bool node3__newmax; [L320] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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 FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L327] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L329] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L331] COND TRUE !(newmax3 == 0) [L333] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L334] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L336] COND TRUE p31_new == nomsg [L338] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L340] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] mode3 = 1 [L356] p12_old = p12_new [L357] p12_new = nomsg [L358] p13_old = p13_new [L359] p13_new = nomsg [L360] p21_old = p21_new [L361] p21_new = nomsg [L362] p23_old = p23_new [L363] p23_new = nomsg [L364] p31_old = p31_new [L365] p31_new = nomsg [L366] p32_old = p32_new [L367] p32_new = nomsg [L369] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((int)r1) < 2 [L398] check__tmp = 1 [L399] __return_1394 = check__tmp [L400] main__c1 = __return_1394 [L402] _Bool __tmp_1; [L403] __tmp_1 = main__c1 [L404] _Bool assert__arg; [L405] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND FALSE !(assert__arg == 0) [L413] _Bool node1__newmax; [L414] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND FALSE !(r1 == 255) [L423] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L433] COND TRUE !(ep31 == 0) [L435] m1 = p31_old [L436] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=0, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L461] COND TRUE !(ep12 == 0) [L463] m2 = p12_old [L464] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L465] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND TRUE !(ep23 == 0) [L510] m3 = p23_old [L511] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L512] COND TRUE ((int)m3) > ((int)max3) [L514] max3 = m3 [L515] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L559] check__tmp = 0 [L560] __return_1872 = check__tmp [L561] main__c1 = __return_1872 [L563] _Bool __tmp_2; [L564] __tmp_2 = main__c1 [L565] _Bool assert__arg; [L566] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L567] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L569] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, m1=0, m2=4, m3=127, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 2 error locations. UNSAFE Result, 83.9s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 46.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12139 SDtfs, 12848 SDslu, 18074 SDs, 0 SdLazy, 3318 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24131occurred in iteration=16, 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: 29.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 78343 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2725 NumberOfCodeBlocks, 2725 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2582 ConstructedInterpolants, 0 QuantifiedInterpolants, 1405107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...