./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.23-1dbac8b [2018-11-10 11:56:22,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:56:22,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:56:22,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:56:22,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:56:22,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:56:22,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:56:22,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:56:22,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:56:22,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:56:22,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:56:22,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:56:22,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:56:22,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:56:22,904 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:56:22,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:56:22,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:56:22,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:56:22,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:56:22,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:56:22,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:56:22,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:56:22,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:56:22,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:56:22,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:56:22,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:56:22,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:56:22,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:56:22,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:56:22,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:56:22,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:56:22,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:56:22,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:56:22,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:56:22,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:56:22,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:56:22,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 11:56:22,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:56:22,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:56:22,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:56:22,928 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 11:56:22,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:56:22,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:56:22,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:56:22,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:56:22,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:56:22,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:56:22,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:56:22,930 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 11:56:22,931 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 11:56:22,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:56:22,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:56:22,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 11:56:22,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:56:22,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:56:22,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:56:22,931 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 11:56:22,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:56:22,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:56:22,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 597d75969acc1d8bcee1b027bc47b6559ce75136 [2018-11-10 11:56:22,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:56:22,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:56:22,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:56:22,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:56:22,971 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:56:22,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-10 11:56:23,018 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/data/7cdfe3cf2/425749b8a09b44beafc37c3bf0f220a6/FLAGbf4280384 [2018-11-10 11:56:23,353 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:56:23,354 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-10 11:56:23,360 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/data/7cdfe3cf2/425749b8a09b44beafc37c3bf0f220a6/FLAGbf4280384 [2018-11-10 11:56:23,369 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/data/7cdfe3cf2/425749b8a09b44beafc37c3bf0f220a6 [2018-11-10 11:56:23,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:56:23,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:56:23,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:56:23,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:56:23,376 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:56:23,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f4c881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23, skipping insertion in model container [2018-11-10 11:56:23,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:56:23,414 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:56:23,575 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:56:23,580 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:56:23,619 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:56:23,632 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:56:23,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23 WrapperNode [2018-11-10 11:56:23,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:56:23,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:56:23,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:56:23,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:56:23,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:56:23,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:56:23,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:56:23,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:56:23,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... [2018-11-10 11:56:23,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:56:23,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:56:23,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:56:23,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:56:23,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:56:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 11:56:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:56:23,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:56:25,618 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:56:25,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:56:25 BoogieIcfgContainer [2018-11-10 11:56:25,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:56:25,620 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 11:56:25,620 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 11:56:25,629 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 11:56:25,629 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:56:25" (1/1) ... [2018-11-10 11:56:25,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 11:56:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 11:56:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 11:56:25,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-10 11:56:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-10 11:56:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 11:56:26,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-10 11:56:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-10 11:56:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 11:56:26,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-10 11:56:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-10 11:56:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 11:56:26,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 37 states and 60 transitions. [2018-11-10 11:56:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2018-11-10 11:56:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:56:27,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-10 11:56:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-10 11:56:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:56:28,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-10 11:56:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-10 11:56:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 11:56:29,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 53 states and 87 transitions. [2018-11-10 11:56:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2018-11-10 11:56:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 11:56:29,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 54 states and 88 transitions. [2018-11-10 11:56:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2018-11-10 11:56:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 11:56:29,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 61 states and 98 transitions. [2018-11-10 11:56:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 98 transitions. [2018-11-10 11:56:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 11:56:30,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 64 states and 104 transitions. [2018-11-10 11:56:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-11-10 11:56:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 11:56:30,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 82 states and 135 transitions. [2018-11-10 11:56:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 135 transitions. [2018-11-10 11:56:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 11:56:33,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 90 states and 152 transitions. [2018-11-10 11:56:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 152 transitions. [2018-11-10 11:56:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 11:56:35,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 91 states and 154 transitions. [2018-11-10 11:56:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 154 transitions. [2018-11-10 11:56:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:56:35,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 100 states and 173 transitions. [2018-11-10 11:56:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 173 transitions. [2018-11-10 11:56:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 11:56:37,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 102 states and 179 transitions. [2018-11-10 11:56:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 179 transitions. [2018-11-10 11:56:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 11:56:38,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 111 states and 197 transitions. [2018-11-10 11:56:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 197 transitions. [2018-11-10 11:56:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 11:56:41,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 114 states and 207 transitions. [2018-11-10 11:56:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 207 transitions. [2018-11-10 11:56:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 11:56:42,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 116 states and 214 transitions. [2018-11-10 11:56:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 214 transitions. [2018-11-10 11:56:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 11:56:42,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 126 states and 236 transitions. [2018-11-10 11:56:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 236 transitions. [2018-11-10 11:56:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 11:56:47,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 129 states and 242 transitions. [2018-11-10 11:56:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 242 transitions. [2018-11-10 11:56:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 11:56:49,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 131 states and 245 transitions. [2018-11-10 11:56:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 245 transitions. [2018-11-10 11:56:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 11:56:50,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 146 states and 266 transitions. [2018-11-10 11:56:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 266 transitions. [2018-11-10 11:56:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 11:56:53,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:56:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 153 states and 277 transitions. [2018-11-10 11:56:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 277 transitions. [2018-11-10 11:56:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 11:56:57,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:56:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:56:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 152 states and 268 transitions. [2018-11-10 11:56:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 268 transitions. [2018-11-10 11:56:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 11:56:57,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:56:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 168 states and 316 transitions. [2018-11-10 11:57:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 316 transitions. [2018-11-10 11:57:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 11:57:04,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 172 states and 320 transitions. [2018-11-10 11:57:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 320 transitions. [2018-11-10 11:57:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:57:05,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 180 states and 336 transitions. [2018-11-10 11:57:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 336 transitions. [2018-11-10 11:57:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:57:10,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 185 states and 341 transitions. [2018-11-10 11:57:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 341 transitions. [2018-11-10 11:57:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 11:57:11,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 193 states and 360 transitions. [2018-11-10 11:57:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 360 transitions. [2018-11-10 11:57:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 11:57:18,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 199 states and 371 transitions. [2018-11-10 11:57:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 371 transitions. [2018-11-10 11:57:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 11:57:21,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 200 states and 373 transitions. [2018-11-10 11:57:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 373 transitions. [2018-11-10 11:57:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:57:22,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 213 states and 394 transitions. [2018-11-10 11:57:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 394 transitions. [2018-11-10 11:57:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:57:30,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 216 states and 399 transitions. [2018-11-10 11:57:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 399 transitions. [2018-11-10 11:57:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:57:31,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 219 states and 403 transitions. [2018-11-10 11:57:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 403 transitions. [2018-11-10 11:57:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:57:32,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 220 states and 408 transitions. [2018-11-10 11:57:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 408 transitions. [2018-11-10 11:57:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 11:57:33,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 222 states and 410 transitions. [2018-11-10 11:57:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 410 transitions. [2018-11-10 11:57:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 11:57:34,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 237 states and 437 transitions. [2018-11-10 11:57:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 437 transitions. [2018-11-10 11:57:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 11:57:40,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 244 states and 450 transitions. [2018-11-10 11:57:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 450 transitions. [2018-11-10 11:57:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 11:57:43,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 248 states and 461 transitions. [2018-11-10 11:57:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 461 transitions. [2018-11-10 11:57:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 11:57:45,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 259 states and 483 transitions. [2018-11-10 11:57:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 483 transitions. [2018-11-10 11:57:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 11:57:52,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 270 states and 518 transitions. [2018-11-10 11:57:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 518 transitions. [2018-11-10 11:57:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 11:57:58,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:57:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:57:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 271 states and 519 transitions. [2018-11-10 11:57:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 519 transitions. [2018-11-10 11:57:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 11:57:59,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:57:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:58:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:58:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 276 states and 531 transitions. [2018-11-10 11:58:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 531 transitions. [2018-11-10 11:58:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 11:58:02,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:58:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:58:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 11:58:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:58:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 276 states and 530 transitions. [2018-11-10 11:58:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 530 transitions. [2018-11-10 11:58:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:58:03,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:58:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:58:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:58:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:58:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 282 states and 549 transitions. [2018-11-10 11:58:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 549 transitions. [2018-11-10 11:58:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:58:09,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:58:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:58:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:58:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:58:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 284 states and 553 transitions. [2018-11-10 11:58:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 553 transitions. [2018-11-10 11:58:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:58:11,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:58:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:58:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:58:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:58:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 287 states and 559 transitions. [2018-11-10 11:58:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 559 transitions. [2018-11-10 11:58:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:58:14,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:58:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:58:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:58:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:58:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 288 states and 560 transitions. [2018-11-10 11:58:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 560 transitions. [2018-11-10 11:58:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 11:58:15,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:58:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:58:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:58:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:58:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:58:16,788 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2018-11-10 11:58:16,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 11:58:16 ImpRootNode [2018-11-10 11:58:16,884 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 11:58:16,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:58:16,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:58:16,884 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:58:16,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:56:25" (3/4) ... [2018-11-10 11:58:16,888 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 11:58:16,975 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_49e2ba5b-0efa-4ff3-9958-cc80d029425e/bin-2019/ukojak/witness.graphml [2018-11-10 11:58:16,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:58:16,976 INFO L168 Benchmark]: Toolchain (without parser) took 113604.25 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 961.9 MB in the beginning and 1.4 GB in the end (delta: -446.6 MB). Peak memory consumption was 851.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:58:16,977 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:58:16,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.16 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:58:16,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:58:16,977 INFO L168 Benchmark]: Boogie Preprocessor took 31.34 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. [2018-11-10 11:58:16,978 INFO L168 Benchmark]: RCFGBuilder took 1871.73 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: 85.8 MB). Peak memory consumption was 265.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:58:16,978 INFO L168 Benchmark]: CodeCheck took 111264.43 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -351.2 MB). Peak memory consumption was 797.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:58:16,978 INFO L168 Benchmark]: Witness Printer took 91.28 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 3.9 kB). Peak memory consumption was 3.9 kB. Max. memory is 11.5 GB. [2018-11-10 11:58:16,979 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 142 locations, 1 error locations. UNSAFE Result, 111.1s OverallTime, 49 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -100549196 SDslu, 1666656960 SDs, 0 SdLazy, 2055233288 SolverSat, 1751345088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13544 GetRequests, 11785 SyntacticMatches, 867 SemanticMatches, 892 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514562 ImplicationChecksByTransitivity, 101.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 666633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 11 PerfectInterpolantSequences, 213/914 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [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() [L582] CALL, EXPR init() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND TRUE \read(r121) [L312] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND TRUE \read(r121) [L328] COND FALSE !(\read(ep23)) [L331] 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] RET return (tmp___5); [L582] EXPR init() [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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L162] COND FALSE !(\read(ep13)) [L168] RET mode1 = (_Bool)1 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L600] node2() [L601] CALL node3() [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] RET mode3 = (_Bool)1 [L601] node3() [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 [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=0, 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] [L615] assert(c1) [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] RET mode1 = (_Bool)0 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] RET mode2 = (_Bool)0 [L600] node2() [L601] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] RET mode3 = (_Bool)0 [L601] node3() [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 [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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] [L615] assert(c1) [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND FALSE !(\read(newmax1)) [L162] COND FALSE !(\read(ep13)) [L168] RET mode1 = (_Bool)1 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L600] node2() [L601] CALL node3() [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] RET mode3 = (_Bool)1 [L601] node3() [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 [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=0, m3=3, max1=0, max2=1, 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] [L615] assert(c1) [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND TRUE (int )max1 == (int )id1 [L149] st1 = (char)1 [L154] RET mode1 = (_Bool)0 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] RET mode2 = (_Bool)0 [L600] node2() [L601] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND 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] RET mode3 = (_Bool)0 [L601] node3() [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 [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=1, id3=2, m1=3, m2=-1, m3=3, max1=0, max2=1, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.16 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.34 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 1871.73 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: 85.8 MB). Peak memory consumption was 265.6 MB. Max. memory is 11.5 GB. * CodeCheck took 111264.43 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -351.2 MB). Peak memory consumption was 797.5 MB. Max. memory is 11.5 GB. * Witness Printer took 91.28 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 3.9 kB). Peak memory consumption was 3.9 kB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...