./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/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 597d75969acc1d8bcee1b027bc47b6559ce75136 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:11:21,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:11:21,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:11:21,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:11:21,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:11:21,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:11:21,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:11:21,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:11:21,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:11:21,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:11:21,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:11:21,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:11:21,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:11:21,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:11:21,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:11:21,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:11:21,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:11:21,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:11:21,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:11:21,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:11:21,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:11:21,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:11:21,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:11:21,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:11:21,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:11:21,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:11:21,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:11:21,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:11:21,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:11:21,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:11:21,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:11:21,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:11:21,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:11:21,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:11:21,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:11:21,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:11:21,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:11:21,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:11:21,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:11:21,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:11:21,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:11:21,857 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 08:11:21,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:11:21,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:11:21,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 08:11:21,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 08:11:21,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:11:21,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:11:21,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:11:21,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:11:21,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:11:21,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:11:21,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:11:21,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:11:21,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:11:21,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:11:21,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:11:21,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:11:21,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:11:21,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:11:21,894 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 08:11:21,895 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 08:11:21,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:11:21,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:11:21,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 08:11:21,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:11:21,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:11:21,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:11:21,896 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 08:11:21,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:11:21,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:11:21,897 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_6046f9c8-7106-4f51-81bf-68f6ecf512f7/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 -> 597d75969acc1d8bcee1b027bc47b6559ce75136 [2019-11-20 08:11:22,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:11:22,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:11:22,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:11:22,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:11:22,076 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:11:22,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-11-20 08:11:22,133 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/data/b1ba6f1e1/eddf48e3a7e744e8988175f3411b223a/FLAG9fb313d37 [2019-11-20 08:11:22,530 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:11:22,530 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-11-20 08:11:22,540 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/data/b1ba6f1e1/eddf48e3a7e744e8988175f3411b223a/FLAG9fb313d37 [2019-11-20 08:11:22,880 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/data/b1ba6f1e1/eddf48e3a7e744e8988175f3411b223a [2019-11-20 08:11:22,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:11:22,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:11:22,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:22,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:11:22,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:11:22,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:22" (1/1) ... [2019-11-20 08:11:22,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674759fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:22, skipping insertion in model container [2019-11-20 08:11:22,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:22" (1/1) ... [2019-11-20 08:11:22,899 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:11:22,954 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:11:23,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:23,304 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:11:23,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:23,384 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:11:23,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23 WrapperNode [2019-11-20 08:11:23,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:23,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:11:23,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:11:23,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:11:23,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:11:23,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:11:23,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:11:23,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:11:23,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... [2019-11-20 08:11:23,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:11:23,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:11:23,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:11:23,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:11:23,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/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-11-20 08:11:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:11:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:11:26,239 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:11:26,239 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 08:11:26,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:26 BoogieIcfgContainer [2019-11-20 08:11:26,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:11:26,241 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 08:11:26,241 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 08:11:26,251 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 08:11:26,251 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:26" (1/1) ... [2019-11-20 08:11:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2019-11-20 08:11:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-11-20 08:11:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 08:11:26,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2019-11-20 08:11:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-11-20 08:11:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 08:11:26,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2019-11-20 08:11:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2019-11-20 08:11:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 08:11:27,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2019-11-20 08:11:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-20 08:11:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 08:11:28,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:28,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-11-20 08:11:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 31 states and 54 transitions. [2019-11-20 08:11:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2019-11-20 08:11:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 08:11:29,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2019-11-20 08:11:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2019-11-20 08:11:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 08:11:30,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2019-11-20 08:11:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2019-11-20 08:11:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 08:11:31,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2019-11-20 08:11:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2019-11-20 08:11:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:11:32,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2019-11-20 08:11:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2019-11-20 08:11:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 08:11:32,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 53 states and 91 transitions. [2019-11-20 08:11:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2019-11-20 08:11:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 08:11:34,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 56 states and 103 transitions. [2019-11-20 08:11:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 103 transitions. [2019-11-20 08:11:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 08:11:34,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 71 states and 132 transitions. [2019-11-20 08:11:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 132 transitions. [2019-11-20 08:11:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 08:11:39,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 82 states and 150 transitions. [2019-11-20 08:11:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 150 transitions. [2019-11-20 08:11:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:11:42,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 92 states and 169 transitions. [2019-11-20 08:11:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 169 transitions. [2019-11-20 08:11:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:11:46,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 93 states and 170 transitions. [2019-11-20 08:11:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 170 transitions. [2019-11-20 08:11:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 08:11:47,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 94 states and 173 transitions. [2019-11-20 08:11:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-11-20 08:11:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:11:47,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 100 states and 192 transitions. [2019-11-20 08:11:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 192 transitions. [2019-11-20 08:11:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:11:53,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 101 states and 195 transitions. [2019-11-20 08:11:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 195 transitions. [2019-11-20 08:11:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:11:54,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 104 states and 202 transitions. [2019-11-20 08:11:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 202 transitions. [2019-11-20 08:11:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 08:11:56,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:11:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 105 states and 203 transitions. [2019-11-20 08:11:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 203 transitions. [2019-11-20 08:11:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 08:11:57,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:11:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:00,937 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-20 08:12:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 125 states and 234 transitions. [2019-11-20 08:12:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 234 transitions. [2019-11-20 08:12:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 08:12:03,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 129 states and 244 transitions. [2019-11-20 08:12:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 244 transitions. [2019-11-20 08:12:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 08:12:06,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 136 states and 259 transitions. [2019-11-20 08:12:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 259 transitions. [2019-11-20 08:12:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 08:12:12,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 141 states and 269 transitions. [2019-11-20 08:12:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 269 transitions. [2019-11-20 08:12:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 08:12:15,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 08:12:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 141 states and 268 transitions. [2019-11-20 08:12:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 268 transitions. [2019-11-20 08:12:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 08:12:15,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 146 states and 276 transitions. [2019-11-20 08:12:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 276 transitions. [2019-11-20 08:12:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 08:12:22,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 161 states and 312 transitions. [2019-11-20 08:12:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 312 transitions. [2019-11-20 08:12:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 08:12:32,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 08:12:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 169 states and 327 transitions. [2019-11-20 08:12:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 327 transitions. [2019-11-20 08:12:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 08:12:36,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 08:12:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 170 states and 331 transitions. [2019-11-20 08:12:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 331 transitions. [2019-11-20 08:12:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 08:12:37,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 177 states and 346 transitions. [2019-11-20 08:12:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 346 transitions. [2019-11-20 08:12:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 08:12:43,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 178 states and 347 transitions. [2019-11-20 08:12:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 347 transitions. [2019-11-20 08:12:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:12:43,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 185 states and 361 transitions. [2019-11-20 08:12:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 361 transitions. [2019-11-20 08:12:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:12:49,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 186 states and 362 transitions. [2019-11-20 08:12:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 362 transitions. [2019-11-20 08:12:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 08:12:51,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 187 states and 364 transitions. [2019-11-20 08:12:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 364 transitions. [2019-11-20 08:12:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:12:52,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:12:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:12:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 192 states and 382 transitions. [2019-11-20 08:12:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 382 transitions. [2019-11-20 08:12:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:12:59,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:12:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 194 states and 385 transitions. [2019-11-20 08:13:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 385 transitions. [2019-11-20 08:13:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:13:02,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 196 states and 393 transitions. [2019-11-20 08:13:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 393 transitions. [2019-11-20 08:13:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:13:05,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 197 states and 394 transitions. [2019-11-20 08:13:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 394 transitions. [2019-11-20 08:13:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 08:13:08,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 198 states and 397 transitions. [2019-11-20 08:13:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 397 transitions. [2019-11-20 08:13:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:13:10,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:17,918 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 08:13:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 209 states and 432 transitions. [2019-11-20 08:13:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 432 transitions. [2019-11-20 08:13:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:13:22,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 210 states and 435 transitions. [2019-11-20 08:13:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 435 transitions. [2019-11-20 08:13:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:13:23,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 213 states and 446 transitions. [2019-11-20 08:13:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 446 transitions. [2019-11-20 08:13:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:13:26,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 214 states and 448 transitions. [2019-11-20 08:13:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 448 transitions. [2019-11-20 08:13:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:13:27,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 215 states and 453 transitions. [2019-11-20 08:13:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 453 transitions. [2019-11-20 08:13:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 08:13:28,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 216 states and 453 transitions. [2019-11-20 08:13:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 453 transitions. [2019-11-20 08:13:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:13:29,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 225 states and 475 transitions. [2019-11-20 08:13:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 475 transitions. [2019-11-20 08:13:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:13:42,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 232 states and 494 transitions. [2019-11-20 08:13:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 494 transitions. [2019-11-20 08:13:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:13:49,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 233 states and 495 transitions. [2019-11-20 08:13:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 495 transitions. [2019-11-20 08:13:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:13:50,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 235 states and 497 transitions. [2019-11-20 08:13:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 497 transitions. [2019-11-20 08:13:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:13:52,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 238 states and 508 transitions. [2019-11-20 08:13:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 508 transitions. [2019-11-20 08:13:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:13:55,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:13:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 239 states and 508 transitions. [2019-11-20 08:13:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 508 transitions. [2019-11-20 08:13:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 08:13:56,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 08:13:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 08:13:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 238 states and 488 transitions. [2019-11-20 08:13:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 488 transitions. [2019-11-20 08:13:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 08:13:58,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 08:13:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:14:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:14:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:14:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:14:00,825 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 52 iterations. [2019-11-20 08:14:01,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 08:14:01 ImpRootNode [2019-11-20 08:14:01,060 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 08:14:01,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:14:01,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:14:01,060 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:14:01,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:26" (3/4) ... [2019-11-20 08:14:01,063 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 08:14:01,222 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6046f9c8-7106-4f51-81bf-68f6ecf512f7/bin/ukojak/witness.graphml [2019-11-20 08:14:01,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:14:01,224 INFO L168 Benchmark]: Toolchain (without parser) took 158340.17 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 950.1 MB in the beginning and 1.9 GB in the end (delta: -967.2 MB). Peak memory consumption was 744.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:14:01,225 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:14:01,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-20 08:14:01,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.06 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-11-20 08:14:01,226 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:14:01,226 INFO L168 Benchmark]: RCFGBuilder took 2748.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.8 MB). Peak memory consumption was 255.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:14:01,226 INFO L168 Benchmark]: CodeCheck took 154818.65 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -948.5 MB). Peak memory consumption was 625.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:14:01,227 INFO L168 Benchmark]: Witness Printer took 162.85 ms. Allocated memory is still 2.7 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:14:01,228 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, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 154.5s, OverallIterations: 52, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -219133466 SDslu, 256 SDs, 0 SdLazy, -573799912 SolverSat, -1026923902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15429 GetRequests, 13682 SyntacticMatches, 847 SemanticMatches, 900 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507822 ImplicationChecksByTransitivity, 137.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 1460 NumberOfCodeBlocks, 1460 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1364 ConstructedInterpolants, 0 QuantifiedInterpolants, 513153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 208/913 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: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [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 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L547] int c1 ; [L548] int i2 ; [L551] c1 = 0 [L552] ep12 = __VERIFIER_nondet_bool() [L553] ep13 = __VERIFIER_nondet_bool() [L554] ep21 = __VERIFIER_nondet_bool() [L555] ep23 = __VERIFIER_nondet_bool() [L556] ep31 = __VERIFIER_nondet_bool() [L557] ep32 = __VERIFIER_nondet_bool() [L558] id1 = __VERIFIER_nondet_char() [L559] r1 = __VERIFIER_nondet_uchar() [L560] st1 = __VERIFIER_nondet_char() [L561] nl1 = __VERIFIER_nondet_char() [L562] m1 = __VERIFIER_nondet_char() [L563] max1 = __VERIFIER_nondet_char() [L564] mode1 = __VERIFIER_nondet_bool() [L565] newmax1 = __VERIFIER_nondet_bool() [L566] id2 = __VERIFIER_nondet_char() [L567] r2 = __VERIFIER_nondet_uchar() [L568] st2 = __VERIFIER_nondet_char() [L569] nl2 = __VERIFIER_nondet_char() [L570] m2 = __VERIFIER_nondet_char() [L571] max2 = __VERIFIER_nondet_char() [L572] mode2 = __VERIFIER_nondet_bool() [L573] newmax2 = __VERIFIER_nondet_bool() [L574] id3 = __VERIFIER_nondet_char() [L575] r3 = __VERIFIER_nondet_uchar() [L576] st3 = __VERIFIER_nondet_char() [L577] nl3 = __VERIFIER_nondet_char() [L578] m3 = __VERIFIER_nondet_char() [L579] max3 = __VERIFIER_nondet_char() [L580] mode3 = __VERIFIER_nondet_bool() [L581] newmax3 = __VERIFIER_nondet_bool() [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 FALSE !(\read(r121)) [L314] COND FALSE !(\read(r131)) [L321] tmp = 0 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND FALSE !(\read(r121)) [L334] tmp___0 = 0 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND FALSE !(\read(r231)) [L347] tmp___1 = 0 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND FALSE !(\read(r211)) [L360] tmp___2 = 0 [L362] r232 = (_Bool )tmp___2 [L363] COND FALSE !(\read(r311)) [L366] COND FALSE !(\read(r321)) [L373] tmp___3 = 0 [L375] r312 = (_Bool )tmp___3 [L376] COND FALSE !(\read(r321)) [L379] COND FALSE !(\read(r311)) [L386] tmp___4 = 0 [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 (int )max1 == (int )id1 [L399] COND TRUE (int )max2 == (int )id2 [L400] COND TRUE (int )max3 == (int )id3 [L401] COND TRUE (int )st1 == 0 [L402] COND TRUE (int )st2 == 0 [L403] COND TRUE (int )st3 == 0 [L404] COND TRUE (int )nl1 == 0 [L405] COND TRUE (int )nl2 == 0 [L406] COND TRUE (int )nl3 == 0 [L407] COND TRUE (int )mode1 == 0 [L408] COND TRUE (int )mode2 == 0 [L409] COND TRUE (int )mode3 == 0 [L410] COND TRUE \read(newmax1) [L411] COND TRUE \read(newmax2) [L412] COND TRUE \read(newmax3) [L413] tmp___5 = 1 [L486] return (tmp___5); [L582] i2 = init() [L584] p12_old = nomsg [L585] p12_new = nomsg [L586] p13_old = nomsg [L587] p13_new = nomsg [L588] p21_old = nomsg [L589] p21_new = nomsg [L590] p23_old = nomsg [L591] p23_new = nomsg [L592] p31_old = nomsg [L593] p31_new = nomsg [L594] p32_old = nomsg [L595] p32_new = nomsg [L596] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [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 FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND FALSE !(\read(ep32)) [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, 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=-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] [L597] COND TRUE 1 [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 FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [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 FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND FALSE !(\read(ep32)) [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [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 FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND TRUE (int )max1 == (int )id1 [L149] st1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [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] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L494] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L540] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L542] return (tmp); [L614] c1 = check() [L626] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L628] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=3, id3=2, m1=0, m2=4, m3=3, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 500.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.06 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 50.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2748.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.8 MB). Peak memory consumption was 255.6 MB. Max. memory is 11.5 GB. * CodeCheck took 154818.65 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -948.5 MB). Peak memory consumption was 625.4 MB. Max. memory is 11.5 GB. * Witness Printer took 162.85 ms. Allocated memory is still 2.7 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...