./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak --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 Kojak --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.25-f470102 [2019-12-01 18:51:14,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 18:51:14,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 18:51:14,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 18:51:14,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 18:51:14,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 18:51:14,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 18:51:14,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 18:51:14,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 18:51:14,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 18:51:14,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 18:51:14,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 18:51:14,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 18:51:14,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 18:51:14,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 18:51:14,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 18:51:14,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 18:51:14,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 18:51:14,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 18:51:14,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 18:51:14,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 18:51:14,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 18:51:14,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 18:51:14,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 18:51:14,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 18:51:14,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 18:51:14,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 18:51:14,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 18:51:14,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 18:51:14,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 18:51:14,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 18:51:14,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 18:51:14,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 18:51:14,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 18:51:14,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 18:51:14,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 18:51:14,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 18:51:14,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 18:51:14,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 18:51:14,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 18:51:14,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 18:51:14,221 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 18:51:14,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 18:51:14,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 18:51:14,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 18:51:14,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 18:51:14,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 18:51:14,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 18:51:14,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 18:51:14,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 18:51:14,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 18:51:14,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 18:51:14,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 18:51:14,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 18:51:14,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 18:51:14,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 18:51:14,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 18:51:14,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 18:51:14,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 18:51:14,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 18:51:14,237 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 18:51:14,237 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 18:51:14,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 18:51:14,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 18:51:14,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 18:51:14,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 18:51:14,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 18:51:14,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 18:51:14,238 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 18:51:14,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 18:51:14,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 18:51:14,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak 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 -> Kojak 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-12-01 18:51:14,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 18:51:14,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 18:51:14,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 18:51:14,360 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 18:51:14,360 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 18:51:14,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-12-01 18:51:14,401 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/data/cae41bf09/da2698503adc44e0836c074b0ccc136e/FLAGe6ee00099 [2019-12-01 18:51:14,839 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 18:51:14,839 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-12-01 18:51:14,847 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/data/cae41bf09/da2698503adc44e0836c074b0ccc136e/FLAGe6ee00099 [2019-12-01 18:51:14,856 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/data/cae41bf09/da2698503adc44e0836c074b0ccc136e [2019-12-01 18:51:14,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 18:51:14,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 18:51:14,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 18:51:14,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 18:51:14,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 18:51:14,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:51:14" (1/1) ... [2019-12-01 18:51:14,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75aa99db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:14, skipping insertion in model container [2019-12-01 18:51:14,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:51:14" (1/1) ... [2019-12-01 18:51:14,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 18:51:14,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 18:51:15,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 18:51:15,144 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 18:51:15,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 18:51:15,242 INFO L208 MainTranslator]: Completed translation [2019-12-01 18:51:15,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15 WrapperNode [2019-12-01 18:51:15,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 18:51:15,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 18:51:15,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 18:51:15,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 18:51:15,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 18:51:15,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 18:51:15,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 18:51:15,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 18:51:15,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... [2019-12-01 18:51:15,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 18:51:15,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 18:51:15,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 18:51:15,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 18:51:15,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:51:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-01 18:51:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 18:51:15,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 18:51:16,564 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 18:51:16,564 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-01 18:51:16,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:51:16 BoogieIcfgContainer [2019-12-01 18:51:16,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 18:51:16,566 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 18:51:16,566 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 18:51:16,572 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 18:51:16,573 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:51:16" (1/1) ... [2019-12-01 18:51:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 18:51:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 188 states and 332 transitions. [2019-12-01 18:51:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 332 transitions. [2019-12-01 18:51:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-01 18:51:16,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 198 states and 354 transitions. [2019-12-01 18:51:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 354 transitions. [2019-12-01 18:51:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 18:51:17,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 200 states and 358 transitions. [2019-12-01 18:51:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 358 transitions. [2019-12-01 18:51:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 18:51:17,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 211 states and 383 transitions. [2019-12-01 18:51:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 383 transitions. [2019-12-01 18:51:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 18:51:17,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 218 states and 401 transitions. [2019-12-01 18:51:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 401 transitions. [2019-12-01 18:51:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 18:51:18,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 219 states and 402 transitions. [2019-12-01 18:51:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 402 transitions. [2019-12-01 18:51:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 18:51:18,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 219 states and 400 transitions. [2019-12-01 18:51:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 400 transitions. [2019-12-01 18:51:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:18,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 222 states and 408 transitions. [2019-12-01 18:51:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 408 transitions. [2019-12-01 18:51:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:20,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 226 states and 414 transitions. [2019-12-01 18:51:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 414 transitions. [2019-12-01 18:51:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:21,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 238 states and 442 transitions. [2019-12-01 18:51:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 442 transitions. [2019-12-01 18:51:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:25,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 253 states and 475 transitions. [2019-12-01 18:51:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 475 transitions. [2019-12-01 18:51:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:37,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 257 states and 481 transitions. [2019-12-01 18:51:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 481 transitions. [2019-12-01 18:51:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:38,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:51:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:51:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 265 states and 502 transitions. [2019-12-01 18:51:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 502 transitions. [2019-12-01 18:51:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:51:54,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:51:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:51:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:10,437 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-12-01 18:52:10,970 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-01 18:52:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 275 states and 532 transitions. [2019-12-01 18:52:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 532 transitions. [2019-12-01 18:52:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:52:15,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 277 states and 536 transitions. [2019-12-01 18:52:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 536 transitions. [2019-12-01 18:52:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:52:17,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 278 states and 537 transitions. [2019-12-01 18:52:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 537 transitions. [2019-12-01 18:52:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 18:52:18,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 278 states and 536 transitions. [2019-12-01 18:52:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 536 transitions. [2019-12-01 18:52:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:18,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 282 states and 542 transitions. [2019-12-01 18:52:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 542 transitions. [2019-12-01 18:52:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:20,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 286 states and 548 transitions. [2019-12-01 18:52:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 548 transitions. [2019-12-01 18:52:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:21,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 290 states and 556 transitions. [2019-12-01 18:52:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 556 transitions. [2019-12-01 18:52:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:27,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 303 states and 589 transitions. [2019-12-01 18:52:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 589 transitions. [2019-12-01 18:52:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:35,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 307 states and 595 transitions. [2019-12-01 18:52:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 595 transitions. [2019-12-01 18:52:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:37,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 311 states and 601 transitions. [2019-12-01 18:52:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 601 transitions. [2019-12-01 18:52:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:40,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 320 states and 626 transitions. [2019-12-01 18:52:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 626 transitions. [2019-12-01 18:52:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:48,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 328 states and 648 transitions. [2019-12-01 18:52:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 648 transitions. [2019-12-01 18:52:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:54,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:52:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:52:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 331 states and 654 transitions. [2019-12-01 18:52:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 654 transitions. [2019-12-01 18:52:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:52:58,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:52:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:52:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:53:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 335 states and 660 transitions. [2019-12-01 18:53:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 660 transitions. [2019-12-01 18:53:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:53:05,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:05,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-12-01 18:53:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 336 states and 662 transitions. [2019-12-01 18:53:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 662 transitions. [2019-12-01 18:53:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:53:05,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:53:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 337 states and 664 transitions. [2019-12-01 18:53:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 664 transitions. [2019-12-01 18:53:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:53:05,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:53:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 338 states and 665 transitions. [2019-12-01 18:53:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 665 transitions. [2019-12-01 18:53:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 18:53:06,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:53:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 322 states and 615 transitions. [2019-12-01 18:53:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 615 transitions. [2019-12-01 18:53:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:53:11,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:53:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 326 states and 623 transitions. [2019-12-01 18:53:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 623 transitions. [2019-12-01 18:53:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:53:16,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:53:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:53:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 331 states and 640 transitions. [2019-12-01 18:53:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 640 transitions. [2019-12-01 18:53:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:53:54,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:53:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:53:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:54:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:54:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 335 states and 645 transitions. [2019-12-01 18:54:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 645 transitions. [2019-12-01 18:54:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:54:03,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:54:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:54:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:54:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:54:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 344 states and 667 transitions. [2019-12-01 18:54:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 667 transitions. [2019-12-01 18:54:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:54:18,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:54:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:54:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:54:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:54:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 346 states and 671 transitions. [2019-12-01 18:54:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 671 transitions. [2019-12-01 18:54:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:54:21,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:54:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:54:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:54:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:54:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 350 states and 676 transitions. [2019-12-01 18:54:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 676 transitions. [2019-12-01 18:54:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:54:28,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:54:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:54:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:54:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:54:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 351 states and 676 transitions. [2019-12-01 18:54:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 676 transitions. [2019-12-01 18:54:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:54:36,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:54:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:54:38,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-12-01 18:55:02,572 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-01 18:55:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 352 states and 678 transitions. [2019-12-01 18:55:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 678 transitions. [2019-12-01 18:55:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:14,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 351 states and 674 transitions. [2019-12-01 18:55:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 674 transitions. [2019-12-01 18:55:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:21,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 350 states and 672 transitions. [2019-12-01 18:55:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 672 transitions. [2019-12-01 18:55:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:27,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 345 states and 662 transitions. [2019-12-01 18:55:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 662 transitions. [2019-12-01 18:55:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:34,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:35,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-12-01 18:55:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 345 states and 661 transitions. [2019-12-01 18:55:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 661 transitions. [2019-12-01 18:55:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:45,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 344 states and 658 transitions. [2019-12-01 18:55:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 658 transitions. [2019-12-01 18:55:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:48,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 344 states and 657 transitions. [2019-12-01 18:55:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 657 transitions. [2019-12-01 18:55:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:50,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 344 states and 656 transitions. [2019-12-01 18:55:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 656 transitions. [2019-12-01 18:55:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 18:55:52,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:55:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:55:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 344 states and 655 transitions. [2019-12-01 18:55:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 655 transitions. [2019-12-01 18:55:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:55:54,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:55:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:55:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 348 states and 665 transitions. [2019-12-01 18:56:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 665 transitions. [2019-12-01 18:56:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:03,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 356 states and 680 transitions. [2019-12-01 18:56:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 680 transitions. [2019-12-01 18:56:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:15,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 360 states and 686 transitions. [2019-12-01 18:56:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 686 transitions. [2019-12-01 18:56:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:24,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 364 states and 695 transitions. [2019-12-01 18:56:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 695 transitions. [2019-12-01 18:56:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:28,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 371 states and 711 transitions. [2019-12-01 18:56:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 711 transitions. [2019-12-01 18:56:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:35,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 375 states and 717 transitions. [2019-12-01 18:56:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 717 transitions. [2019-12-01 18:56:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:44,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 377 states and 721 transitions. [2019-12-01 18:56:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 721 transitions. [2019-12-01 18:56:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:49,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:56:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:56:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 382 states and 731 transitions. [2019-12-01 18:56:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 731 transitions. [2019-12-01 18:56:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:56:52,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:56:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:56:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 379 states and 724 transitions. [2019-12-01 18:57:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 724 transitions. [2019-12-01 18:57:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:00,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 378 states and 720 transitions. [2019-12-01 18:57:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 720 transitions. [2019-12-01 18:57:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:08,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 378 states and 719 transitions. [2019-12-01 18:57:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 719 transitions. [2019-12-01 18:57:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:11,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 373 states and 710 transitions. [2019-12-01 18:57:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 710 transitions. [2019-12-01 18:57:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:19,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 370 states and 702 transitions. [2019-12-01 18:57:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 702 transitions. [2019-12-01 18:57:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:27,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 370 states and 701 transitions. [2019-12-01 18:57:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 701 transitions. [2019-12-01 18:57:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:29,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 370 states and 700 transitions. [2019-12-01 18:57:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 700 transitions. [2019-12-01 18:57:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:32,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 369 states and 698 transitions. [2019-12-01 18:57:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 698 transitions. [2019-12-01 18:57:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:39,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 368 states and 695 transitions. [2019-12-01 18:57:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 695 transitions. [2019-12-01 18:57:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:43,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 346 states and 638 transitions. [2019-12-01 18:57:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 638 transitions. [2019-12-01 18:57:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:47,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 346 states and 636 transitions. [2019-12-01 18:57:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 636 transitions. [2019-12-01 18:57:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:49,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 346 states and 634 transitions. [2019-12-01 18:57:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 634 transitions. [2019-12-01 18:57:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 18:57:52,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:57:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:57:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 346 states and 632 transitions. [2019-12-01 18:57:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 632 transitions. [2019-12-01 18:57:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:57:54,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:57:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:57:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:58:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:58:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 355 states and 651 transitions. [2019-12-01 18:58:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 651 transitions. [2019-12-01 18:58:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:58:09,537 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:58:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:58:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:58:32,183 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-01 18:58:33,287 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-12-01 18:58:50,354 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-12-01 18:58:59,982 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-12-01 18:59:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:59:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 364 states and 666 transitions. [2019-12-01 18:59:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 666 transitions. [2019-12-01 18:59:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:59:16,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:59:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:59:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:59:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:59:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 368 states and 671 transitions. [2019-12-01 18:59:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 671 transitions. [2019-12-01 18:59:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:59:26,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:59:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:59:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:59:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:59:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 372 states and 683 transitions. [2019-12-01 18:59:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 683 transitions. [2019-12-01 18:59:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:59:41,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:59:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:59:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:59:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:59:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 373 states and 686 transitions. [2019-12-01 18:59:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 686 transitions. [2019-12-01 18:59:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:59:45,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:59:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:59:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:59:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:59:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 377 states and 692 transitions. [2019-12-01 18:59:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 692 transitions. [2019-12-01 18:59:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:59:52,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:59:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:59:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 18:59:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 18:59:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 381 states and 698 transitions. [2019-12-01 18:59:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 698 transitions. [2019-12-01 18:59:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 18:59:59,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 18:59:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 18:59:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:00:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:00:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 386 states and 709 transitions. [2019-12-01 19:00:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 709 transitions. [2019-12-01 19:00:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 19:00:04,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:00:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:00:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:00:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:00:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 395 states and 730 transitions. [2019-12-01 19:00:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 730 transitions. [2019-12-01 19:00:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 19:00:16,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:00:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:00:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:00:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:00:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:00:17,053 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 77 iterations. [2019-12-01 19:00:17,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 07:00:17 ImpRootNode [2019-12-01 19:00:17,189 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 19:00:17,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 19:00:17,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 19:00:17,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 19:00:17,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:51:16" (3/4) ... [2019-12-01 19:00:17,191 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 19:00:17,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_840f49f2-73e0-47cb-83e5-16fb37000470/bin/ukojak/witness.graphml [2019-12-01 19:00:17,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 19:00:17,302 INFO L168 Benchmark]: Toolchain (without parser) took 542442.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 935.3 MB in the beginning and 760.3 MB in the end (delta: 175.0 MB). Peak memory consumption was 323.9 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,302 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 19:00:17,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.43 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,303 INFO L168 Benchmark]: Boogie Preprocessor took 32.94 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,303 INFO L168 Benchmark]: RCFGBuilder took 1243.36 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: 1.5 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,303 INFO L168 Benchmark]: CodeCheck took 540623.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.1 MB). Free memory was 1.1 GB in the beginning and 799.7 MB in the end (delta: 297.9 MB). Peak memory consumption was 320.9 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,304 INFO L168 Benchmark]: Witness Printer took 112.00 ms. Allocated memory is still 1.2 GB. Free memory was 799.7 MB in the beginning and 760.3 MB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-12-01 19:00:17,305 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 540.4s, OverallIterations: 77, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -1308605928 SDtfs, 873414132 SDslu, 1510466996 SDs, 0 SdLazy, -28847512 SolverSat, 134219232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 103.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51784 GetRequests, 49732 SyntacticMatches, 800 SemanticMatches, 1252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773646 ImplicationChecksByTransitivity, 533.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 6404 NumberOfCodeBlocks, 6404 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 6240 ConstructedInterpolants, 0 QuantifiedInterpolants, 2263041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 76 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - 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; [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 [L134] COND FALSE !(!(init__r121 == 0)) [L1987] COND TRUE !(init__r131 == 0) [L1989] COND TRUE !(ep32 == 0) [L1991] init__tmp = 1 [L138] init__r122 = (_Bool)init__tmp [L139] COND TRUE !(init__r131 == 0) [L141] init__tmp___0 = 1 [L143] init__r132 = (_Bool)init__tmp___0 [L144] COND TRUE !(init__r211 == 0) [L146] init__tmp___1 = 1 [L148] init__r212 = (_Bool)init__tmp___1 [L149] COND FALSE !(!(init__r231 == 0)) [L1918] COND TRUE !(init__r211 == 0) [L1920] COND TRUE !(ep13 == 0) [L1922] init__tmp___2 = 1 [L153] init__r232 = (_Bool)init__tmp___2 [L154] COND FALSE !(!(init__r311 == 0)) [L1895] COND TRUE !(init__r321 == 0) [L1897] COND TRUE !(ep21 == 0) [L1899] init__tmp___3 = 1 [L158] init__r312 = (_Bool)init__tmp___3 [L159] COND TRUE !(init__r321 == 0) [L161] init__tmp___4 = 1 [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=0, mode2=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] [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=0, mode2=0, mode3=0, newmax1=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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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 FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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] [L266] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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] [L268] COND TRUE !(newmax1 == 0) [L270] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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] [L271] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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] [L273] COND TRUE p13_new == nomsg [L275] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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] [L277] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=84, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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 TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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] [L293] COND TRUE !(newmax2 == 0) [L295] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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] [L296] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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] [L298] COND TRUE p21_new == nomsg [L300] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, 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] [L302] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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 FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L321] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [L329] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [L342] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [L344] COND TRUE !(newmax3 == 0) [L346] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [L347] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [L349] COND TRUE p32_new == nomsg [L351] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, 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] [L353] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, mode1=1, mode2=1, 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=84, p13_old=-1, p21=0, p21_new=82, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=0, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, p21=0, p21_new=-1, p21_old=82, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=83, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND FALSE !(r1 == 255) [L423] r1 = r1 + 1 [L424] COND TRUE !(ep21 == 0) [L426] m1 = p21_old [L427] p21_old = nomsg [L428] COND FALSE !(((int)m1) > ((int)max1)) [L433] COND FALSE !(!(ep31 == 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, 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=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=81, m3=0, max1=84, max2=82, max3=83, 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=-1, p13=0, p13_new=-1, p13_old=84, 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=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=81, m3=0, max1=84, max2=82, max3=83, 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=84, 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=83, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=81, m3=0, max1=84, max2=82, max3=83, 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=84, 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=83, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 [L461] COND FALSE !(!(ep12 == 0)) [L470] COND TRUE !(ep32 == 0) [L472] m2 = p32_old [L473] p32_old = nomsg [L474] COND TRUE ((int)m2) > ((int)max2) [L476] max2 = m2 [L477] node2__newmax = 1 [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_1872=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=0, max1=84, max2=83, max3=83, 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=84, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=0, max1=84, max2=83, max3=83, mode1=0, mode2=0, 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=84, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=0, max1=84, max2=83, max3=83, mode1=0, mode2=0, 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=84, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 [L499] COND TRUE !(ep13 == 0) [L501] m3 = p13_old [L502] p13_old = nomsg [L503] COND TRUE ((int)m3) > ((int)max3) [L505] max3 = m3 [L506] node3__newmax = 1 [L508] COND FALSE !(!(ep23 == 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=84, id2=82, id3=83, m1=82, m2=83, m3=84, max1=84, max2=83, max3=84, mode1=0, mode2=0, mode3=0, 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=-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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.43 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.94 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1243.36 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: 1.5 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. * CodeCheck took 540623.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.1 MB). Free memory was 1.1 GB in the beginning and 799.7 MB in the end (delta: 297.9 MB). Peak memory consumption was 320.9 MB. Max. memory is 11.5 GB. * Witness Printer took 112.00 ms. Allocated memory is still 1.2 GB. Free memory was 799.7 MB in the beginning and 760.3 MB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...