./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- 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-4e7fbc6 [2022-11-23 01:57:56,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:57:56,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:57:56,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:57:56,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:57:56,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:57:56,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:57:56,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:57:56,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:57:56,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:57:56,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:57:56,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:57:56,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:57:56,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:57:56,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:57:56,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:57:56,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:57:56,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:57:56,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:57:56,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:57:56,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:57:56,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:57:56,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:57:56,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:57:56,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:57:56,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:57:56,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:57:56,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:57:56,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:57:56,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:57:56,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:57:56,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:57:56,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:57:56,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:57:56,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:57:56,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:57:56,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:57:56,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:57:56,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:57:56,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:57:56,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:57:56,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 01:57:56,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:57:56,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:57:56,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:57:56,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:57:56,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:57:56,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:57:56,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:57:56,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:57:56,378 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:57:56,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:57:56,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:57:56,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:57:56,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:57:56,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:57:56,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 01:57:56,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:57:56,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 01:57:56,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:57:56,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:57:56,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:57:56,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 01:57:56,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:57:56,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:57:56,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:57:56,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:57:56,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:57:56,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:57:56,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 01:57:56,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:57:56,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:57:56,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:57:56,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 01:57:56,384 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:57:56,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:57:56,384 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/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_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS 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 -> Automizer 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2022-11-23 01:57:56,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:57:56,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:57:56,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:57:56,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:57:56,714 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:57:56,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-23 01:57:59,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:58:00,362 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:58:00,363 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-23 01:58:00,379 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/data/1ba0c4446/842bf6bc8b2646cd92681c41e931262d/FLAGbfebb5cf6 [2022-11-23 01:58:00,397 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/data/1ba0c4446/842bf6bc8b2646cd92681c41e931262d [2022-11-23 01:58:00,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:58:00,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:58:00,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:58:00,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:58:00,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:58:00,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:58:00" (1/1) ... [2022-11-23 01:58:00,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959915d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:00, skipping insertion in model container [2022-11-23 01:58:00,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:58:00" (1/1) ... [2022-11-23 01:58:00,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:58:00,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:58:00,712 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_3ad7077f-fb24-4384-b31c-00f943776ee1/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-23 01:58:00,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:58:00,918 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:58:00,938 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_3ad7077f-fb24-4384-b31c-00f943776ee1/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-23 01:58:01,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:58:01,070 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:58:01,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01 WrapperNode [2022-11-23 01:58:01,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:58:01,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:58:01,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:58:01,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:58:01,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,154 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-11-23 01:58:01,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:58:01,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:58:01,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:58:01,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:58:01,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,204 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:58:01,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:58:01,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:58:01,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:58:01,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (1/1) ... [2022-11-23 01:58:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:58:01,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:58:01,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:58:01,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:58:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:58:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:58:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:58:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:58:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:58:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:58:01,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:58:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:58:01,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:58:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:58:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:58:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:58:01,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:58:01,309 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 01:58:01,450 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:58:01,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:58:01,836 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:58:02,077 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:58:02,077 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:58:02,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:02 BoogieIcfgContainer [2022-11-23 01:58:02,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:58:02,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:58:02,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:58:02,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:58:02,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:58:00" (1/3) ... [2022-11-23 01:58:02,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac424d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:58:02, skipping insertion in model container [2022-11-23 01:58:02,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:01" (2/3) ... [2022-11-23 01:58:02,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac424d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:58:02, skipping insertion in model container [2022-11-23 01:58:02,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:02" (3/3) ... [2022-11-23 01:58:02,090 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-23 01:58:02,114 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 01:58:02,124 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:58:02,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 01:58:02,125 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:58:02,179 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:58:02,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-11-23 01:58:02,264 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-23 01:58:02,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:02,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-23 01:58:02,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-11-23 01:58:02,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-11-23 01:58:02,279 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:58:02,294 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 196 flow [2022-11-23 01:58:02,297 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 196 flow [2022-11-23 01:58:02,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 196 flow [2022-11-23 01:58:02,323 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-23 01:58:02,324 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:02,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-23 01:58:02,326 INFO L119 LiptonReduction]: Number of co-enabled transitions 1232 [2022-11-23 01:58:06,735 INFO L134 LiptonReduction]: Checked pairs total: 3115 [2022-11-23 01:58:06,735 INFO L136 LiptonReduction]: Total number of compositions: 89 [2022-11-23 01:58:06,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:58:06,774 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b1c76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:58:06,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-23 01:58:06,780 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-23 01:58:06,781 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:58:06,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:06,783 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 01:58:06,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash 429080, now seen corresponding path program 1 times [2022-11-23 01:58:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:06,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756574537] [2022-11-23 01:58:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:58:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:07,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756574537] [2022-11-23 01:58:07,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756574537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:07,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:07,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:58:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455471790] [2022-11-23 01:58:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:07,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:58:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:58:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:58:07,259 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 186 [2022-11-23 01:58:07,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:07,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:07,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 186 [2022-11-23 01:58:07,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:07,478 INFO L130 PetriNetUnfolder]: 173/336 cut-off events. [2022-11-23 01:58:07,478 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-23 01:58:07,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 336 events. 173/336 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1480 event pairs, 20 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 642. Up to 250 conditions per place. [2022-11-23 01:58:07,485 INFO L137 encePairwiseOnDemand]: 182/186 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2022-11-23 01:58:07,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2022-11-23 01:58:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:58:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:58:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2022-11-23 01:58:07,510 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.510752688172043 [2022-11-23 01:58:07,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2022-11-23 01:58:07,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2022-11-23 01:58:07,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:07,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2022-11-23 01:58:07,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:07,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:07,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:07,536 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 285 transitions. [2022-11-23 01:58:07,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2022-11-23 01:58:07,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:58:07,541 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2022-11-23 01:58:07,543 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-11-23 01:58:07,549 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-11-23 01:58:07,550 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2022-11-23 01:58:07,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:07,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:07,551 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:07,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:58:07,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2009335621, now seen corresponding path program 1 times [2022-11-23 01:58:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:07,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662008732] [2022-11-23 01:58:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:58:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:07,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662008732] [2022-11-23 01:58:07,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662008732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:07,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:07,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:58:07,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926319281] [2022-11-23 01:58:07,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:07,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:58:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:58:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:58:07,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 186 [2022-11-23 01:58:07,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:07,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:07,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 186 [2022-11-23 01:58:07,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:08,054 INFO L130 PetriNetUnfolder]: 167/305 cut-off events. [2022-11-23 01:58:08,055 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-23 01:58:08,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 305 events. 167/305 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1126 event pairs, 53 based on Foata normal form. 24/328 useless extension candidates. Maximal degree in co-relation 647. Up to 197 conditions per place. [2022-11-23 01:58:08,061 INFO L137 encePairwiseOnDemand]: 182/186 looper letters, 19 selfloop transitions, 2 changer transitions 12/34 dead transitions. [2022-11-23 01:58:08,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 148 flow [2022-11-23 01:58:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:58:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:58:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-11-23 01:58:08,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-11-23 01:58:08,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2022-11-23 01:58:08,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2022-11-23 01:58:08,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:08,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2022-11-23 01:58:08,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,073 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 5 states and 450 transitions. [2022-11-23 01:58:08,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 148 flow [2022-11-23 01:58:08,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:58:08,077 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2022-11-23 01:58:08,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2022-11-23 01:58:08,078 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-11-23 01:58:08,078 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2022-11-23 01:58:08,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:08,080 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:58:08,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1799823480, now seen corresponding path program 1 times [2022-11-23 01:58:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:08,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843043503] [2022-11-23 01:58:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:58:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:08,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843043503] [2022-11-23 01:58:08,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843043503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:08,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:08,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:58:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525845181] [2022-11-23 01:58:08,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:08,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:58:08,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:08,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:58:08,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:58:08,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 186 [2022-11-23 01:58:08,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:08,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 186 [2022-11-23 01:58:08,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:08,461 INFO L130 PetriNetUnfolder]: 67/153 cut-off events. [2022-11-23 01:58:08,463 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-23 01:58:08,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 153 events. 67/153 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 529 event pairs, 27 based on Foata normal form. 20/172 useless extension candidates. Maximal degree in co-relation 336. Up to 58 conditions per place. [2022-11-23 01:58:08,465 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 27 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2022-11-23 01:58:08,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 150 flow [2022-11-23 01:58:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:58:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:58:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2022-11-23 01:58:08,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48118279569892475 [2022-11-23 01:58:08,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 358 transitions. [2022-11-23 01:58:08,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 358 transitions. [2022-11-23 01:58:08,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:08,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 358 transitions. [2022-11-23 01:58:08,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,477 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,477 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 4 states and 358 transitions. [2022-11-23 01:58:08,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 150 flow [2022-11-23 01:58:08,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 142 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-23 01:58:08,480 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 68 flow [2022-11-23 01:58:08,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-11-23 01:58:08,482 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-11-23 01:58:08,482 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 68 flow [2022-11-23 01:58:08,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:08,483 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:08,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:58:08,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1407396847, now seen corresponding path program 1 times [2022-11-23 01:58:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:08,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239456971] [2022-11-23 01:58:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:58:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239456971] [2022-11-23 01:58:08,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239456971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:08,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:08,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:58:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138946979] [2022-11-23 01:58:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:08,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:58:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:58:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:58:08,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 186 [2022-11-23 01:58:08,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:08,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 186 [2022-11-23 01:58:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:08,884 INFO L130 PetriNetUnfolder]: 24/69 cut-off events. [2022-11-23 01:58:08,884 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-23 01:58:08,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 69 events. 24/69 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 10 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 182. Up to 29 conditions per place. [2022-11-23 01:58:08,885 INFO L137 encePairwiseOnDemand]: 181/186 looper letters, 18 selfloop transitions, 6 changer transitions 1/27 dead transitions. [2022-11-23 01:58:08,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 139 flow [2022-11-23 01:58:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:58:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:58:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-11-23 01:58:08,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2022-11-23 01:58:08,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 432 transitions. [2022-11-23 01:58:08,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 432 transitions. [2022-11-23 01:58:08,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:08,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 432 transitions. [2022-11-23 01:58:08,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,892 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 68 flow. Second operand 5 states and 432 transitions. [2022-11-23 01:58:08,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 139 flow [2022-11-23 01:58:08,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 126 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-23 01:58:08,894 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 80 flow [2022-11-23 01:58:08,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-11-23 01:58:08,895 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-11-23 01:58:08,895 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 80 flow [2022-11-23 01:58:08,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:08,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:08,896 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:08,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:58:08,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -550097184, now seen corresponding path program 1 times [2022-11-23 01:58:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:08,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007966189] [2022-11-23 01:58:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:58:09,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:09,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007966189] [2022-11-23 01:58:09,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007966189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:09,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:09,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:58:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239506454] [2022-11-23 01:58:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:09,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:58:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:58:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:58:09,619 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 186 [2022-11-23 01:58:09,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 81.14285714285714) internal successors, (568), 7 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:09,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:09,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 186 [2022-11-23 01:58:09,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:09,818 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2022-11-23 01:58:09,818 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-23 01:58:09,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 66 events. 19/66 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2022-11-23 01:58:09,819 INFO L137 encePairwiseOnDemand]: 179/186 looper letters, 21 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-11-23 01:58:09,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 244 flow [2022-11-23 01:58:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:58:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 01:58:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 666 transitions. [2022-11-23 01:58:09,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4475806451612903 [2022-11-23 01:58:09,823 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 666 transitions. [2022-11-23 01:58:09,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 666 transitions. [2022-11-23 01:58:09,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:09,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 666 transitions. [2022-11-23 01:58:09,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 83.25) internal successors, (666), 8 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:09,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:09,832 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 186.0) internal successors, (1674), 9 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:09,832 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 80 flow. Second operand 8 states and 666 transitions. [2022-11-23 01:58:09,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 244 flow [2022-11-23 01:58:09,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 178 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-11-23 01:58:09,836 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 66 flow [2022-11-23 01:58:09,836 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2022-11-23 01:58:09,839 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2022-11-23 01:58:09,839 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 66 flow [2022-11-23 01:58:09,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.14285714285714) internal successors, (568), 7 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:09,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:09,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:09,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:58:09,840 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 30047692, now seen corresponding path program 2 times [2022-11-23 01:58:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:09,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755836286] [2022-11-23 01:58:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:58:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:10,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755836286] [2022-11-23 01:58:10,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755836286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:10,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:58:10,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:58:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375258370] [2022-11-23 01:58:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:10,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:58:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:58:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:58:10,101 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 186 [2022-11-23 01:58:10,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:10,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:58:10,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 186 [2022-11-23 01:58:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:58:10,234 INFO L130 PetriNetUnfolder]: 31/94 cut-off events. [2022-11-23 01:58:10,234 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-23 01:58:10,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 94 events. 31/94 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 262 event pairs, 5 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 247. Up to 43 conditions per place. [2022-11-23 01:58:10,235 INFO L137 encePairwiseOnDemand]: 179/186 looper letters, 21 selfloop transitions, 7 changer transitions 11/39 dead transitions. [2022-11-23 01:58:10,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 212 flow [2022-11-23 01:58:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:58:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:58:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2022-11-23 01:58:10,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2022-11-23 01:58:10,237 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 504 transitions. [2022-11-23 01:58:10,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 504 transitions. [2022-11-23 01:58:10,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:58:10,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 504 transitions. [2022-11-23 01:58:10,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:10,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:10,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:10,242 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 66 flow. Second operand 6 states and 504 transitions. [2022-11-23 01:58:10,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 212 flow [2022-11-23 01:58:10,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 188 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-23 01:58:10,244 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 94 flow [2022-11-23 01:58:10,244 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-11-23 01:58:10,244 INFO L288 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-11-23 01:58:10,245 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 94 flow [2022-11-23 01:58:10,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:58:10,245 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:58:10,245 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:58:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:58:10,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:58:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1044281428, now seen corresponding path program 3 times [2022-11-23 01:58:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620088019] [2022-11-23 01:58:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:58:10,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:58:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:58:10,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:58:10,363 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:58:10,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-23 01:58:10,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-23 01:58:10,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-23 01:58:10,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-23 01:58:10,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-23 01:58:10,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:58:10,368 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-23 01:58:10,374 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 01:58:10,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:58:10,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:58:10 BasicIcfg [2022-11-23 01:58:10,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:58:10,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:58:10,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:58:10,439 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:58:10,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:02" (3/4) ... [2022-11-23 01:58:10,441 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 01:58:10,506 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 01:58:10,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:58:10,507 INFO L158 Benchmark]: Toolchain (without parser) took 10105.63ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 116.2MB in the beginning and 63.7MB in the end (delta: 52.5MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2022-11-23 01:58:10,507 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 70.9MB in the end (delta: 209.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:58:10,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.24ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 93.5MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 01:58:10,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.13ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 01:58:10,508 INFO L158 Benchmark]: Boogie Preprocessor took 63.81ms. Allocated memory is still 148.9MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:58:10,508 INFO L158 Benchmark]: RCFGBuilder took 860.36ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 117.6MB in the end (delta: -28.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-11-23 01:58:10,509 INFO L158 Benchmark]: TraceAbstraction took 8355.26ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 116.9MB in the beginning and 71.0MB in the end (delta: 45.9MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2022-11-23 01:58:10,509 INFO L158 Benchmark]: Witness Printer took 67.68ms. Allocated memory is still 180.4MB. Free memory was 71.0MB in the beginning and 63.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 01:58:10,511 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 70.9MB in the end (delta: 209.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.24ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 93.5MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.13ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.81ms. Allocated memory is still 148.9MB. Free memory was 90.9MB in the beginning and 89.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 860.36ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 117.6MB in the end (delta: -28.3MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8355.26ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 116.9MB in the beginning and 71.0MB in the end (delta: 45.9MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 67.68ms. Allocated memory is still 180.4MB. Free memory was 71.0MB in the beginning and 63.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 100 PlacesBefore, 26 PlacesAfterwards, 95 TransitionsBefore, 20 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 3115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1573, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 940, independent: 900, independent conditional: 0, independent unconditional: 900, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 940, independent: 884, independent conditional: 0, independent unconditional: 884, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 469, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1573, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 940, unknown conditional: 0, unknown unconditional: 940] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t306; [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 116 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 454 IncrementalHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 8 mSDtfsCounter, 454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 01:58:10,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ad7077f-fb24-4384-b31c-00f943776ee1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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