./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.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_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/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 dde90af2328c679905dbf72b0c2b57892228e614 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:14:15,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:14:15,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:14:15,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:14:15,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:14:15,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:14:15,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:14:15,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:14:15,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:14:15,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:14:15,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:14:15,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:14:15,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:14:15,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:14:15,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:14:15,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:14:15,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:14:15,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:14:15,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:14:15,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:14:15,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:14:15,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:14:15,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:14:15,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:14:15,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:14:15,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:14:15,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:14:15,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:14:15,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:14:15,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:14:15,859 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:14:15,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:14:15,860 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:14:15,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:14:15,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:14:15,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:14:15,863 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 21:14:15,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:14:15,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:14:15,877 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:14:15,877 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:14:15,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:14:15,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:14:15,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:14:15,879 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:14:15,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:14:15,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:14:15,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:14:15,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:14:15,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:14:15,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:14:15,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:14:15,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:14:15,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:14:15,881 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 21:14:15,881 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 21:14:15,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:14:15,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:14:15,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:14:15,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:14:15,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:14:15,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:14:15,884 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 21:14:15,884 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:14:15,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:14:15,885 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_5323ab36-723b-4b21-beec-61a07ea8b5e4/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 -> dde90af2328c679905dbf72b0c2b57892228e614 [2018-10-26 21:14:15,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:14:15,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:14:15,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:14:15,933 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:14:15,934 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:14:15,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-10-26 21:14:15,989 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/data/1992a80e8/f455f3ffb86c42d8ab74fdbb7c7bebbb/FLAGd5fe1f2dc [2018-10-26 21:14:16,448 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:14:16,448 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-10-26 21:14:16,461 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/data/1992a80e8/f455f3ffb86c42d8ab74fdbb7c7bebbb/FLAGd5fe1f2dc [2018-10-26 21:14:16,483 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/data/1992a80e8/f455f3ffb86c42d8ab74fdbb7c7bebbb [2018-10-26 21:14:16,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:14:16,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:14:16,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:14:16,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:14:16,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:14:16,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:16,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bc4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16, skipping insertion in model container [2018-10-26 21:14:16,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:16,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:14:16,563 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:14:16,788 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:14:16,809 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:14:16,886 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:14:16,909 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:14:16,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16 WrapperNode [2018-10-26 21:14:16,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:14:16,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:14:16,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:14:16,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:14:16,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:16,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:14:17,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:14:17,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:14:17,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:14:17,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... [2018-10-26 21:14:17,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:14:17,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:14:17,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:14:17,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:14:17,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:14:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:14:17,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:14:17,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:14:21,865 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:14:21,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:14:21 BoogieIcfgContainer [2018-10-26 21:14:21,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:14:21,866 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 21:14:21,867 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 21:14:21,878 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 21:14:21,878 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:14:21" (1/1) ... [2018-10-26 21:14:21,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 21:14:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 21:14:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 21:14:21,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-10-26 21:14:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-10-26 21:14:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 21:14:22,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-10-26 21:14:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-10-26 21:14:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 21:14:23,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-10-26 21:14:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-10-26 21:14:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 21:14:24,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-10-26 21:14:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-10-26 21:14:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 21:14:24,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-10-26 21:14:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-10-26 21:14:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:14:26,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-10-26 21:14:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-26 21:14:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:14:27,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-10-26 21:14:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-10-26 21:14:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:14:28,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-10-26 21:14:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-10-26 21:14:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:14:28,340 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:29,263 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 21:14:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-10-26 21:14:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-10-26 21:14:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 21:14:31,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-10-26 21:14:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-10-26 21:14:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:14:32,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:33,608 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-10-26 21:14:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 86 states and 140 transitions. [2018-10-26 21:14:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 140 transitions. [2018-10-26 21:14:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:14:39,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 105 states and 174 transitions. [2018-10-26 21:14:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 174 transitions. [2018-10-26 21:14:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:14:46,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 106 states and 175 transitions. [2018-10-26 21:14:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 175 transitions. [2018-10-26 21:14:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:14:47,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:48,907 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-10-26 21:14:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 126 states and 210 transitions. [2018-10-26 21:14:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 210 transitions. [2018-10-26 21:14:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:14:53,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 127 states and 213 transitions. [2018-10-26 21:14:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 213 transitions. [2018-10-26 21:14:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:14:54,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:14:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:14:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 128 states and 214 transitions. [2018-10-26 21:14:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 214 transitions. [2018-10-26 21:14:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:14:55,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:14:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 143 states and 242 transitions. [2018-10-26 21:15:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 242 transitions. [2018-10-26 21:15:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:15:00,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 146 states and 251 transitions. [2018-10-26 21:15:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 251 transitions. [2018-10-26 21:15:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:15:02,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 148 states and 256 transitions. [2018-10-26 21:15:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 256 transitions. [2018-10-26 21:15:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:03,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 157 states and 277 transitions. [2018-10-26 21:15:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 277 transitions. [2018-10-26 21:15:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:10,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 161 states and 285 transitions. [2018-10-26 21:15:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 285 transitions. [2018-10-26 21:15:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:13,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 162 states and 286 transitions. [2018-10-26 21:15:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 286 transitions. [2018-10-26 21:15:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:14,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 163 states and 287 transitions. [2018-10-26 21:15:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-10-26 21:15:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:15:16,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 164 states and 288 transitions. [2018-10-26 21:15:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 288 transitions. [2018-10-26 21:15:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:15:16,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 179 states and 312 transitions. [2018-10-26 21:15:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-10-26 21:15:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:15:23,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 188 states and 329 transitions. [2018-10-26 21:15:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 329 transitions. [2018-10-26 21:15:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:15:29,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 203 states and 377 transitions. [2018-10-26 21:15:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 377 transitions. [2018-10-26 21:15:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:15:40,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:43,945 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-26 21:15:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 216 states and 407 transitions. [2018-10-26 21:15:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 407 transitions. [2018-10-26 21:15:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:15:48,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 218 states and 413 transitions. [2018-10-26 21:15:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 413 transitions. [2018-10-26 21:15:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:15:49,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 229 states and 433 transitions. [2018-10-26 21:15:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 433 transitions. [2018-10-26 21:15:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:15:57,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:15:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:15:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:15:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 232 states and 442 transitions. [2018-10-26 21:15:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 442 transitions. [2018-10-26 21:15:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:15:59,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:15:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 242 states and 460 transitions. [2018-10-26 21:16:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 460 transitions. [2018-10-26 21:16:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:16:07,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 244 states and 464 transitions. [2018-10-26 21:16:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 464 transitions. [2018-10-26 21:16:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:16:08,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 247 states and 474 transitions. [2018-10-26 21:16:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 474 transitions. [2018-10-26 21:16:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:16:10,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 253 states and 493 transitions. [2018-10-26 21:16:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 493 transitions. [2018-10-26 21:16:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:16:18,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 256 states and 504 transitions. [2018-10-26 21:16:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 504 transitions. [2018-10-26 21:16:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:16:20,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 258 states and 507 transitions. [2018-10-26 21:16:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 507 transitions. [2018-10-26 21:16:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:16:21,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:30,532 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-26 21:16:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 271 states and 536 transitions. [2018-10-26 21:16:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 536 transitions. [2018-10-26 21:16:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:16:31,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 277 states and 561 transitions. [2018-10-26 21:16:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 561 transitions. [2018-10-26 21:16:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:16:36,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 281 states and 579 transitions. [2018-10-26 21:16:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 579 transitions. [2018-10-26 21:16:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:16:39,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 282 states and 587 transitions. [2018-10-26 21:16:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 587 transitions. [2018-10-26 21:16:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:16:41,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 286 states and 598 transitions. [2018-10-26 21:16:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 598 transitions. [2018-10-26 21:16:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:16:44,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 288 states and 605 transitions. [2018-10-26 21:16:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 605 transitions. [2018-10-26 21:16:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:16:51,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 294 states and 620 transitions. [2018-10-26 21:16:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 620 transitions. [2018-10-26 21:16:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:16:55,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 296 states and 623 transitions. [2018-10-26 21:16:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 623 transitions. [2018-10-26 21:16:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:16:56,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:16:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:16:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 300 states and 635 transitions. [2018-10-26 21:16:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 635 transitions. [2018-10-26 21:16:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:16:58,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:16:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:16:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:17:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:17:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 301 states and 636 transitions. [2018-10-26 21:17:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 636 transitions. [2018-10-26 21:17:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:17:00,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:17:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:17:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:17:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:17:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 305 states and 648 transitions. [2018-10-26 21:17:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 648 transitions. [2018-10-26 21:17:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:17:02,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:17:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:17:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:17:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:17:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:17:08,888 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2018-10-26 21:17:09,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 09:17:09 ImpRootNode [2018-10-26 21:17:09,061 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 21:17:09,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:17:09,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:17:09,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:17:09,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:14:21" (3/4) ... [2018-10-26 21:17:09,072 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:17:09,284 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5323ab36-723b-4b21-beec-61a07ea8b5e4/bin-2019/ukojak/witness.graphml [2018-10-26 21:17:09,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:17:09,285 INFO L168 Benchmark]: Toolchain (without parser) took 172795.95 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 954.4 MB in the beginning and 1.8 GB in the end (delta: -875.4 MB). Peak memory consumption was 498.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,285 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:17:09,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.29 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 935.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -210.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,287 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,288 INFO L168 Benchmark]: RCFGBuilder took 4782.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.8 MB). Peak memory consumption was 326.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,288 INFO L168 Benchmark]: CodeCheck took 167194.68 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -645.7 MB). Peak memory consumption was 504.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,288 INFO L168 Benchmark]: Witness Printer took 222.45 ms. Allocated memory is still 2.4 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:17:09,290 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, 136 locations, 1 error locations. UNSAFE Result, 166.9s OverallTime, 49 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1279942232 SDslu, 388601232 SDs, 0 SdLazy, 2145957572 SolverSat, -914347676 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14321 GetRequests, 12538 SyntacticMatches, 833 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591219 ImplicationChecksByTransitivity, 149.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 38.6s InterpolantComputationTime, 1501 NumberOfCodeBlocks, 1501 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1401 ConstructedInterpolants, 0 QuantifiedInterpolants, 596945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 173/891 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: 610]: 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] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [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 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] mode3 = __VERIFIER_nondet_bool() [L564] CALL, EXPR init() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND TRUE \read(r131) [L288] COND TRUE \read(ep32) [L289] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND TRUE \read(r131) [L298] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND TRUE \read(r211) [L311] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND FALSE !(\read(r231)) [L326] COND TRUE \read(r211) [L327] COND TRUE \read(ep13) [L328] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] RET return (tmp___5); [L564] EXPR init() [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 1 [L150] COND FALSE !(\read(ep12)) [L153] COND TRUE \read(ep13) [L154] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L154] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND FALSE !(\read(ep23)) [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=-2, m2=118, m3=114, max1=115, max2=117, max3=116, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=115, p21=0, p21_new=-1, p21_old=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND FALSE !((int )r1 == 2) [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND FALSE !((int )r2 == 2) [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND FALSE !(\read(ep23)) [L232] COND FALSE !((int )r3 == 2) [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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 TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=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] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND FALSE !((int )r1 < 1) [L157] RET mode1 = (_Bool)1 [L581] node1() [L582] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND FALSE !(\read(ep23)) [L203] RET mode2 = (_Bool)1 [L582] node2() [L583] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=115, max1=117, max2=117, max3=116, mode1=1, mode2=1, mode3=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=117, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=116, p32=0, p32_new=-1, p32_old=116, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] assert(c1) [L579] COND TRUE 1 [L581] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] nl1 = (char)1 [L147] RET mode1 = (_Bool)0 [L581] node1() [L582] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] RET mode2 = (_Bool)0 [L582] node2() [L583] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND FALSE !(\read(ep23)) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] RET mode3 = (_Bool)0 [L583] node3() [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L596] CALL, EXPR check() [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=-1, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=-1, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] [L527] RET return (tmp); [L596] EXPR check() [L596] c1 = check() [L597] CALL assert(c1) [L608] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=-1, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] [L610] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=115, id2=117, id3=116, m1=116, m2=116, m3=-1, max1=117, max2=117, max3=116, mode1=0, mode2=0, mode3=0, nl1=1, 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=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.29 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 935.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -210.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.61 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4782.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.8 MB). Peak memory consumption was 326.3 MB. Max. memory is 11.5 GB. * CodeCheck took 167194.68 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: -645.7 MB). Peak memory consumption was 504.6 MB. Max. memory is 11.5 GB. * Witness Printer took 222.45 ms. Allocated memory is still 2.4 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...