./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4 --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 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-15 00:50:12,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 00:50:12,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 00:50:12,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 00:50:12,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 00:50:12,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 00:50:12,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 00:50:12,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 00:50:12,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 00:50:12,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 00:50:12,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 00:50:12,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 00:50:12,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 00:50:12,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 00:50:12,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 00:50:12,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 00:50:12,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 00:50:12,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 00:50:12,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 00:50:12,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 00:50:12,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 00:50:12,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 00:50:12,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 00:50:12,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 00:50:12,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 00:50:12,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 00:50:12,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 00:50:12,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 00:50:12,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 00:50:12,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 00:50:12,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 00:50:12,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 00:50:12,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 00:50:12,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 00:50:12,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 00:50:12,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 00:50:12,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 00:50:12,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 00:50:12,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 00:50:12,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 00:50:12,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 00:50:12,164 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 00:50:12,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 00:50:12,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 00:50:12,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 00:50:12,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 00:50:12,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 00:50:12,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 00:50:12,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 00:50:12,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 00:50:12,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 00:50:12,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 00:50:12,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 00:50:12,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 00:50:12,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 00:50:12,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 00:50:12,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 00:50:12,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 00:50:12,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 00:50:12,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 00:50:12,179 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 00:50:12,180 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 00:50:12,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 00:50:12,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:50:12,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 00:50:12,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 00:50:12,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 00:50:12,180 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 00:50:12,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 00:50:12,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 00:50:12,181 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_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/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_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4 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 -> 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b [2022-12-15 00:50:12,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 00:50:12,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 00:50:12,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 00:50:12,381 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 00:50:12,382 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 00:50:12,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-12-15 00:50:14,901 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 00:50:15,065 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 00:50:15,065 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-12-15 00:50:15,072 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/data/63364e4c0/8a4a151aad3a4ccda0e7e9360c66590e/FLAG97e1299c8 [2022-12-15 00:50:15,473 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/data/63364e4c0/8a4a151aad3a4ccda0e7e9360c66590e [2022-12-15 00:50:15,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 00:50:15,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 00:50:15,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 00:50:15,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 00:50:15,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 00:50:15,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786e7216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15, skipping insertion in model container [2022-12-15 00:50:15,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 00:50:15,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 00:50:15,676 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2022-12-15 00:50:15,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:50:15,687 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 00:50:15,728 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2022-12-15 00:50:15,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:50:15,745 INFO L208 MainTranslator]: Completed translation [2022-12-15 00:50:15,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15 WrapperNode [2022-12-15 00:50:15,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 00:50:15,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 00:50:15,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 00:50:15,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 00:50:15,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,790 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2022-12-15 00:50:15,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 00:50:15,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 00:50:15,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 00:50:15,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 00:50:15,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 00:50:15,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 00:50:15,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 00:50:15,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 00:50:15,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:50:15" (1/1) ... [2022-12-15 00:50:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:50:15,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 00:50:15,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 00:50:15,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 00:50:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 00:50:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 00:50:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 00:50:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 00:50:15,984 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 00:50:15,990 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 00:50:16,409 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 00:50:16,836 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 00:50:16,837 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 00:50:16,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:50:16 BoogieIcfgContainer [2022-12-15 00:50:16,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 00:50:16,840 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 00:50:16,840 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 00:50:16,848 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 00:50:16,848 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:50:16" (1/1) ... [2022-12-15 00:50:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 00:50:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-15 00:50:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-15 00:50:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-15 00:50:16,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2022-12-15 00:50:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2022-12-15 00:50:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-15 00:50:18,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 24 states and 42 transitions. [2022-12-15 00:50:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2022-12-15 00:50:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-15 00:50:19,322 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 28 states and 52 transitions. [2022-12-15 00:50:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2022-12-15 00:50:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-15 00:50:20,223 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 33 states and 64 transitions. [2022-12-15 00:50:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 64 transitions. [2022-12-15 00:50:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-15 00:50:21,340 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 40 states and 78 transitions. [2022-12-15 00:50:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 78 transitions. [2022-12-15 00:50:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-15 00:50:22,777 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:22,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 46 states and 91 transitions. [2022-12-15 00:50:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 91 transitions. [2022-12-15 00:50:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-15 00:50:24,155 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 47 states and 91 transitions. [2022-12-15 00:50:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 91 transitions. [2022-12-15 00:50:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 00:50:24,207 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 48 states and 92 transitions. [2022-12-15 00:50:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2022-12-15 00:50:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 00:50:24,255 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 58 states and 110 transitions. [2022-12-15 00:50:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 110 transitions. [2022-12-15 00:50:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-15 00:50:26,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 61 states and 115 transitions. [2022-12-15 00:50:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 115 transitions. [2022-12-15 00:50:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-15 00:50:26,756 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 77 states and 151 transitions. [2022-12-15 00:50:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 151 transitions. [2022-12-15 00:50:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-15 00:50:31,460 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 92 states and 181 transitions. [2022-12-15 00:50:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 181 transitions. [2022-12-15 00:50:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-15 00:50:36,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 93 states and 184 transitions. [2022-12-15 00:50:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 184 transitions. [2022-12-15 00:50:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:50:37,393 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 111 states and 224 transitions. [2022-12-15 00:50:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 224 transitions. [2022-12-15 00:50:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:50:43,053 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 112 states and 227 transitions. [2022-12-15 00:50:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 227 transitions. [2022-12-15 00:50:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:50:44,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 113 states and 231 transitions. [2022-12-15 00:50:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 231 transitions. [2022-12-15 00:50:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:50:46,711 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 123 states and 246 transitions. [2022-12-15 00:50:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 246 transitions. [2022-12-15 00:50:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:50:49,988 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:50:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:50:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 141 states and 282 transitions. [2022-12-15 00:50:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 282 transitions. [2022-12-15 00:50:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:50:55,858 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:50:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:50:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:50:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:51:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:51:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 157 states and 311 transitions. [2022-12-15 00:51:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 311 transitions. [2022-12-15 00:51:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:51:01,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:51:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:51:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:51:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:51:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:51:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 162 states and 326 transitions. [2022-12-15 00:51:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 326 transitions. [2022-12-15 00:51:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-15 00:51:06,755 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:51:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:51:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:51:06,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:51:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:51:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:51:07,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:51:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:51:07,367 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2022-12-15 00:51:07,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 12:51:07 ImpRootNode [2022-12-15 00:51:07,454 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 00:51:07,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 00:51:07,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 00:51:07,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 00:51:07,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:50:16" (3/4) ... [2022-12-15 00:51:07,457 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 00:51:07,571 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 00:51:07,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 00:51:07,572 INFO L158 Benchmark]: Toolchain (without parser) took 52095.54ms. Allocated memory was 113.2MB in the beginning and 545.3MB in the end (delta: 432.0MB). Free memory was 78.4MB in the beginning and 394.3MB in the end (delta: -315.9MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,572 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 00:51:07,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.21ms. Allocated memory is still 113.2MB. Free memory was 78.4MB in the beginning and 62.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.30ms. Allocated memory is still 113.2MB. Free memory was 62.3MB in the beginning and 59.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,573 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 113.2MB. Free memory was 59.2MB in the beginning and 56.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,574 INFO L158 Benchmark]: RCFGBuilder took 1021.44ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 56.9MB in the beginning and 104.2MB in the end (delta: -47.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,574 INFO L158 Benchmark]: CodeCheck took 50613.96ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 104.2MB in the beginning and 403.7MB in the end (delta: -299.4MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,574 INFO L158 Benchmark]: Witness Printer took 117.30ms. Allocated memory is still 545.3MB. Free memory was 403.7MB in the beginning and 394.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-15 00:51:07,576 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 21, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2627 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2045 mSDsluCounter, 876 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 574 mSDsCounter, 969 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7578 IncrementalHoareTripleChecker+Invalid, 8547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 969 mSolverCounterUnsat, 302 mSDtfsCounter, 7578 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3499 GetRequests, 2962 SyntacticMatches, 73 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121694 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 3681 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: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND TRUE \read(r211) [L271] COND TRUE \read(ep13) [L272] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND TRUE \read(ep21) [L285] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [c1=0, ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, i2=0, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, 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] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, i2=1, id1=126, id2=125, id3=127, m1=126, m2=0, m3=0, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 1 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND TRUE (int )m2 > (int )max2 [L124] max2 = m2 [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND TRUE (int )m2 > (int )max2 [L131] max2 = m2 [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L430] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L457] tmp = 0 VAL [ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] [L555] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.21ms. Allocated memory is still 113.2MB. Free memory was 78.4MB in the beginning and 62.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.30ms. Allocated memory is still 113.2MB. Free memory was 62.3MB in the beginning and 59.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 113.2MB. Free memory was 59.2MB in the beginning and 56.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1021.44ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 56.9MB in the beginning and 104.2MB in the end (delta: -47.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * CodeCheck took 50613.96ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 104.2MB in the beginning and 403.7MB in the end (delta: -299.4MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 117.30ms. Allocated memory is still 545.3MB. Free memory was 403.7MB in the beginning and 394.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 00:51:07,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_feedfde2-2f80-4d02-b927-d2641275aca7/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE