./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/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 b21da786d95e06bc319c05bb1d8697b6b032c077 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-09 18:38:27,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:38:27,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:38:27,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:38:27,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:38:27,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:38:27,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:38:27,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:38:27,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:38:27,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:38:27,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:38:27,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:38:27,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:38:27,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:38:27,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:38:27,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:38:27,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:38:27,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:38:27,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:38:27,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:38:27,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:38:27,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:38:27,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:38:27,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:38:27,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:38:27,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:38:27,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:38:27,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:38:27,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:38:27,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:38:27,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:38:27,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:38:27,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:38:27,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:38:27,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:38:27,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:38:27,648 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 18:38:27,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:38:27,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:38:27,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:38:27,656 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 18:38:27,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 18:38:27,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 18:38:27,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:38:27,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:38:27,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:38:27,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:38:27,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 18:38:27,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:38:27,658 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 18:38:27,658 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 18:38:27,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:38:27,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:38:27,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 18:38:27,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:38:27,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:38:27,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:38:27,659 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 18:38:27,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:38:27,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:38:27,659 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_6f64e4e1-1fad-4a33-bb1a-08c92329b228/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 -> b21da786d95e06bc319c05bb1d8697b6b032c077 [2018-12-09 18:38:27,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:38:27,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:38:27,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:38:27,690 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:38:27,691 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:38:27,691 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-09 18:38:27,727 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/data/60ef74de6/df7cf0072dac4dfe833ff784d1e6e3c9/FLAG22bda2849 [2018-12-09 18:38:28,154 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:38:28,155 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-09 18:38:28,160 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/data/60ef74de6/df7cf0072dac4dfe833ff784d1e6e3c9/FLAG22bda2849 [2018-12-09 18:38:28,168 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/data/60ef74de6/df7cf0072dac4dfe833ff784d1e6e3c9 [2018-12-09 18:38:28,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:38:28,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:38:28,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:38:28,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:38:28,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:38:28,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2648fef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28, skipping insertion in model container [2018-12-09 18:38:28,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:38:28,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:38:28,317 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:38:28,322 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:38:28,386 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:38:28,396 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:38:28,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28 WrapperNode [2018-12-09 18:38:28,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:38:28,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:38:28,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:38:28,398 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:38:28,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:38:28,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:38:28,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:38:28,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:38:28,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... [2018-12-09 18:38:28,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:38:28,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:38:28,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:38:28,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:38:28,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/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-12-09 18:38:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:38:28,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:38:29,744 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:38:29,745 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 18:38:29,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:38:29 BoogieIcfgContainer [2018-12-09 18:38:29,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:38:29,745 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 18:38:29,746 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 18:38:29,752 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 18:38:29,752 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:38:29" (1/1) ... [2018-12-09 18:38:29,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-09 18:38:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-09 18:38:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 18:38:29,780 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-09 18:38:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-09 18:38:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 18:38:30,042 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-09 18:38:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-09 18:38:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 18:38:30,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-09 18:38:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-09 18:38:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 18:38:30,583 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-09 18:38:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-09 18:38:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 18:38:31,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-09 18:38:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-09 18:38:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 18:38:31,647 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-09 18:38:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-09 18:38:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 18:38:32,302 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-09 18:38:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-09 18:38:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:38:32,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-09 18:38:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-09 18:38:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:38:32,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-09 18:38:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-09 18:38:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 18:38:33,721 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-09 18:38:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-09 18:38:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:38:34,036 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2018-12-09 18:38:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2018-12-09 18:38:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 18:38:38,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 94 states and 184 transitions. [2018-12-09 18:38:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 184 transitions. [2018-12-09 18:38:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 18:38:42,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 95 states and 185 transitions. [2018-12-09 18:38:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 185 transitions. [2018-12-09 18:38:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:38:43,053 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 113 states and 226 transitions. [2018-12-09 18:38:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 226 transitions. [2018-12-09 18:38:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:38:47,867 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 115 states and 230 transitions. [2018-12-09 18:38:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 230 transitions. [2018-12-09 18:38:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:38:48,351 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 129 states and 262 transitions. [2018-12-09 18:38:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 262 transitions. [2018-12-09 18:38:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:38:53,701 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 130 states and 263 transitions. [2018-12-09 18:38:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 263 transitions. [2018-12-09 18:38:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:38:54,104 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 131 states and 268 transitions. [2018-12-09 18:38:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 268 transitions. [2018-12-09 18:38:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:38:54,473 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 132 states and 269 transitions. [2018-12-09 18:38:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 269 transitions. [2018-12-09 18:38:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:38:54,846 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:38:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:38:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 133 states and 270 transitions. [2018-12-09 18:38:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 270 transitions. [2018-12-09 18:38:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:38:55,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:38:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 152 states and 308 transitions. [2018-12-09 18:39:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 308 transitions. [2018-12-09 18:39:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:39:04,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 154 states and 311 transitions. [2018-12-09 18:39:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 311 transitions. [2018-12-09 18:39:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:39:05,876 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 155 states and 312 transitions. [2018-12-09 18:39:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 312 transitions. [2018-12-09 18:39:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:39:06,392 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 157 states and 317 transitions. [2018-12-09 18:39:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2018-12-09 18:39:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:39:07,115 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 158 states and 318 transitions. [2018-12-09 18:39:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 318 transitions. [2018-12-09 18:39:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:39:07,540 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 159 states and 319 transitions. [2018-12-09 18:39:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 319 transitions. [2018-12-09 18:39:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 18:39:07,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 179 states and 360 transitions. [2018-12-09 18:39:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 360 transitions. [2018-12-09 18:39:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 18:39:16,135 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:18,334 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 27 [2018-12-09 18:39:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 182 states and 369 transitions. [2018-12-09 18:39:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 369 transitions. [2018-12-09 18:39:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 18:39:22,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 187 states and 382 transitions. [2018-12-09 18:39:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 382 transitions. [2018-12-09 18:39:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 18:39:25,007 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 201 states and 437 transitions. [2018-12-09 18:39:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 437 transitions. [2018-12-09 18:39:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 18:39:36,772 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 206 states and 447 transitions. [2018-12-09 18:39:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 447 transitions. [2018-12-09 18:39:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 18:39:38,831 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 219 states and 473 transitions. [2018-12-09 18:39:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 473 transitions. [2018-12-09 18:39:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 18:39:47,175 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 225 states and 492 transitions. [2018-12-09 18:39:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 492 transitions. [2018-12-09 18:39:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 18:39:50,562 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:39:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:39:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 240 states and 538 transitions. [2018-12-09 18:39:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 538 transitions. [2018-12-09 18:39:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 18:39:58,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:39:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 246 states and 550 transitions. [2018-12-09 18:40:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 550 transitions. [2018-12-09 18:40:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 18:40:02,692 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 256 states and 577 transitions. [2018-12-09 18:40:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 577 transitions. [2018-12-09 18:40:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 18:40:16,254 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 253 states and 583 transitions. [2018-12-09 18:40:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 583 transitions. [2018-12-09 18:40:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 18:40:18,148 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 254 states and 584 transitions. [2018-12-09 18:40:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 584 transitions. [2018-12-09 18:40:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 18:40:19,003 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 269 states and 627 transitions. [2018-12-09 18:40:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 627 transitions. [2018-12-09 18:40:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 18:40:28,591 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 276 states and 650 transitions. [2018-12-09 18:40:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 650 transitions. [2018-12-09 18:40:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 18:40:31,665 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 284 states and 676 transitions. [2018-12-09 18:40:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 676 transitions. [2018-12-09 18:40:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 18:40:42,434 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 288 states and 692 transitions. [2018-12-09 18:40:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 692 transitions. [2018-12-09 18:40:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 18:40:45,917 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 289 states and 698 transitions. [2018-12-09 18:40:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 698 transitions. [2018-12-09 18:40:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 18:40:46,562 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 291 states and 704 transitions. [2018-12-09 18:40:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 704 transitions. [2018-12-09 18:40:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 18:40:53,622 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 292 states and 709 transitions. [2018-12-09 18:40:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 709 transitions. [2018-12-09 18:40:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 18:40:55,155 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 296 states and 726 transitions. [2018-12-09 18:40:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 726 transitions. [2018-12-09 18:40:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 18:40:58,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:40:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:40:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 297 states and 727 transitions. [2018-12-09 18:40:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 727 transitions. [2018-12-09 18:40:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 18:40:59,661 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:40:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:41:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 18:41:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 301 states and 744 transitions. [2018-12-09 18:41:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 744 transitions. [2018-12-09 18:41:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 18:41:03,308 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 18:41:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:41:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:41:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:41:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:41:04,674 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2018-12-09 18:41:04,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 06:41:04 ImpRootNode [2018-12-09 18:41:04,751 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 18:41:04,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:41:04,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:41:04,752 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:41:04,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:38:29" (3/4) ... [2018-12-09 18:41:04,754 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 18:41:04,838 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6f64e4e1-1fad-4a33-bb1a-08c92329b228/bin-2019/ukojak/witness.graphml [2018-12-09 18:41:04,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:41:04,839 INFO L168 Benchmark]: Toolchain (without parser) took 156669.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 962.4 MB in the beginning and 916.5 MB in the end (delta: 45.9 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:04,839 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:41:04,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:04,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:41:04,840 INFO L168 Benchmark]: Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:04,840 INFO L168 Benchmark]: RCFGBuilder took 1297.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.9 MB). Peak memory consumption was 339.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:04,840 INFO L168 Benchmark]: CodeCheck took 155006.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 14.7 MB). Free memory was 1.2 GB in the beginning and 942.8 MB in the end (delta: 255.0 MB). Peak memory consumption was 269.7 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:04,840 INFO L168 Benchmark]: Witness Printer took 86.89 ms. Allocated memory is still 1.3 GB. Free memory was 942.8 MB in the beginning and 916.5 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:04,841 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, 129 locations, 1 error locations. UNSAFE Result, 154.9s OverallTime, 49 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 559153076 SDtfs, 209027892 SDslu, 1124496704 SDs, 0 SdLazy, -1364632928 SolverSat, 438418788 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13871 GetRequests, 12072 SyntacticMatches, 769 SemanticMatches, 1030 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659049 ImplicationChecksByTransitivity, 146.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1339 NumberOfCodeBlocks, 1339 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1243 ConstructedInterpolants, 0 QuantifiedInterpolants, 497009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 131/726 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: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND TRUE \read(r121) [L291] COND TRUE \read(ep23) [L292] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND TRUE \read(r321) [L330] COND TRUE \read(ep21) [L331] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] return (tmp___5); [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, 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] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND TRUE \read(ep23) [L193] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=4, m2=-2, m3=4, max1=0, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND TRUE (int )m1 > (int )max1 [L126] max1 = m1 [L129] COND FALSE !(\read(ep31)) [L136] COND FALSE !((int )r1 == 2) [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND TRUE (int )m3 > (int )max3 [L219] max3 = m3 [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, 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] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND TRUE \read(ep23) [L193] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=2, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] st1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND TRUE (int )r3 == 2 [L223] COND FALSE !((int )max3 == (int )id3) [L226] nl3 = (char)1 [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L601] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=2, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1297.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -100.9 MB). Peak memory consumption was 339.4 MB. Max. memory is 11.5 GB. * CodeCheck took 155006.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 14.7 MB). Free memory was 1.2 GB in the beginning and 942.8 MB in the end (delta: 255.0 MB). Peak memory consumption was 269.7 MB. Max. memory is 11.5 GB. * Witness Printer took 86.89 ms. Allocated memory is still 1.3 GB. Free memory was 942.8 MB in the beginning and 916.5 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...