./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:55:30,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:55:30,417 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:55:30,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:55:30,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:55:30,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:55:30,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:55:30,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:55:30,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:55:30,449 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:55:30,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:55:30,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:55:30,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:55:30,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:55:30,453 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:55:30,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:55:30,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:55:30,455 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:55:30,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:55:30,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:55:30,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:55:30,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:55:30,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:55:30,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:55:30,459 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:55:30,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:55:30,460 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:55:30,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:55:30,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:55:30,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:55:30,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:55:30,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:55:30,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:55:30,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:55:30,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:55:30,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:55:30,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:55:30,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:55:30,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:55:30,478 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:55:30,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:55:30,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:55:30,479 INFO L153 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_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/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_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2023-11-24 21:55:30,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:55:30,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:55:30,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:55:30,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:55:30,873 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:55:30,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 21:55:34,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:55:34,420 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:55:34,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 21:55:34,440 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/data/b1d793795/56b3d19e813b42b08c494b3890108e28/FLAGbd8d0488e [2023-11-24 21:55:34,458 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/data/b1d793795/56b3d19e813b42b08c494b3890108e28 [2023-11-24 21:55:34,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:55:34,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:55:34,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:55:34,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:55:34,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:55:34,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:55:34" (1/1) ... [2023-11-24 21:55:34,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3995e7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:34, skipping insertion in model container [2023-11-24 21:55:34,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:55:34" (1/1) ... [2023-11-24 21:55:34,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:55:34,814 WARN L240 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_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-24 21:55:35,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:55:35,158 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:55:35,173 WARN L240 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_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-24 21:55:35,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:55:35,315 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:55:35,316 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:55:35,324 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:55:35,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35 WrapperNode [2023-11-24 21:55:35,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:55:35,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:55:35,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:55:35,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:55:35,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,391 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-24 21:55:35,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:55:35,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:55:35,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:55:35,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:55:35,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,426 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:55:35,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:55:35,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:55:35,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:55:35,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:55:35,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (1/1) ... [2023-11-24 21:55:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:55:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:55:35,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:55:35,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:55:35,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:55:35,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:55:35,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:55:35,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:55:35,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:55:35,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:55:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:55:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:55:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:55:35,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:55:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:55:35,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:55:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:55:35,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:55:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:55:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:55:35,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:55:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:55:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:55:35,584 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:55:35,748 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:55:35,751 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:55:36,098 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:55:36,468 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:55:36,468 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:55:36,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:55:36 BoogieIcfgContainer [2023-11-24 21:55:36,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:55:36,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:55:36,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:55:36,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:55:36,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:55:34" (1/3) ... [2023-11-24 21:55:36,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26af1023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:55:36, skipping insertion in model container [2023-11-24 21:55:36,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:35" (2/3) ... [2023-11-24 21:55:36,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26af1023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:55:36, skipping insertion in model container [2023-11-24 21:55:36,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:55:36" (3/3) ... [2023-11-24 21:55:36,480 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 21:55:36,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 21:55:36,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:55:36,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 21:55:36,501 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:55:36,555 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:55:36,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-24 21:55:36,650 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-24 21:55:36,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:55:36,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-24 21:55:36,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-24 21:55:36,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-24 21:55:36,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:55:36,695 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=LoopHeads, 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;@1462a104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:55:36,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-24 21:55:36,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:55:36,706 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-24 21:55:36,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:55:36,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:36,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 21:55:36,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:36,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1967837457, now seen corresponding path program 1 times [2023-11-24 21:55:36,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:36,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60533165] [2023-11-24 21:55:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60533165] [2023-11-24 21:55:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60533165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:37,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:37,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:55:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802556668] [2023-11-24 21:55:37,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:37,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:55:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:55:37,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:55:37,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2023-11-24 21:55:37,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-24 21:55:37,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:37,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2023-11-24 21:55:37,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:37,778 INFO L124 PetriNetUnfolderBase]: 453/885 cut-off events. [2023-11-24 21:55:37,779 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-24 21:55:37,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 885 events. 453/885 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5476 event pairs, 72 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 1611. Up to 562 conditions per place. [2023-11-24 21:55:37,797 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 25 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-24 21:55:37,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 162 flow [2023-11-24 21:55:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:55:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:55:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-24 21:55:37,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2023-11-24 21:55:37,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-24 21:55:37,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-24 21:55:37,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:37,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-24 21:55:37,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2023-11-24 21:55:37,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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) [2023-11-24 21:55:37,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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) [2023-11-24 21:55:37,831 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 92 transitions. [2023-11-24 21:55:37,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 162 flow [2023-11-24 21:55:37,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:55:37,840 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2023-11-24 21:55:37,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-24 21:55:37,846 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-24 21:55:37,847 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2023-11-24 21:55:37,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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) [2023-11-24 21:55:37,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:37,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:37,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:55:37,848 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:37,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1481936323, now seen corresponding path program 1 times [2023-11-24 21:55:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203129039] [2023-11-24 21:55:37,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:38,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203129039] [2023-11-24 21:55:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203129039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21256457] [2023-11-24 21:55:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:38,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:38,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:38,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-24 21:55:38,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2023-11-24 21:55:38,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:38,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-24 21:55:38,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:39,725 INFO L124 PetriNetUnfolderBase]: 3799/6384 cut-off events. [2023-11-24 21:55:39,725 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-11-24 21:55:39,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12421 conditions, 6384 events. 3799/6384 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 45908 event pairs, 855 based on Foata normal form. 0/6182 useless extension candidates. Maximal degree in co-relation 12411. Up to 1876 conditions per place. [2023-11-24 21:55:39,767 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 36 selfloop transitions, 6 changer transitions 69/121 dead transitions. [2023-11-24 21:55:39,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 121 transitions, 492 flow [2023-11-24 21:55:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:55:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:55:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2023-11-24 21:55:39,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2023-11-24 21:55:39,778 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 230 transitions. [2023-11-24 21:55:39,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 230 transitions. [2023-11-24 21:55:39,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:39,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 230 transitions. [2023-11-24 21:55:39,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 25.555555555555557) internal successors, (230), 9 states have internal predecessors, (230), 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) [2023-11-24 21:55:39,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-24 21:55:39,793 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-24 21:55:39,793 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 9 states and 230 transitions. [2023-11-24 21:55:39,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 121 transitions, 492 flow [2023-11-24 21:55:39,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:55:39,797 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 146 flow [2023-11-24 21:55:39,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=146, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2023-11-24 21:55:39,799 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2023-11-24 21:55:39,799 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 146 flow [2023-11-24 21:55:39,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2023-11-24 21:55:39,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:39,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:39,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:55:39,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:39,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1574413826, now seen corresponding path program 1 times [2023-11-24 21:55:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778977593] [2023-11-24 21:55:39,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778977593] [2023-11-24 21:55:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778977593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:40,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:40,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:55:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122877446] [2023-11-24 21:55:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:40,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:55:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:40,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:55:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:55:40,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-24 21:55:40,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2023-11-24 21:55:40,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:40,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-24 21:55:40,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:41,232 INFO L124 PetriNetUnfolderBase]: 2613/4549 cut-off events. [2023-11-24 21:55:41,232 INFO L125 PetriNetUnfolderBase]: For 5856/5856 co-relation queries the response was YES. [2023-11-24 21:55:41,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12708 conditions, 4549 events. 2613/4549 cut-off events. For 5856/5856 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 31718 event pairs, 314 based on Foata normal form. 124/4639 useless extension candidates. Maximal degree in co-relation 12690. Up to 1526 conditions per place. [2023-11-24 21:55:41,273 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 40 selfloop transitions, 7 changer transitions 59/116 dead transitions. [2023-11-24 21:55:41,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 678 flow [2023-11-24 21:55:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:55:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:55:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2023-11-24 21:55:41,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2023-11-24 21:55:41,278 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 232 transitions. [2023-11-24 21:55:41,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 232 transitions. [2023-11-24 21:55:41,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:41,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 232 transitions. [2023-11-24 21:55:41,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 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) [2023-11-24 21:55:41,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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) [2023-11-24 21:55:41,284 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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) [2023-11-24 21:55:41,284 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 146 flow. Second operand 10 states and 232 transitions. [2023-11-24 21:55:41,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 678 flow [2023-11-24 21:55:41,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 116 transitions, 608 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-24 21:55:41,320 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 184 flow [2023-11-24 21:55:41,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=184, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2023-11-24 21:55:41,322 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2023-11-24 21:55:41,322 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 184 flow [2023-11-24 21:55:41,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2023-11-24 21:55:41,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:41,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:55:41,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:41,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1168897763, now seen corresponding path program 1 times [2023-11-24 21:55:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76721473] [2023-11-24 21:55:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:41,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76721473] [2023-11-24 21:55:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76721473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:41,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:41,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:55:41,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099536869] [2023-11-24 21:55:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:41,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:55:41,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:55:41,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:55:41,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-24 21:55:41,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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) [2023-11-24 21:55:41,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:41,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-24 21:55:41,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:43,005 INFO L124 PetriNetUnfolderBase]: 3385/5946 cut-off events. [2023-11-24 21:55:43,005 INFO L125 PetriNetUnfolderBase]: For 11137/11137 co-relation queries the response was YES. [2023-11-24 21:55:43,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17094 conditions, 5946 events. 3385/5946 cut-off events. For 11137/11137 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 44480 event pairs, 483 based on Foata normal form. 114/6007 useless extension candidates. Maximal degree in co-relation 17069. Up to 1923 conditions per place. [2023-11-24 21:55:43,138 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 47 selfloop transitions, 9 changer transitions 41/107 dead transitions. [2023-11-24 21:55:43,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 107 transitions, 698 flow [2023-11-24 21:55:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:55:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:55:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2023-11-24 21:55:43,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2023-11-24 21:55:43,141 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 176 transitions. [2023-11-24 21:55:43,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 176 transitions. [2023-11-24 21:55:43,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:43,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 176 transitions. [2023-11-24 21:55:43,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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) [2023-11-24 21:55:43,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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) [2023-11-24 21:55:43,144 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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) [2023-11-24 21:55:43,145 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 184 flow. Second operand 7 states and 176 transitions. [2023-11-24 21:55:43,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 107 transitions, 698 flow [2023-11-24 21:55:43,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 107 transitions, 664 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-24 21:55:43,203 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 218 flow [2023-11-24 21:55:43,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-11-24 21:55:43,205 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-24 21:55:43,205 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 218 flow [2023-11-24 21:55:43,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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) [2023-11-24 21:55:43,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:43,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:43,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:55:43,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:43,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 655982622, now seen corresponding path program 1 times [2023-11-24 21:55:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924749475] [2023-11-24 21:55:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924749475] [2023-11-24 21:55:43,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924749475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:43,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:55:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231534029] [2023-11-24 21:55:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:43,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:55:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:55:43,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:55:43,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-24 21:55:43,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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) [2023-11-24 21:55:43,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:43,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-24 21:55:43,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:45,199 INFO L124 PetriNetUnfolderBase]: 3059/5785 cut-off events. [2023-11-24 21:55:45,199 INFO L125 PetriNetUnfolderBase]: For 7568/7614 co-relation queries the response was YES. [2023-11-24 21:55:45,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15254 conditions, 5785 events. 3059/5785 cut-off events. For 7568/7614 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 47377 event pairs, 949 based on Foata normal form. 154/5857 useless extension candidates. Maximal degree in co-relation 15228. Up to 1362 conditions per place. [2023-11-24 21:55:45,256 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 39 selfloop transitions, 3 changer transitions 53/107 dead transitions. [2023-11-24 21:55:45,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 642 flow [2023-11-24 21:55:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:55:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:55:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2023-11-24 21:55:45,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6027777777777777 [2023-11-24 21:55:45,259 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 217 transitions. [2023-11-24 21:55:45,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 217 transitions. [2023-11-24 21:55:45,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:45,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 217 transitions. [2023-11-24 21:55:45,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 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) [2023-11-24 21:55:45,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-24 21:55:45,264 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-24 21:55:45,264 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 218 flow. Second operand 9 states and 217 transitions. [2023-11-24 21:55:45,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 642 flow [2023-11-24 21:55:45,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 107 transitions, 581 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-11-24 21:55:45,310 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 165 flow [2023-11-24 21:55:45,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2023-11-24 21:55:45,313 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-11-24 21:55:45,313 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 165 flow [2023-11-24 21:55:45,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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) [2023-11-24 21:55:45,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:45,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:45,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:55:45,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:45,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1905303615, now seen corresponding path program 1 times [2023-11-24 21:55:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180482909] [2023-11-24 21:55:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:45,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180482909] [2023-11-24 21:55:45,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180482909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:45,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651833025] [2023-11-24 21:55:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:45,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:45,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:55:45,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-24 21:55:45,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:45,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:55:45,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:46,241 INFO L124 PetriNetUnfolderBase]: 1456/2677 cut-off events. [2023-11-24 21:55:46,241 INFO L125 PetriNetUnfolderBase]: For 4069/4126 co-relation queries the response was YES. [2023-11-24 21:55:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 2677 events. 1456/2677 cut-off events. For 4069/4126 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18947 event pairs, 440 based on Foata normal form. 96/2673 useless extension candidates. Maximal degree in co-relation 7017. Up to 1582 conditions per place. [2023-11-24 21:55:46,265 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 24 selfloop transitions, 3 changer transitions 28/70 dead transitions. [2023-11-24 21:55:46,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 413 flow [2023-11-24 21:55:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:55:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:55:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2023-11-24 21:55:46,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2023-11-24 21:55:46,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 166 transitions. [2023-11-24 21:55:46,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 166 transitions. [2023-11-24 21:55:46,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:46,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 166 transitions. [2023-11-24 21:55:46,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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) [2023-11-24 21:55:46,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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) [2023-11-24 21:55:46,270 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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) [2023-11-24 21:55:46,271 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 165 flow. Second operand 7 states and 166 transitions. [2023-11-24 21:55:46,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 413 flow [2023-11-24 21:55:46,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 353 flow, removed 18 selfloop flow, removed 11 redundant places. [2023-11-24 21:55:46,288 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 150 flow [2023-11-24 21:55:46,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2023-11-24 21:55:46,292 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2023-11-24 21:55:46,292 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 150 flow [2023-11-24 21:55:46,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-24 21:55:46,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:46,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:46,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:55:46,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:46,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash -550664355, now seen corresponding path program 1 times [2023-11-24 21:55:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:46,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379768944] [2023-11-24 21:55:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379768944] [2023-11-24 21:55:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379768944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:46,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:55:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69989414] [2023-11-24 21:55:46,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:46,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:55:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:46,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:55:46,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:55:46,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:55:46,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2023-11-24 21:55:46,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:46,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:55:46,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:47,235 INFO L124 PetriNetUnfolderBase]: 2945/4873 cut-off events. [2023-11-24 21:55:47,236 INFO L125 PetriNetUnfolderBase]: For 2690/2810 co-relation queries the response was YES. [2023-11-24 21:55:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11269 conditions, 4873 events. 2945/4873 cut-off events. For 2690/2810 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32754 event pairs, 412 based on Foata normal form. 323/5082 useless extension candidates. Maximal degree in co-relation 11246. Up to 2416 conditions per place. [2023-11-24 21:55:47,269 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 37 selfloop transitions, 5 changer transitions 5/62 dead transitions. [2023-11-24 21:55:47,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 318 flow [2023-11-24 21:55:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:55:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:55:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-11-24 21:55:47,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2023-11-24 21:55:47,272 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 110 transitions. [2023-11-24 21:55:47,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 110 transitions. [2023-11-24 21:55:47,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:47,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 110 transitions. [2023-11-24 21:55:47,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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) [2023-11-24 21:55:47,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) [2023-11-24 21:55:47,274 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) [2023-11-24 21:55:47,274 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 150 flow. Second operand 4 states and 110 transitions. [2023-11-24 21:55:47,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 318 flow [2023-11-24 21:55:47,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 298 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-11-24 21:55:47,294 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 164 flow [2023-11-24 21:55:47,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-24 21:55:47,295 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-11-24 21:55:47,295 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 164 flow [2023-11-24 21:55:47,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2023-11-24 21:55:47,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:47,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:47,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:55:47,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:47,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1742528700, now seen corresponding path program 1 times [2023-11-24 21:55:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096295975] [2023-11-24 21:55:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096295975] [2023-11-24 21:55:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096295975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009279875] [2023-11-24 21:55:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:47,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:47,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:55:47,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-24 21:55:47,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:47,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:55:47,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:48,078 INFO L124 PetriNetUnfolderBase]: 2123/3578 cut-off events. [2023-11-24 21:55:48,078 INFO L125 PetriNetUnfolderBase]: For 2175/2226 co-relation queries the response was YES. [2023-11-24 21:55:48,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9323 conditions, 3578 events. 2123/3578 cut-off events. For 2175/2226 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 22150 event pairs, 171 based on Foata normal form. 266/3769 useless extension candidates. Maximal degree in co-relation 9304. Up to 1273 conditions per place. [2023-11-24 21:55:48,099 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 45 selfloop transitions, 8 changer transitions 6/74 dead transitions. [2023-11-24 21:55:48,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 401 flow [2023-11-24 21:55:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:55:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2023-11-24 21:55:48,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.685 [2023-11-24 21:55:48,103 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 137 transitions. [2023-11-24 21:55:48,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 137 transitions. [2023-11-24 21:55:48,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:48,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 137 transitions. [2023-11-24 21:55:48,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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) [2023-11-24 21:55:48,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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) [2023-11-24 21:55:48,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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) [2023-11-24 21:55:48,107 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 164 flow. Second operand 5 states and 137 transitions. [2023-11-24 21:55:48,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 401 flow [2023-11-24 21:55:48,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 391 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:55:48,116 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 204 flow [2023-11-24 21:55:48,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-11-24 21:55:48,119 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-11-24 21:55:48,119 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 204 flow [2023-11-24 21:55:48,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-24 21:55:48,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:48,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:48,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:55:48,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:48,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 317277789, now seen corresponding path program 1 times [2023-11-24 21:55:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011175544] [2023-11-24 21:55:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011175544] [2023-11-24 21:55:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011175544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:48,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:55:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338328138] [2023-11-24 21:55:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:48,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:55:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:55:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:55:48,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-24 21:55:48,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2023-11-24 21:55:48,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:48,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-24 21:55:48,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:48,841 INFO L124 PetriNetUnfolderBase]: 1324/2221 cut-off events. [2023-11-24 21:55:48,841 INFO L125 PetriNetUnfolderBase]: For 2717/2744 co-relation queries the response was YES. [2023-11-24 21:55:48,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6421 conditions, 2221 events. 1324/2221 cut-off events. For 2717/2744 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12058 event pairs, 124 based on Foata normal form. 150/2307 useless extension candidates. Maximal degree in co-relation 6400. Up to 828 conditions per place. [2023-11-24 21:55:48,854 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 39 selfloop transitions, 11 changer transitions 6/71 dead transitions. [2023-11-24 21:55:48,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 402 flow [2023-11-24 21:55:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:55:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:55:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2023-11-24 21:55:48,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2023-11-24 21:55:48,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 151 transitions. [2023-11-24 21:55:48,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 151 transitions. [2023-11-24 21:55:48,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:48,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 151 transitions. [2023-11-24 21:55:48,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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) [2023-11-24 21:55:48,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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) [2023-11-24 21:55:48,858 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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) [2023-11-24 21:55:48,859 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 204 flow. Second operand 6 states and 151 transitions. [2023-11-24 21:55:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 402 flow [2023-11-24 21:55:48,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 356 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-11-24 21:55:48,871 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 205 flow [2023-11-24 21:55:48,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-11-24 21:55:48,872 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-11-24 21:55:48,872 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 205 flow [2023-11-24 21:55:48,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2023-11-24 21:55:48,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:48,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:48,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:55:48,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:48,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 874686529, now seen corresponding path program 1 times [2023-11-24 21:55:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:48,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125363151] [2023-11-24 21:55:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125363151] [2023-11-24 21:55:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125363151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:49,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:49,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:55:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369338246] [2023-11-24 21:55:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:49,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:49,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:49,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:49,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-24 21:55:49,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-24 21:55:49,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:49,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-24 21:55:49,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:49,645 INFO L124 PetriNetUnfolderBase]: 772/1519 cut-off events. [2023-11-24 21:55:49,646 INFO L125 PetriNetUnfolderBase]: For 1244/1276 co-relation queries the response was YES. [2023-11-24 21:55:49,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1519 events. 772/1519 cut-off events. For 1244/1276 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9259 event pairs, 380 based on Foata normal form. 8/1422 useless extension candidates. Maximal degree in co-relation 3963. Up to 604 conditions per place. [2023-11-24 21:55:49,655 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 27 selfloop transitions, 2 changer transitions 14/62 dead transitions. [2023-11-24 21:55:49,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 345 flow [2023-11-24 21:55:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:55:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-24 21:55:49,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.585 [2023-11-24 21:55:49,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-24 21:55:49,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-24 21:55:49,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:49,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-24 21:55:49,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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) [2023-11-24 21:55:49,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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) [2023-11-24 21:55:49,660 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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) [2023-11-24 21:55:49,660 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 205 flow. Second operand 5 states and 117 transitions. [2023-11-24 21:55:49,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 345 flow [2023-11-24 21:55:49,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 281 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-24 21:55:49,670 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 149 flow [2023-11-24 21:55:49,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-11-24 21:55:49,671 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2023-11-24 21:55:49,671 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 149 flow [2023-11-24 21:55:49,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-24 21:55:49,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:49,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:49,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:55:49,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:49,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1613483607, now seen corresponding path program 2 times [2023-11-24 21:55:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132347708] [2023-11-24 21:55:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:55:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132347708] [2023-11-24 21:55:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132347708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:50,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:55:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593426623] [2023-11-24 21:55:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:50,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:55:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:55:50,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:55:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:55:50,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2023-11-24 21:55:50,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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) [2023-11-24 21:55:50,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:55:50,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2023-11-24 21:55:50,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:55:51,042 INFO L124 PetriNetUnfolderBase]: 717/1379 cut-off events. [2023-11-24 21:55:51,042 INFO L125 PetriNetUnfolderBase]: For 177/196 co-relation queries the response was YES. [2023-11-24 21:55:51,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1379 events. 717/1379 cut-off events. For 177/196 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8409 event pairs, 218 based on Foata normal form. 27/1269 useless extension candidates. Maximal degree in co-relation 2887. Up to 349 conditions per place. [2023-11-24 21:55:51,050 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 31 selfloop transitions, 5 changer transitions 23/80 dead transitions. [2023-11-24 21:55:51,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 367 flow [2023-11-24 21:55:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:55:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:55:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2023-11-24 21:55:51,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-24 21:55:51,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 210 transitions. [2023-11-24 21:55:51,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 210 transitions. [2023-11-24 21:55:51,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:55:51,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 210 transitions. [2023-11-24 21:55:51,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 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) [2023-11-24 21:55:51,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-24 21:55:51,056 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-24 21:55:51,056 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 149 flow. Second operand 9 states and 210 transitions. [2023-11-24 21:55:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 367 flow [2023-11-24 21:55:51,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 343 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-24 21:55:51,059 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 166 flow [2023-11-24 21:55:51,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=166, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-11-24 21:55:51,060 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-24 21:55:51,061 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 166 flow [2023-11-24 21:55:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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) [2023-11-24 21:55:51,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:55:51,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:51,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:55:51,062 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-24 21:55:51,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 507710079, now seen corresponding path program 3 times [2023-11-24 21:55:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:55:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601891843] [2023-11-24 21:55:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:55:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:55:51,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:55:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:55:51,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:55:51,205 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:55:51,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-24 21:55:51,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-24 21:55:51,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-24 21:55:51,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-24 21:55:51,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-24 21:55:51,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-24 21:55:51,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:55:51,210 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:51,217 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:55:51,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:55:51,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:55:51,281 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:55:51,282 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:55:51,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:55:51 BasicIcfg [2023-11-24 21:55:51,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:55:51,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:55:51,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:55:51,310 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:55:51,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:55:36" (3/4) ... [2023-11-24 21:55:51,311 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-24 21:55:51,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:55:51,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:55:51,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:55:51,439 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:55:51,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:55:51,440 INFO L158 Benchmark]: Toolchain (without parser) took 16970.19ms. Allocated memory was 146.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 110.1MB in the beginning and 655.3MB in the end (delta: -545.2MB). Peak memory consumption was 545.5MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,440 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:55:51,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.25ms. Allocated memory is still 146.8MB. Free memory was 109.8MB in the beginning and 86.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.77ms. Allocated memory is still 146.8MB. Free memory was 86.2MB in the beginning and 83.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,441 INFO L158 Benchmark]: Boogie Preprocessor took 60.83ms. Allocated memory is still 146.8MB. Free memory was 83.8MB in the beginning and 80.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,442 INFO L158 Benchmark]: RCFGBuilder took 1015.41ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 80.4MB in the beginning and 137.2MB in the end (delta: -56.8MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,442 INFO L158 Benchmark]: TraceAbstraction took 14837.70ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 136.1MB in the beginning and 667.9MB in the end (delta: -531.8MB). Peak memory consumption was 516.8MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,444 INFO L158 Benchmark]: Witness Printer took 129.71ms. Allocated memory is still 1.2GB. Free memory was 666.9MB in the beginning and 655.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-24 21:55:51,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.25ms. Allocated memory is still 146.8MB. Free memory was 109.8MB in the beginning and 86.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.77ms. Allocated memory is still 146.8MB. Free memory was 86.2MB in the beginning and 83.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.83ms. Allocated memory is still 146.8MB. Free memory was 83.8MB in the beginning and 80.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1015.41ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 80.4MB in the beginning and 137.2MB in the end (delta: -56.8MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14837.70ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 136.1MB in the beginning and 667.9MB in the end (delta: -531.8MB). Peak memory consumption was 516.8MB. Max. memory is 16.1GB. * Witness Printer took 129.71ms. Allocated memory is still 1.2GB. Free memory was 666.9MB in the beginning and 655.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 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: 14.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 531 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1413 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 46 mSDtfsCounter, 1413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=4, InterpolantAutomatonStates: 74, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2023-11-24 21:55:51,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b959fe-1a94-411c-9865-f0fdb1d3dc95/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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