./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/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 fca7014573b2ba8b0b911628482f19638a6ab990 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-1dbac8b [2018-10-26 20:39:50,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:39:50,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:39:50,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:39:50,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:39:50,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:39:50,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:39:50,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:39:50,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:39:50,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:39:50,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:39:50,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:39:50,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:39:50,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:39:50,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:39:50,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:39:50,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:39:50,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:39:50,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:39:50,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:39:50,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:39:50,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:39:50,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:39:50,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:39:50,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:39:50,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:39:50,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:39:50,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:39:50,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:39:50,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:39:50,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:39:50,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:39:50,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:39:50,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:39:50,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:39:50,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:39:50,354 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 20:39:50,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:39:50,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:39:50,368 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:39:50,368 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:39:50,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:39:50,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:39:50,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:39:50,370 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:39:50,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:39:50,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:39:50,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:39:50,371 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:39:50,371 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:39:50,371 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:39:50,371 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:39:50,371 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:39:50,372 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:39:50,372 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 20:39:50,372 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 20:39:50,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:39:50,372 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:39:50,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 20:39:50,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:39:50,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:39:50,375 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:39:50,375 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 20:39:50,376 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:39:50,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:39:50,376 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/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 -> fca7014573b2ba8b0b911628482f19638a6ab990 [2018-10-26 20:39:50,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:39:50,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:39:50,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:39:50,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:39:50,434 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:39:50,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-10-26 20:39:50,494 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/data/fffc9cdd5/ecdf0a3fff924771951e3277ccae6583/FLAGa3f6f3284 [2018-10-26 20:39:50,904 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:39:50,905 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-10-26 20:39:50,914 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/data/fffc9cdd5/ecdf0a3fff924771951e3277ccae6583/FLAGa3f6f3284 [2018-10-26 20:39:50,927 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/data/fffc9cdd5/ecdf0a3fff924771951e3277ccae6583 [2018-10-26 20:39:50,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:39:50,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:39:50,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:39:50,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:39:50,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:39:50,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:39:50" (1/1) ... [2018-10-26 20:39:50,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934edcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:50, skipping insertion in model container [2018-10-26 20:39:50,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:39:50" (1/1) ... [2018-10-26 20:39:50,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:39:50,987 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:39:51,241 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:39:51,248 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:39:51,310 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:39:51,322 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:39:51,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51 WrapperNode [2018-10-26 20:39:51,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:39:51,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:39:51,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:39:51,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:39:51,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:39:51,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:39:51,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:39:51,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:39:51,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... [2018-10-26 20:39:51,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:39:51,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:39:51,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:39:51,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:39:51,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/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 [2018-10-26 20:39:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:39:51,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:39:57,128 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:39:57,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:39:57 BoogieIcfgContainer [2018-10-26 20:39:57,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:39:57,130 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 20:39:57,130 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 20:39:57,143 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 20:39:57,144 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:39:57" (1/1) ... [2018-10-26 20:39:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:39:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 20:39:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 20:39:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 20:39:57,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:39:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:58,209 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 20:39:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:39:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-10-26 20:39:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-10-26 20:39:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 20:39:58,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:39:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:39:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-10-26 20:39:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-10-26 20:39:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 20:39:59,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:39:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-10-26 20:40:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-10-26 20:40:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 20:40:00,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:01,350 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:40:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-10-26 20:40:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-10-26 20:40:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 20:40:01,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-10-26 20:40:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-10-26 20:40:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 20:40:03,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-10-26 20:40:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-26 20:40:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 20:40:05,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-10-26 20:40:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-10-26 20:40:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 20:40:05,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-10-26 20:40:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-10-26 20:40:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 20:40:05,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:06,514 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 20:40:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-10-26 20:40:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-10-26 20:40:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 20:40:09,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-10-26 20:40:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-10-26 20:40:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:40:10,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:14,494 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-26 20:40:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 86 states and 140 transitions. [2018-10-26 20:40:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 140 transitions. [2018-10-26 20:40:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:40:16,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:18,612 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-26 20:40:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 105 states and 173 transitions. [2018-10-26 20:40:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 173 transitions. [2018-10-26 20:40:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:40:22,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 106 states and 175 transitions. [2018-10-26 20:40:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 175 transitions. [2018-10-26 20:40:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:40:22,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:26,794 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 20:40:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 124 states and 206 transitions. [2018-10-26 20:40:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 206 transitions. [2018-10-26 20:40:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:40:28,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 125 states and 210 transitions. [2018-10-26 20:40:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 210 transitions. [2018-10-26 20:40:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:40:29,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 126 states and 211 transitions. [2018-10-26 20:40:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2018-10-26 20:40:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:40:30,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 141 states and 239 transitions. [2018-10-26 20:40:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-10-26 20:40:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:40:36,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 143 states and 244 transitions. [2018-10-26 20:40:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 244 transitions. [2018-10-26 20:40:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:40:38,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 144 states and 249 transitions. [2018-10-26 20:40:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 249 transitions. [2018-10-26 20:40:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:40:40,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 166 states and 283 transitions. [2018-10-26 20:40:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 283 transitions. [2018-10-26 20:40:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:40:48,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:40:50,209 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-26 20:40:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:40:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 170 states and 288 transitions. [2018-10-26 20:40:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 288 transitions. [2018-10-26 20:40:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:40:51,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:40:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:40:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 187 states and 328 transitions. [2018-10-26 20:41:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 328 transitions. [2018-10-26 20:41:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:41:01,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 198 states and 344 transitions. [2018-10-26 20:41:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 344 transitions. [2018-10-26 20:41:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:41:08,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:14,053 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-10-26 20:41:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 213 states and 377 transitions. [2018-10-26 20:41:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 377 transitions. [2018-10-26 20:41:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:41:19,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 216 states and 384 transitions. [2018-10-26 20:41:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 384 transitions. [2018-10-26 20:41:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 20:41:21,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 221 states and 396 transitions. [2018-10-26 20:41:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 396 transitions. [2018-10-26 20:41:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 20:41:28,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 223 states and 400 transitions. [2018-10-26 20:41:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 400 transitions. [2018-10-26 20:41:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 20:41:30,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 226 states and 408 transitions. [2018-10-26 20:41:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 408 transitions. [2018-10-26 20:41:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:41:31,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 233 states and 426 transitions. [2018-10-26 20:41:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 426 transitions. [2018-10-26 20:41:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:41:41,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 235 states and 428 transitions. [2018-10-26 20:41:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 428 transitions. [2018-10-26 20:41:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:41:44,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 238 states and 439 transitions. [2018-10-26 20:41:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 439 transitions. [2018-10-26 20:41:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:41:46,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:41:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:41:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 255 states and 482 transitions. [2018-10-26 20:41:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 482 transitions. [2018-10-26 20:41:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:41:59,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:41:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:41:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:42:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:42:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 259 states and 496 transitions. [2018-10-26 20:42:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 496 transitions. [2018-10-26 20:42:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:42:01,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:42:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:42:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:42:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:42:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 261 states and 501 transitions. [2018-10-26 20:42:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 501 transitions. [2018-10-26 20:42:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:42:03,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:42:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:42:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:42:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:42:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 269 states and 523 transitions. [2018-10-26 20:42:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 523 transitions. [2018-10-26 20:42:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:42:11,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:42:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:42:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:42:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:42:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 273 states and 533 transitions. [2018-10-26 20:42:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 533 transitions. [2018-10-26 20:42:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:42:14,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:42:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:42:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:42:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:42:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 275 states and 536 transitions. [2018-10-26 20:42:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 536 transitions. [2018-10-26 20:42:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 20:42:16,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:42:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:42:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:42:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:42:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:42:22,418 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 38 iterations. [2018-10-26 20:42:22,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 08:42:22 ImpRootNode [2018-10-26 20:42:22,664 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 20:42:22,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:42:22,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:42:22,665 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:42:22,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:39:57" (3/4) ... [2018-10-26 20:42:22,675 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:42:22,843 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ba45ec3e-724b-4f2e-b9f4-ebb7ba8f8d26/bin-2019/ukojak/witness.graphml [2018-10-26 20:42:22,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:42:22,844 INFO L168 Benchmark]: Toolchain (without parser) took 151913.45 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 955.8 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,844 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:42:22,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.00 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 937.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -207.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,847 INFO L168 Benchmark]: Boogie Preprocessor took 53.26 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,847 INFO L168 Benchmark]: RCFGBuilder took 5610.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 119.6 MB). Peak memory consumption was 264.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,847 INFO L168 Benchmark]: CodeCheck took 145534.04 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,848 INFO L168 Benchmark]: Witness Printer took 178.45 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:22,850 INFO L336 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, 148 locations, 1 error locations. UNSAFE Result, 145.2s OverallTime, 38 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1073741824 SDtfs, -1224735238 SDslu, 2004530018 SDs, 0 SdLazy, -338831490 SolverSat, -534838934 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10384 GetRequests, 8976 SyntacticMatches, 576 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439775 ImplicationChecksByTransitivity, 125.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 419139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 120/621 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L606] CALL, EXPR init() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND TRUE \read(r121) [L312] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND TRUE \read(r231) [L341] COND TRUE \read(ep31) [L342] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND TRUE \read(r231) [L351] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND FALSE !(\read(r321)) [L379] COND TRUE \read(r311) [L380] COND TRUE \read(ep12) [L381] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] RET return (tmp___5); [L606] EXPR init() [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, 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] [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] RET mode1 = (_Bool)1 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND TRUE \read(ep23) [L217] COND TRUE \read(newmax2) [L218] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L218] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L222] RET mode2 = (_Bool)1 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND FALSE !(\read(ep32)) [L276] RET mode3 = (_Bool)1 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=5, m2=4, m3=0, max1=4, max2=6, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=6, 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] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] RET mode1 = (_Bool)0 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] RET mode2 = (_Bool)0 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND TRUE (int )m3 > (int )max3 [L242] max3 = m3 [L243] newmax = (_Bool)1 [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND TRUE (int )m3 > (int )max3 [L250] max3 = m3 [L251] newmax = (_Bool)1 [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] RET mode3 = (_Bool)0 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND FALSE !(\read(newmax1)) [L162] COND TRUE \read(ep13) [L163] COND FALSE !(\read(newmax1)) [L168] RET mode1 = (_Bool)1 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND TRUE \read(ep23) [L217] COND FALSE !(\read(newmax2)) [L222] RET mode2 = (_Bool)1 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND FALSE !(\read(ep32)) [L276] RET mode3 = (_Bool)1 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=1, m2=4, m3=6, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=6, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] assert(c1) [L621] COND TRUE 1 [L623] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND TRUE (int )m1 > (int )max1 [L142] max1 = m1 [L143] newmax = (_Bool)1 [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] st1 = (char)1 [L154] RET mode1 = (_Bool)0 [L623] node1() [L624] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] RET mode2 = (_Bool)0 [L624] node2() [L625] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND FALSE !((int )max3 == (int )id3) [L259] nl3 = (char)1 [L262] RET mode3 = (_Bool)0 [L625] node3() [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L638] CALL, EXPR check() [L515] int tmp ; VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L566] RET return (tmp); [L638] EXPR check() [L638] c1 = check() [L639] CALL assert(c1) [L650] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L652] __VERIFIER_error() VAL [ep12=1, ep13=1, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=6, id3=1, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.00 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 937.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -207.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.26 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5610.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 119.6 MB). Peak memory consumption was 264.4 MB. Max. memory is 11.5 GB. * CodeCheck took 145534.04 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 178.45 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...