./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- 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-14 18:43:23,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 18:43:23,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 18:43:23,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 18:43:23,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 18:43:23,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 18:43:23,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 18:43:23,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 18:43:23,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 18:43:23,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 18:43:23,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 18:43:23,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 18:43:23,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 18:43:23,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 18:43:23,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 18:43:23,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 18:43:23,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 18:43:23,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 18:43:23,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 18:43:23,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 18:43:23,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 18:43:23,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 18:43:23,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 18:43:23,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 18:43:23,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 18:43:23,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 18:43:23,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 18:43:23,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 18:43:23,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 18:43:23,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 18:43:23,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 18:43:23,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 18:43:23,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 18:43:23,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 18:43:23,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 18:43:23,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 18:43:23,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 18:43:23,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 18:43:23,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 18:43:23,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 18:43:23,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 18:43:23,470 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 18:43:23,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 18:43:23,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 18:43:23,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 18:43:23,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 18:43:23,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 18:43:23,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 18:43:23,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 18:43:23,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 18:43:23,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 18:43:23,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 18:43:23,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 18:43:23,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 18:43:23,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 18:43:23,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 18:43:23,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 18:43:23,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 18:43:23,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 18:43:23,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 18:43:23,496 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 18:43:23,496 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 18:43:23,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 18:43:23,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 18:43:23,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 18:43:23,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 18:43:23,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 18:43:23,497 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 18:43:23,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 18:43:23,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 18:43:23,497 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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-12-14 18:43:23,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 18:43:23,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 18:43:23,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 18:43:23,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 18:43:23,718 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 18:43:23,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-12-14 18:43:26,393 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 18:43:26,568 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 18:43:26,568 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-12-14 18:43:26,576 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/data/e5d6a90c5/71425befb9734a1bb418f318c6db7255/FLAGf33f33785 [2022-12-14 18:43:26,590 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/data/e5d6a90c5/71425befb9734a1bb418f318c6db7255 [2022-12-14 18:43:26,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 18:43:26,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 18:43:26,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 18:43:26,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 18:43:26,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 18:43:26,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba2b39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26, skipping insertion in model container [2022-12-14 18:43:26,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 18:43:26,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 18:43:26,781 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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-12-14 18:43:26,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 18:43:26,794 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 18:43:26,826 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_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-12-14 18:43:26,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 18:43:26,841 INFO L208 MainTranslator]: Completed translation [2022-12-14 18:43:26,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26 WrapperNode [2022-12-14 18:43:26,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 18:43:26,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 18:43:26,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 18:43:26,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 18:43:26,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,874 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2022-12-14 18:43:26,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 18:43:26,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 18:43:26,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 18:43:26,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 18:43:26,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,895 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 18:43:26,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 18:43:26,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 18:43:26,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 18:43:26,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:43:26" (1/1) ... [2022-12-14 18:43:26,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 18:43:26,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 18:43:26,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 18:43:26,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 18:43:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 18:43:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 18:43:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 18:43:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 18:43:27,031 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 18:43:27,032 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 18:43:27,267 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 18:43:27,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 18:43:27,448 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 18:43:27,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:43:27 BoogieIcfgContainer [2022-12-14 18:43:27,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 18:43:27,450 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 18:43:27,450 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 18:43:27,457 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 18:43:27,458 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:43:27" (1/1) ... [2022-12-14 18:43:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 18:43:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2022-12-14 18:43:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-12-14 18:43:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 18:43:27,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:28,080 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-14 18:43:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2022-12-14 18:43:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-12-14 18:43:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 18:43:28,145 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:28,353 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-14 18:43:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 16 states and 24 transitions. [2022-12-14 18:43:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2022-12-14 18:43:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 18:43:28,578 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:28,883 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-14 18:43:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 20 states and 30 transitions. [2022-12-14 18:43:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2022-12-14 18:43:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 18:43:29,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:29,343 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-14 18:43:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 23 states and 34 transitions. [2022-12-14 18:43:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-12-14 18:43:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 18:43:29,517 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:30,798 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-14 18:43:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 33 states and 50 transitions. [2022-12-14 18:43:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2022-12-14 18:43:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 18:43:32,958 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:43:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 41 states and 63 transitions. [2022-12-14 18:43:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2022-12-14 18:43:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 18:43:34,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:36,286 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-14 18:43:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 50 states and 77 transitions. [2022-12-14 18:43:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2022-12-14 18:43:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 18:43:39,065 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:40,863 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-14 18:43:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 61 states and 96 transitions. [2022-12-14 18:43:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2022-12-14 18:43:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 18:43:44,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:43:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 77 states and 133 transitions. [2022-12-14 18:43:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2022-12-14 18:43:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 18:43:50,087 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:43:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 85 states and 146 transitions. [2022-12-14 18:43:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 146 transitions. [2022-12-14 18:43:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 18:43:53,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:43:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:43:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 94 states and 161 transitions. [2022-12-14 18:43:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2022-12-14 18:43:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 18:43:58,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:43:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:43:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:43:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:44:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:44:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 95 states and 164 transitions. [2022-12-14 18:44:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 164 transitions. [2022-12-14 18:44:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 18:44:00,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:44:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:44:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:44:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:44:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:44:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 120 states and 238 transitions. [2022-12-14 18:44:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 238 transitions. [2022-12-14 18:44:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 18:44:56,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:44:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:44:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:45:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:45:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:45:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 145 states and 294 transitions. [2022-12-14 18:45:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 294 transitions. [2022-12-14 18:45:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 18:45:47,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:45:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:45:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:45:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:46:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:46:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 169 states and 346 transitions. [2022-12-14 18:46:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 346 transitions. [2022-12-14 18:46:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 18:46:57,928 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:46:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:46:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:47:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:47:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:47:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 179 states and 371 transitions. [2022-12-14 18:47:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 371 transitions. [2022-12-14 18:47:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 18:47:30,203 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:47:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:47:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:47:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:48:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:48:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 196 states and 426 transitions. [2022-12-14 18:48:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 426 transitions. [2022-12-14 18:48:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 18:48:30,527 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:48:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:48:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:48:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:48:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:48:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 202 states and 444 transitions. [2022-12-14 18:48:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 444 transitions. [2022-12-14 18:48:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 18:48:56,941 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:48:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:48:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:49:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:49:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:49:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 208 states and 455 transitions. [2022-12-14 18:49:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 455 transitions. [2022-12-14 18:49:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 18:49:13,996 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:49:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:49:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:49:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:49:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:49:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 214 states and 466 transitions. [2022-12-14 18:49:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 466 transitions. [2022-12-14 18:49:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:49:30,320 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:49:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:49:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:49:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:49:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:49:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 216 states and 472 transitions. [2022-12-14 18:49:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 472 transitions. [2022-12-14 18:49:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:49:56,286 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:49:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:49:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:50:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:50:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:50:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 230 states and 517 transitions. [2022-12-14 18:50:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 517 transitions. [2022-12-14 18:50:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:50:47,091 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:50:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:50:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:50:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 18:50:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:50:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 233 states and 528 transitions. [2022-12-14 18:50:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 528 transitions. [2022-12-14 18:50:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:50:58,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:50:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:50:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:51:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:51:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:51:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 245 states and 548 transitions. [2022-12-14 18:51:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 548 transitions. [2022-12-14 18:51:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:51:32,247 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:51:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:51:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:51:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:52:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:52:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 258 states and 584 transitions. [2022-12-14 18:52:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 584 transitions. [2022-12-14 18:52:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:52:30,957 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:52:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:52:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:52:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:52:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:52:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 259 states and 584 transitions. [2022-12-14 18:52:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 584 transitions. [2022-12-14 18:52:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:52:55,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:52:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:52:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:53:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:54:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:54:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 274 states and 627 transitions. [2022-12-14 18:54:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 627 transitions. [2022-12-14 18:54:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:54:04,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:54:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:54:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:54:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:54:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:54:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 281 states and 642 transitions. [2022-12-14 18:54:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 642 transitions. [2022-12-14 18:54:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:54:35,347 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:54:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:54:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:54:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 18:55:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:55:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 283 states and 649 transitions. [2022-12-14 18:55:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 649 transitions. [2022-12-14 18:55:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 18:55:07,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:55:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:55:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 18:55:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 18:55:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 18:55:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 289 states and 665 transitions. [2022-12-14 18:55:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 665 transitions. [2022-12-14 18:55:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 18:55:29,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 18:55:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 18:55:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:55:29,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 18:55:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:55:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:55:30,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 18:55:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 18:55:30,422 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 31 iterations. [2022-12-14 18:55:30,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 06:55:30 ImpRootNode [2022-12-14 18:55:30,508 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 18:55:30,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 18:55:30,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 18:55:30,509 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 18:55:30,509 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:43:27" (3/4) ... [2022-12-14 18:55:30,510 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 18:55:30,630 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 18:55:30,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 18:55:30,631 INFO L158 Benchmark]: Toolchain (without parser) took 724036.98ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 58.9MB in the beginning and 81.8MB in the end (delta: -22.9MB). Peak memory consumption was 465.6MB. Max. memory is 16.1GB. [2022-12-14 18:55:30,631 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 18:55:30,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.87ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 45.9MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 18:55:30,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.09ms. Allocated memory is still 100.7MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 18:55:30,632 INFO L158 Benchmark]: Boogie Preprocessor took 24.37ms. Allocated memory is still 100.7MB. Free memory was 43.8MB in the beginning and 42.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 18:55:30,632 INFO L158 Benchmark]: RCFGBuilder took 549.80ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 42.1MB in the beginning and 94.3MB in the end (delta: -52.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-12-14 18:55:30,632 INFO L158 Benchmark]: CodeCheck took 723057.69ms. Allocated memory was 132.1MB in the beginning and 587.2MB in the end (delta: 455.1MB). Free memory was 94.3MB in the beginning and 92.3MB in the end (delta: 2.0MB). Peak memory consumption was 456.7MB. Max. memory is 16.1GB. [2022-12-14 18:55:30,633 INFO L158 Benchmark]: Witness Printer took 121.78ms. Allocated memory is still 587.2MB. Free memory was 92.3MB in the beginning and 81.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 18:55:30,634 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 723.0s, OverallIterations: 31, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8940 SdHoareTripleChecker+Valid, 110.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8388 mSDsluCounter, 5248 SdHoareTripleChecker+Invalid, 100.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5099 mSDsCounter, 3064 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25937 IncrementalHoareTripleChecker+Invalid, 29001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3064 mSolverCounterUnsat, 149 mSDtfsCounter, 25937 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9922 GetRequests, 8479 SyntacticMatches, 427 SemanticMatches, 1016 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604426 ImplicationChecksByTransitivity, 648.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 159.1s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 823 ConstructedInterpolants, 0 QuantifiedInterpolants, 55062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 263/1192 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: 287]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] port_t p2 ; [L38] char p2_old ; [L39] char p2_new ; [L40] char id2 ; [L41] char st2 ; [L42] msg_t send2 ; [L43] _Bool mode2 ; [L44] port_t p3 ; [L45] char p3_old ; [L46] char p3_new ; [L47] char id3 ; [L48] char st3 ; [L49] msg_t send3 ; [L50] _Bool mode3 ; [L235] int c1 ; [L236] int i2 ; [L239] c1 = 0 [L240] r1 = __VERIFIER_nondet_uchar() [L241] id1 = __VERIFIER_nondet_char() [L242] st1 = __VERIFIER_nondet_char() [L243] send1 = __VERIFIER_nondet_char() [L244] mode1 = __VERIFIER_nondet_bool() [L245] id2 = __VERIFIER_nondet_char() [L246] st2 = __VERIFIER_nondet_char() [L247] send2 = __VERIFIER_nondet_char() [L248] mode2 = __VERIFIER_nondet_bool() [L249] id3 = __VERIFIER_nondet_char() [L250] st3 = __VERIFIER_nondet_char() [L251] send3 = __VERIFIER_nondet_char() [L252] mode3 = __VERIFIER_nondet_bool() [L253] CALL, EXPR init() [L134] int tmp ; [L137] COND TRUE (int )r1 == 0 [L138] COND TRUE (int )id1 >= 0 [L139] COND TRUE (int )st1 == 0 [L140] COND TRUE (int )send1 == (int )id1 [L141] COND TRUE (int )mode1 == 0 [L142] COND TRUE (int )id2 >= 0 [L143] COND TRUE (int )st2 == 0 [L144] COND TRUE (int )send2 == (int )id2 [L145] COND TRUE (int )mode2 == 0 [L146] COND TRUE (int )id3 >= 0 [L147] COND TRUE (int )st3 == 0 [L148] COND TRUE (int )send3 == (int )id3 [L149] COND TRUE (int )mode3 == 0 [L150] COND TRUE (int )id1 != (int )id2 [L151] COND TRUE (int )id1 != (int )id3 [L152] COND TRUE (int )id2 != (int )id3 [L153] tmp = 1 [L202] return (tmp); [L253] RET, EXPR init() [L253] i2 = init() [L254] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L254] RET assume_abort_if_not(i2) [L255] p1_old = nomsg [L256] p1_new = nomsg [L257] p2_old = nomsg [L258] p2_new = nomsg [L259] p3_old = nomsg [L260] p3_new = nomsg [L261] i2 = 0 VAL [c1=0, i2=0, id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=108, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=107, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=108, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=107, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=108, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=107, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=108, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=107, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=108, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=107, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=108, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=107, r1=0, send1=108, send2=0, send3=107, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND FALSE !((int )m3 > (int )id3) [L120] COND FALSE !((int )m3 == (int )id3) [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=108, p3=0, p3_new=-1, p3_old=107, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=108, p3=0, p3_new=-1, p3_old=107, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=108, p3=0, p3_new=-1, p3_old=107, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=108, p3=0, p3_new=-1, p3_old=107, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=108, p3=0, p3_new=-1, p3_old=107, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=108, p3=0, p3_new=-1, p3_old=107, r1=1, send1=107, send2=108, send3=107, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=107, p3=0, p3_new=-1, p3_old=108, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=107, p3=0, p3_new=-1, p3_old=108, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=107, p3=0, p3_new=-1, p3_old=108, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=107, p3=0, p3_new=-1, p3_old=108, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=107, p3=0, p3_new=-1, p3_old=108, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, id1=108, id2=0, id3=107, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=107, p2=0, p2_new=-1, p2_old=107, p3=0, p3_new=-1, p3_old=108, r1=2, send1=107, send2=107, send3=108, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND TRUE (int )m1 == (int )id1 [L69] st1 = (char)1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND FALSE !((int )m3 > (int )id3) [L120] COND TRUE (int )m3 == (int )id3 [L121] st3 = (char)1 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=107, send2=107, send3=108, st1=1, st2=0, st3=1] [L210] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L228] tmp = 0 VAL [id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=107, send2=107, send3=108, st1=1, st2=0, st3=1, tmp=0] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND TRUE ! arg VAL [\old(arg)=0, arg=0, id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=107, send2=107, send3=108, st1=1, st2=0, st3=1] [L287] reach_error() VAL [\old(arg)=0, arg=0, id1=108, id2=0, id3=107, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=107, send2=107, send3=108, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.87ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 45.9MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.09ms. Allocated memory is still 100.7MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.37ms. Allocated memory is still 100.7MB. Free memory was 43.8MB in the beginning and 42.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 549.80ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 42.1MB in the beginning and 94.3MB in the end (delta: -52.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * CodeCheck took 723057.69ms. Allocated memory was 132.1MB in the beginning and 587.2MB in the end (delta: 455.1MB). Free memory was 94.3MB in the beginning and 92.3MB in the end (delta: 2.0MB). Peak memory consumption was 456.7MB. Max. memory is 16.1GB. * Witness Printer took 121.78ms. Allocated memory is still 587.2MB. Free memory was 92.3MB in the beginning and 81.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 18:55:30,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8338f03-d4d2-4d31-9cfe-d6a0cccd6782/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