./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2788ace6529ac5317fd0883a099d1d1e7ba5f873 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-69874e2 [2020-12-01 17:54:36,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:54:36,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:54:36,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:54:36,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:54:36,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:54:36,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:54:36,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:54:36,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:54:36,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:54:36,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:54:36,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:54:36,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:54:36,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:54:36,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:54:36,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:54:36,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:54:36,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:54:36,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:54:36,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:54:36,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:54:36,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:54:36,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:54:36,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:54:36,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:54:36,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:54:36,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:54:36,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:54:36,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:54:36,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:54:36,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:54:36,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:54:36,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:54:36,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:54:36,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:54:36,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:54:36,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:54:36,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:54:36,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:54:36,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:54:36,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:54:36,281 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:54:36,329 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:54:36,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:54:36,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:54:36,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:54:36,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:54:36,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:54:36,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:54:36,333 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:54:36,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:54:36,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:54:36,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:54:36,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:54:36,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:54:36,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:54:36,336 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:54:36,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:54:36,337 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:54:36,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:54:36,337 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:54:36,337 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:54:36,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:54:36,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:54:36,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:54:36,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:54:36,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:54:36,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:54:36,339 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:54:36,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:54:36,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:54:36,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 2788ace6529ac5317fd0883a099d1d1e7ba5f873 [2020-12-01 17:54:36,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:54:36,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:54:36,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:54:36,695 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:54:36,697 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:54:36,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2020-12-01 17:54:36,791 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/data/518d90128/ab92ab464d8746bda2287ba0d73d3b55/FLAGb4e904192 [2020-12-01 17:54:37,517 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:54:37,518 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2020-12-01 17:54:37,535 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/data/518d90128/ab92ab464d8746bda2287ba0d73d3b55/FLAGb4e904192 [2020-12-01 17:54:37,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/data/518d90128/ab92ab464d8746bda2287ba0d73d3b55 [2020-12-01 17:54:37,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:54:37,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:54:37,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:54:37,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:54:37,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:54:37,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:54:37" (1/1) ... [2020-12-01 17:54:37,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761f3f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:37, skipping insertion in model container [2020-12-01 17:54:37,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:54:37" (1/1) ... [2020-12-01 17:54:37,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:54:37,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:54:38,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:54:38,205 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:54:38,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:54:38,325 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:54:38,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38 WrapperNode [2020-12-01 17:54:38,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:54:38,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:54:38,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:54:38,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:54:38,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:54:38,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:54:38,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:54:38,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:54:38,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... [2020-12-01 17:54:38,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:54:38,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:54:38,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:54:38,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:54:38,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:54:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:54:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:54:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:54:38,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:54:38,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:54:42,545 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:54:42,545 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-01 17:54:42,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:54:42 BoogieIcfgContainer [2020-12-01 17:54:42,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:54:42,550 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:54:42,551 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:54:42,564 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:54:42,564 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:54:42" (1/1) ... [2020-12-01 17:54:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:54:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2020-12-01 17:54:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-12-01 17:54:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 17:54:42,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2020-12-01 17:54:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-12-01 17:54:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 17:54:43,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2020-12-01 17:54:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-12-01 17:54:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 17:54:44,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2020-12-01 17:54:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-12-01 17:54:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:54:44,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2020-12-01 17:54:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-12-01 17:54:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 17:54:45,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2020-12-01 17:54:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2020-12-01 17:54:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 17:54:47,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2020-12-01 17:54:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2020-12-01 17:54:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 17:54:48,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2020-12-01 17:54:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2020-12-01 17:54:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:54:49,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2020-12-01 17:54:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-12-01 17:54:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:54:49,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2020-12-01 17:54:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2020-12-01 17:54:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 17:54:52,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 59 states and 106 transitions. [2020-12-01 17:54:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2020-12-01 17:54:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:54:52,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 74 states and 135 transitions. [2020-12-01 17:55:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2020-12-01 17:55:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:55:00,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:02,445 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-12-01 17:55:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 90 states and 165 transitions. [2020-12-01 17:55:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 165 transitions. [2020-12-01 17:55:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:55:09,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 91 states and 168 transitions. [2020-12-01 17:55:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 168 transitions. [2020-12-01 17:55:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:55:10,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:11,522 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-12-01 17:55:12,316 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-01 17:55:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 108 states and 201 transitions. [2020-12-01 17:55:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 201 transitions. [2020-12-01 17:55:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:55:21,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 110 states and 205 transitions. [2020-12-01 17:55:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 205 transitions. [2020-12-01 17:55:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:55:22,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 111 states and 209 transitions. [2020-12-01 17:55:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 209 transitions. [2020-12-01 17:55:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:55:23,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:25,775 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-12-01 17:55:29,918 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-01 17:55:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 124 states and 235 transitions. [2020-12-01 17:55:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 235 transitions. [2020-12-01 17:55:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:55:34,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 125 states and 236 transitions. [2020-12-01 17:55:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 236 transitions. [2020-12-01 17:55:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:55:35,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 127 states and 242 transitions. [2020-12-01 17:55:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 242 transitions. [2020-12-01 17:55:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:55:37,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 128 states and 243 transitions. [2020-12-01 17:55:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 243 transitions. [2020-12-01 17:55:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:55:38,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:38,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:39,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:39,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:39,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:50,202 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2020-12-01 17:55:50,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:55:50 ImpRootNode [2020-12-01 17:55:50,378 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:55:50,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:55:50,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:55:50,379 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:55:50,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:54:42" (3/4) ... [2020-12-01 17:55:50,382 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:55:50,586 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_71a2ffce-9a30-4e1b-bcc5-8eda13f9ad15/bin/ukojak/witness.graphml [2020-12-01 17:55:50,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:55:50,587 INFO L168 Benchmark]: Toolchain (without parser) took 72774.67 ms. Allocated memory was 96.5 MB in the beginning and 587.2 MB in the end (delta: 490.7 MB). Free memory was 67.5 MB in the beginning and 474.4 MB in the end (delta: -406.9 MB). Peak memory consumption was 82.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,590 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 96.5 MB. Free memory was 56.2 MB in the beginning and 56.2 MB in the end (delta: 48.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:55:50,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.90 ms. Allocated memory is still 96.5 MB. Free memory was 67.2 MB in the beginning and 66.4 MB in the end (delta: 892.9 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.14 ms. Allocated memory is still 96.5 MB. Free memory was 66.4 MB in the beginning and 63.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,591 INFO L168 Benchmark]: Boogie Preprocessor took 66.80 ms. Allocated memory is still 96.5 MB. Free memory was 63.3 MB in the beginning and 60.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,592 INFO L168 Benchmark]: RCFGBuilder took 4066.15 ms. Allocated memory was 96.5 MB in the beginning and 161.5 MB in the end (delta: 65.0 MB). Free memory was 60.7 MB in the beginning and 67.1 MB in the end (delta: -6.4 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,592 INFO L168 Benchmark]: CodeCheck took 67827.73 ms. Allocated memory was 161.5 MB in the beginning and 587.2 MB in the end (delta: 425.7 MB). Free memory was 67.1 MB in the beginning and 489.1 MB in the end (delta: -421.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,593 INFO L168 Benchmark]: Witness Printer took 207.66 ms. Allocated memory is still 587.2 MB. Free memory was 489.1 MB in the beginning and 474.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:50,595 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 67.6s, OverallIterations: 21, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5611520 SDtfs, 4051636 SDslu, 3244032 SDs, 0 SdLazy, 26335820 SolverSat, 5863956 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3344 GetRequests, 2857 SyntacticMatches, 109 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77522 ImplicationChecksByTransitivity, 47.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 39959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 20/60 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] i2 = init() [L22] COND FALSE !(!cond) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L523] return (tmp); [L595] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=2, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 1 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND TRUE (int )m2 > (int )max2 [L146] max2 = m2 [L147] newmax = (_Bool)1 [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND TRUE (int )m3 > (int )max3 [L200] max3 = m3 [L201] newmax = (_Bool)1 [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L482] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L509] tmp = 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L608] COND TRUE ! arg VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L3] __assert_fail("0", "pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=255, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 96.5 MB. Free memory was 56.2 MB in the beginning and 56.2 MB in the end (delta: 48.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.90 ms. Allocated memory is still 96.5 MB. Free memory was 67.2 MB in the beginning and 66.4 MB in the end (delta: 892.9 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.14 ms. Allocated memory is still 96.5 MB. Free memory was 66.4 MB in the beginning and 63.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.80 ms. Allocated memory is still 96.5 MB. Free memory was 63.3 MB in the beginning and 60.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4066.15 ms. Allocated memory was 96.5 MB in the beginning and 161.5 MB in the end (delta: 65.0 MB). Free memory was 60.7 MB in the beginning and 67.1 MB in the end (delta: -6.4 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. * CodeCheck took 67827.73 ms. Allocated memory was 161.5 MB in the beginning and 587.2 MB in the end (delta: 425.7 MB). Free memory was 67.1 MB in the beginning and 489.1 MB in the end (delta: -421.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Witness Printer took 207.66 ms. Allocated memory is still 587.2 MB. Free memory was 489.1 MB in the beginning and 474.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...