./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:53:51,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:53:51,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:53:51,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:53:51,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:53:51,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:53:51,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:53:51,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:53:51,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:53:51,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:53:51,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:53:51,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:53:51,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:53:51,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:53:51,506 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:53:51,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:53:51,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:53:51,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:53:51,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:53:51,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:53:51,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:53:51,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:53:51,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:53:51,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:53:51,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:53:51,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:53:51,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:53:51,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:53:51,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:53:51,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:53:51,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:53:51,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:53:51,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:53:51,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:53:51,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:53:51,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:53:51,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:53:51,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:53:51,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:53:51,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:53:51,512 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:53:51,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:53:51,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:53:51,512 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:53:51,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:53:51,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:53:51,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:53:51,742 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:53:51,743 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:53:51,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 22:53:51,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:53:51,804 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:53:51,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:53:52,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:53:52,991 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:53:52,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:53:53,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a915e5546/dfbc483682714301a64bb0b8c336c92e/FLAG40b9502a9 [2024-06-27 22:53:53,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a915e5546/dfbc483682714301a64bb0b8c336c92e [2024-06-27 22:53:53,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:53:53,015 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:53:53,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:53:53,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:53:53,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:53:53,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:53:51" (1/2) ... [2024-06-27 22:53:53,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc1c68b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:53:53, skipping insertion in model container [2024-06-27 22:53:53,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:53:51" (1/2) ... [2024-06-27 22:53:53,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d6b1fc0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:53:53, skipping insertion in model container [2024-06-27 22:53:53,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:53:53" (2/2) ... [2024-06-27 22:53:53,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc1c68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53, skipping insertion in model container [2024-06-27 22:53:53,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:53:53" (2/2) ... [2024-06-27 22:53:53,024 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:53:53,043 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:53:53,044 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ! multithreaded || ((((((((((((((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:53:53,044 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ! multithreaded || ((((((((((((((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:53:53,044 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:53:53,045 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-27 22:53:53,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:53:53,242 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2024-06-27 22:53:53,423 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:53:53,433 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:53:53,461 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:53:53,512 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:53:53,560 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:53:53,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53 WrapperNode [2024-06-27 22:53:53,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:53:53,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:53:53,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:53:53,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:53:53,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,627 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-06-27 22:53:53,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:53:53,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:53:53,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:53:53,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:53:53,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:53:53,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:53:53,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:53:53,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:53:53,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:53:53,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (1/1) ... [2024-06-27 22:53:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:53:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:53:53,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:53:53,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:53:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:53:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:53:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:53:53,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:53:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:53:53,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:53:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:53:53,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:53:53,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:53:53,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:53:53,751 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:53:53,845 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:53:53,846 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:53:54,092 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:53:54,092 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:53:54,223 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:53:54,223 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:53:54,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:53:54 BoogieIcfgContainer [2024-06-27 22:53:54,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:53:54,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:53:54,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:53:54,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:53:54,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:53:51" (1/4) ... [2024-06-27 22:53:54,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda0b60 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:53:54, skipping insertion in model container [2024-06-27 22:53:54,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:53:53" (2/4) ... [2024-06-27 22:53:54,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda0b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:53:54, skipping insertion in model container [2024-06-27 22:53:54,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:53:53" (3/4) ... [2024-06-27 22:53:54,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda0b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:53:54, skipping insertion in model container [2024-06-27 22:53:54,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:53:54" (4/4) ... [2024-06-27 22:53:54,232 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-06-27 22:53:54,245 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:53:54,245 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:53:54,246 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:53:54,281 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:53:54,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:53:54,336 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 22:53:54,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:53:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-27 22:53:54,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:53:54,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-27 22:53:54,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:53:54,372 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=false, 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;@c4ddacc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:53:54,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:53:54,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:53:54,377 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:53:54,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:53:54,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:54,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:53:54,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:54,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 302383596, now seen corresponding path program 1 times [2024-06-27 22:53:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810701683] [2024-06-27 22:53:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810701683] [2024-06-27 22:53:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810701683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:54,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:53:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894234510] [2024-06-27 22:53:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:54,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:53:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:53:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:53:54,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:54,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-06-27 22:53:54,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:54,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:54,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:55,130 INFO L124 PetriNetUnfolderBase]: 223/482 cut-off events. [2024-06-27 22:53:55,131 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 22:53:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 482 events. 223/482 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2632 event pairs, 162 based on Foata normal form. 20/449 useless extension candidates. Maximal degree in co-relation 875. Up to 380 conditions per place. [2024-06-27 22:53:55,136 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 28 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-06-27 22:53:55,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 157 flow [2024-06-27 22:53:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:53:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:53:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-06-27 22:53:55,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2024-06-27 22:53:55,147 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 78 transitions. [2024-06-27 22:53:55,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 157 flow [2024-06-27 22:53:55,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:53:55,151 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 91 flow [2024-06-27 22:53:55,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-06-27 22:53:55,156 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 22:53:55,156 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 91 flow [2024-06-27 22:53:55,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-06-27 22:53:55,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:55,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:55,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:53:55,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:55,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1764384033, now seen corresponding path program 1 times [2024-06-27 22:53:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:55,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517187779] [2024-06-27 22:53:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:55,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517187779] [2024-06-27 22:53:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517187779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:53:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818577241] [2024-06-27 22:53:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:55,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:53:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:55,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:53:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:53:55,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:55,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-06-27 22:53:55,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:55,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:55,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:55,475 INFO L124 PetriNetUnfolderBase]: 179/391 cut-off events. [2024-06-27 22:53:55,475 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-06-27 22:53:55,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 391 events. 179/391 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1929 event pairs, 8 based on Foata normal form. 6/390 useless extension candidates. Maximal degree in co-relation 801. Up to 249 conditions per place. [2024-06-27 22:53:55,480 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 30 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2024-06-27 22:53:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 193 flow [2024-06-27 22:53:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:53:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:53:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-06-27 22:53:55,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-06-27 22:53:55,483 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 91 flow. Second operand 4 states and 96 transitions. [2024-06-27 22:53:55,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 193 flow [2024-06-27 22:53:55,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:55,486 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 90 flow [2024-06-27 22:53:55,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-27 22:53:55,487 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-06-27 22:53:55,487 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 90 flow [2024-06-27 22:53:55,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2024-06-27 22:53:55,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:55,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:55,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:53:55,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:55,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:55,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1670383745, now seen corresponding path program 1 times [2024-06-27 22:53:55,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344007288] [2024-06-27 22:53:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344007288] [2024-06-27 22:53:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344007288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:55,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:53:55,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904172206] [2024-06-27 22:53:55,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:55,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:53:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:53:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:53:55,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:55,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2024-06-27 22:53:55,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:55,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:55,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:55,874 INFO L124 PetriNetUnfolderBase]: 153/356 cut-off events. [2024-06-27 22:53:55,874 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-06-27 22:53:55,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 356 events. 153/356 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1795 event pairs, 85 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 758. Up to 262 conditions per place. [2024-06-27 22:53:55,877 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 25 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-27 22:53:55,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 193 flow [2024-06-27 22:53:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:53:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:53:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-27 22:53:55,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2024-06-27 22:53:55,881 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 90 flow. Second operand 4 states and 87 transitions. [2024-06-27 22:53:55,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 193 flow [2024-06-27 22:53:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 182 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 22:53:55,884 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 136 flow [2024-06-27 22:53:55,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-06-27 22:53:55,885 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-06-27 22:53:55,885 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 136 flow [2024-06-27 22:53:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2024-06-27 22:53:55,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:55,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:55,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:53:55,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:55,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1079009982, now seen corresponding path program 1 times [2024-06-27 22:53:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439887463] [2024-06-27 22:53:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439887463] [2024-06-27 22:53:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439887463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:56,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:53:56,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216141248] [2024-06-27 22:53:56,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:56,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:53:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:53:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:53:56,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-06-27 22:53:56,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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) [2024-06-27 22:53:56,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:56,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-06-27 22:53:56,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:56,564 INFO L124 PetriNetUnfolderBase]: 202/493 cut-off events. [2024-06-27 22:53:56,564 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-27 22:53:56,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 493 events. 202/493 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2807 event pairs, 118 based on Foata normal form. 8/475 useless extension candidates. Maximal degree in co-relation 1074. Up to 253 conditions per place. [2024-06-27 22:53:56,567 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 35 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2024-06-27 22:53:56,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 286 flow [2024-06-27 22:53:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:53:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:53:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-27 22:53:56,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2024-06-27 22:53:56,569 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 136 flow. Second operand 6 states and 121 transitions. [2024-06-27 22:53:56,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 286 flow [2024-06-27 22:53:56,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 284 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 22:53:56,573 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 191 flow [2024-06-27 22:53:56,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-27 22:53:56,574 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2024-06-27 22:53:56,575 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 191 flow [2024-06-27 22:53:56,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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) [2024-06-27 22:53:56,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:56,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:56,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:53:56,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:56,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1088880260, now seen corresponding path program 1 times [2024-06-27 22:53:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651007386] [2024-06-27 22:53:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651007386] [2024-06-27 22:53:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651007386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:56,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:56,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:53:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303234713] [2024-06-27 22:53:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:56,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:53:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:56,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:53:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:53:56,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:56,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-06-27 22:53:56,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:56,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:56,860 INFO L124 PetriNetUnfolderBase]: 210/504 cut-off events. [2024-06-27 22:53:56,860 INFO L125 PetriNetUnfolderBase]: For 485/485 co-relation queries the response was YES. [2024-06-27 22:53:56,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 504 events. 210/504 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2881 event pairs, 57 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 1270. Up to 311 conditions per place. [2024-06-27 22:53:56,863 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 39 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2024-06-27 22:53:56,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 371 flow [2024-06-27 22:53:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:53:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:53:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-27 22:53:56,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2024-06-27 22:53:56,864 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 191 flow. Second operand 5 states and 113 transitions. [2024-06-27 22:53:56,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 371 flow [2024-06-27 22:53:56,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 354 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 22:53:56,867 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 263 flow [2024-06-27 22:53:56,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-06-27 22:53:56,868 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2024-06-27 22:53:56,868 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 263 flow [2024-06-27 22:53:56,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-06-27 22:53:56,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:56,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:56,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:53:56,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:56,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash -910705280, now seen corresponding path program 2 times [2024-06-27 22:53:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505082298] [2024-06-27 22:53:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505082298] [2024-06-27 22:53:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505082298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:53:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379683457] [2024-06-27 22:53:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:57,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:53:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:53:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:53:57,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:57,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-06-27 22:53:57,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:57,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:57,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:57,154 INFO L124 PetriNetUnfolderBase]: 241/576 cut-off events. [2024-06-27 22:53:57,154 INFO L125 PetriNetUnfolderBase]: For 1002/1005 co-relation queries the response was YES. [2024-06-27 22:53:57,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 576 events. 241/576 cut-off events. For 1002/1005 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3340 event pairs, 66 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 1722. Up to 309 conditions per place. [2024-06-27 22:53:57,158 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 37 selfloop transitions, 23 changer transitions 0/72 dead transitions. [2024-06-27 22:53:57,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 503 flow [2024-06-27 22:53:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:53:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:53:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-27 22:53:57,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2024-06-27 22:53:57,159 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 263 flow. Second operand 5 states and 113 transitions. [2024-06-27 22:53:57,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 503 flow [2024-06-27 22:53:57,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 479 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:57,162 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 387 flow [2024-06-27 22:53:57,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-06-27 22:53:57,163 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2024-06-27 22:53:57,163 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 387 flow [2024-06-27 22:53:57,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-06-27 22:53:57,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:57,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:57,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:53:57,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:57,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash -531497101, now seen corresponding path program 1 times [2024-06-27 22:53:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470272697] [2024-06-27 22:53:57,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470272697] [2024-06-27 22:53:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470272697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:53:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035149133] [2024-06-27 22:53:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:57,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:53:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:53:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:53:57,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-27 22:53:57,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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) [2024-06-27 22:53:57,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:57,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-27 22:53:57,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:57,683 INFO L124 PetriNetUnfolderBase]: 335/764 cut-off events. [2024-06-27 22:53:57,683 INFO L125 PetriNetUnfolderBase]: For 2242/2242 co-relation queries the response was YES. [2024-06-27 22:53:57,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 764 events. 335/764 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4685 event pairs, 64 based on Foata normal form. 2/738 useless extension candidates. Maximal degree in co-relation 2647. Up to 435 conditions per place. [2024-06-27 22:53:57,688 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 63 selfloop transitions, 25 changer transitions 0/98 dead transitions. [2024-06-27 22:53:57,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 764 flow [2024-06-27 22:53:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:53:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:53:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 22:53:57,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2024-06-27 22:53:57,690 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 387 flow. Second operand 7 states and 150 transitions. [2024-06-27 22:53:57,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 764 flow [2024-06-27 22:53:57,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 729 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:57,697 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 512 flow [2024-06-27 22:53:57,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2024-06-27 22:53:57,699 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2024-06-27 22:53:57,699 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 512 flow [2024-06-27 22:53:57,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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) [2024-06-27 22:53:57,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:57,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:57,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:53:57,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:57,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1831510211, now seen corresponding path program 2 times [2024-06-27 22:53:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167290576] [2024-06-27 22:53:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167290576] [2024-06-27 22:53:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167290576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:53:57,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851000566] [2024-06-27 22:53:57,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:57,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:53:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:57,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:53:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:53:57,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:57,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:57,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:57,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:57,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:58,125 INFO L124 PetriNetUnfolderBase]: 315/740 cut-off events. [2024-06-27 22:53:58,126 INFO L125 PetriNetUnfolderBase]: For 2608/2608 co-relation queries the response was YES. [2024-06-27 22:53:58,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 740 events. 315/740 cut-off events. For 2608/2608 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4543 event pairs, 68 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 2751. Up to 396 conditions per place. [2024-06-27 22:53:58,132 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 53 selfloop transitions, 25 changer transitions 0/91 dead transitions. [2024-06-27 22:53:58,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 801 flow [2024-06-27 22:53:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:53:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:53:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-27 22:53:58,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2024-06-27 22:53:58,133 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 512 flow. Second operand 5 states and 115 transitions. [2024-06-27 22:53:58,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 801 flow [2024-06-27 22:53:58,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 91 transitions, 746 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 22:53:58,142 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 620 flow [2024-06-27 22:53:58,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=620, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2024-06-27 22:53:58,144 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-06-27 22:53:58,145 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 620 flow [2024-06-27 22:53:58,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:58,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:58,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:58,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:53:58,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:58,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1697828479, now seen corresponding path program 3 times [2024-06-27 22:53:58,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:58,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243402168] [2024-06-27 22:53:58,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:58,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243402168] [2024-06-27 22:53:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243402168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:58,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:58,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:53:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554199263] [2024-06-27 22:53:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:58,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:53:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:53:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:53:58,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:58,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:58,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:58,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:58,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:58,626 INFO L124 PetriNetUnfolderBase]: 337/800 cut-off events. [2024-06-27 22:53:58,626 INFO L125 PetriNetUnfolderBase]: For 3356/3356 co-relation queries the response was YES. [2024-06-27 22:53:58,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3120 conditions, 800 events. 337/800 cut-off events. For 3356/3356 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5079 event pairs, 72 based on Foata normal form. 2/763 useless extension candidates. Maximal degree in co-relation 3089. Up to 448 conditions per place. [2024-06-27 22:53:58,632 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 59 selfloop transitions, 24 changer transitions 0/96 dead transitions. [2024-06-27 22:53:58,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 921 flow [2024-06-27 22:53:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:53:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:53:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-27 22:53:58,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2024-06-27 22:53:58,634 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 620 flow. Second operand 5 states and 114 transitions. [2024-06-27 22:53:58,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 921 flow [2024-06-27 22:53:58,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 884 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:58,642 INFO L231 Difference]: Finished difference. Result has 73 places, 80 transitions, 735 flow [2024-06-27 22:53:58,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=735, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2024-06-27 22:53:58,643 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-06-27 22:53:58,643 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 735 flow [2024-06-27 22:53:58,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:58,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:58,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:58,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:53:58,644 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:58,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1832907837, now seen corresponding path program 4 times [2024-06-27 22:53:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089249865] [2024-06-27 22:53:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089249865] [2024-06-27 22:53:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089249865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:58,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:53:58,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845434411] [2024-06-27 22:53:58,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:58,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:53:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:53:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:53:58,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:58,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:58,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:58,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:58,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:59,086 INFO L124 PetriNetUnfolderBase]: 346/823 cut-off events. [2024-06-27 22:53:59,086 INFO L125 PetriNetUnfolderBase]: For 4489/4489 co-relation queries the response was YES. [2024-06-27 22:53:59,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 823 events. 346/823 cut-off events. For 4489/4489 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5291 event pairs, 79 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 3359. Up to 352 conditions per place. [2024-06-27 22:53:59,091 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 47 selfloop transitions, 39 changer transitions 0/99 dead transitions. [2024-06-27 22:53:59,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 1027 flow [2024-06-27 22:53:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:53:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:53:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-27 22:53:59,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2024-06-27 22:53:59,093 INFO L175 Difference]: Start difference. First operand has 73 places, 80 transitions, 735 flow. Second operand 5 states and 113 transitions. [2024-06-27 22:53:59,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 1027 flow [2024-06-27 22:53:59,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 989 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:59,102 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 893 flow [2024-06-27 22:53:59,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=893, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-06-27 22:53:59,103 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2024-06-27 22:53:59,103 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 893 flow [2024-06-27 22:53:59,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:59,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:59,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:59,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:53:59,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:59,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -186028013, now seen corresponding path program 1 times [2024-06-27 22:53:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:59,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322072843] [2024-06-27 22:53:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322072843] [2024-06-27 22:53:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322072843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:53:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996941349] [2024-06-27 22:53:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:59,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:53:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:59,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:53:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:53:59,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:59,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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) [2024-06-27 22:53:59,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:59,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:59,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:59,538 INFO L124 PetriNetUnfolderBase]: 389/944 cut-off events. [2024-06-27 22:53:59,538 INFO L125 PetriNetUnfolderBase]: For 6685/6685 co-relation queries the response was YES. [2024-06-27 22:53:59,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 944 events. 389/944 cut-off events. For 6685/6685 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6327 event pairs, 96 based on Foata normal form. 6/905 useless extension candidates. Maximal degree in co-relation 4056. Up to 253 conditions per place. [2024-06-27 22:53:59,544 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 55 selfloop transitions, 36 changer transitions 0/104 dead transitions. [2024-06-27 22:53:59,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 1193 flow [2024-06-27 22:53:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:53:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:53:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-27 22:53:59,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2024-06-27 22:53:59,546 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 893 flow. Second operand 5 states and 114 transitions. [2024-06-27 22:53:59,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 1193 flow [2024-06-27 22:53:59,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 1147 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:59,555 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 944 flow [2024-06-27 22:53:59,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=944, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2024-06-27 22:53:59,556 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2024-06-27 22:53:59,556 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 944 flow [2024-06-27 22:53:59,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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) [2024-06-27 22:53:59,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:59,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:59,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:53:59,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:59,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1251481057, now seen corresponding path program 2 times [2024-06-27 22:53:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160679312] [2024-06-27 22:53:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160679312] [2024-06-27 22:53:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160679312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:59,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:53:59,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388335538] [2024-06-27 22:53:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:59,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:53:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:53:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:53:59,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:53:59,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:53:59,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:59,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:53:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:00,092 INFO L124 PetriNetUnfolderBase]: 413/1008 cut-off events. [2024-06-27 22:54:00,093 INFO L125 PetriNetUnfolderBase]: For 7597/7597 co-relation queries the response was YES. [2024-06-27 22:54:00,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4421 conditions, 1008 events. 413/1008 cut-off events. For 7597/7597 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7013 event pairs, 96 based on Foata normal form. 6/969 useless extension candidates. Maximal degree in co-relation 4382. Up to 235 conditions per place. [2024-06-27 22:54:00,100 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 63 selfloop transitions, 36 changer transitions 0/112 dead transitions. [2024-06-27 22:54:00,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 1310 flow [2024-06-27 22:54:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 22:54:00,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-06-27 22:54:00,101 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 944 flow. Second operand 6 states and 136 transitions. [2024-06-27 22:54:00,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 1310 flow [2024-06-27 22:54:00,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 1241 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:00,114 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 951 flow [2024-06-27 22:54:00,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2024-06-27 22:54:00,115 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2024-06-27 22:54:00,115 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 951 flow [2024-06-27 22:54:00,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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) [2024-06-27 22:54:00,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:00,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:00,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:54:00,116 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:00,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1982873384, now seen corresponding path program 1 times [2024-06-27 22:54:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471147039] [2024-06-27 22:54:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471147039] [2024-06-27 22:54:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471147039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205498580] [2024-06-27 22:54:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:00,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:00,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-27 22:54:00,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 951 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2024-06-27 22:54:00,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:00,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-27 22:54:00,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:00,428 INFO L124 PetriNetUnfolderBase]: 1136/2324 cut-off events. [2024-06-27 22:54:00,428 INFO L125 PetriNetUnfolderBase]: For 12719/12763 co-relation queries the response was YES. [2024-06-27 22:54:00,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9003 conditions, 2324 events. 1136/2324 cut-off events. For 12719/12763 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15897 event pairs, 269 based on Foata normal form. 110/2314 useless extension candidates. Maximal degree in co-relation 8963. Up to 1425 conditions per place. [2024-06-27 22:54:00,443 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 96 selfloop transitions, 4 changer transitions 1/117 dead transitions. [2024-06-27 22:54:00,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1470 flow [2024-06-27 22:54:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-27 22:54:00,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2024-06-27 22:54:00,444 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 951 flow. Second operand 4 states and 87 transitions. [2024-06-27 22:54:00,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1470 flow [2024-06-27 22:54:00,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 1374 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:00,465 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 907 flow [2024-06-27 22:54:00,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=907, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2024-06-27 22:54:00,465 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2024-06-27 22:54:00,465 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 907 flow [2024-06-27 22:54:00,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2024-06-27 22:54:00,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:00,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:00,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:54:00,466 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:00,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1056781876, now seen corresponding path program 1 times [2024-06-27 22:54:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113390052] [2024-06-27 22:54:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113390052] [2024-06-27 22:54:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113390052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807916435] [2024-06-27 22:54:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:00,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:54:00,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 907 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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) [2024-06-27 22:54:00,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:00,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:54:00,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:01,071 INFO L124 PetriNetUnfolderBase]: 462/1159 cut-off events. [2024-06-27 22:54:01,072 INFO L125 PetriNetUnfolderBase]: For 6964/6964 co-relation queries the response was YES. [2024-06-27 22:54:01,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 1159 events. 462/1159 cut-off events. For 6964/6964 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8421 event pairs, 110 based on Foata normal form. 4/1092 useless extension candidates. Maximal degree in co-relation 4933. Up to 331 conditions per place. [2024-06-27 22:54:01,080 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 51 selfloop transitions, 39 changer transitions 0/105 dead transitions. [2024-06-27 22:54:01,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 105 transitions, 1183 flow [2024-06-27 22:54:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-27 22:54:01,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2024-06-27 22:54:01,082 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 907 flow. Second operand 5 states and 113 transitions. [2024-06-27 22:54:01,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 105 transitions, 1183 flow [2024-06-27 22:54:01,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 1159 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:01,093 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 943 flow [2024-06-27 22:54:01,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=943, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2024-06-27 22:54:01,093 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2024-06-27 22:54:01,094 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 943 flow [2024-06-27 22:54:01,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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) [2024-06-27 22:54:01,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:01,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:01,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:54:01,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:01,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -353118183, now seen corresponding path program 1 times [2024-06-27 22:54:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:01,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906150124] [2024-06-27 22:54:01,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:01,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906150124] [2024-06-27 22:54:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906150124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558415918] [2024-06-27 22:54:01,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:01,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:01,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:01,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:01,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:54:01,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 943 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2024-06-27 22:54:01,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:01,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:54:01,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:01,307 INFO L124 PetriNetUnfolderBase]: 598/1325 cut-off events. [2024-06-27 22:54:01,308 INFO L125 PetriNetUnfolderBase]: For 7102/7119 co-relation queries the response was YES. [2024-06-27 22:54:01,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4943 conditions, 1325 events. 598/1325 cut-off events. For 7102/7119 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8441 event pairs, 96 based on Foata normal form. 88/1339 useless extension candidates. Maximal degree in co-relation 4903. Up to 637 conditions per place. [2024-06-27 22:54:01,315 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 66 selfloop transitions, 4 changer transitions 0/85 dead transitions. [2024-06-27 22:54:01,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 991 flow [2024-06-27 22:54:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 22:54:01,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-27 22:54:01,316 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 943 flow. Second operand 4 states and 93 transitions. [2024-06-27 22:54:01,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 991 flow [2024-06-27 22:54:01,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 795 flow, removed 12 selfloop flow, removed 17 redundant places. [2024-06-27 22:54:01,325 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 497 flow [2024-06-27 22:54:01,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=497, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2024-06-27 22:54:01,325 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-06-27 22:54:01,325 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 497 flow [2024-06-27 22:54:01,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2024-06-27 22:54:01,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:01,326 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] [2024-06-27 22:54:01,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:54:01,326 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:01,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash -727409828, now seen corresponding path program 1 times [2024-06-27 22:54:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195585417] [2024-06-27 22:54:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195585417] [2024-06-27 22:54:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195585417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219518265] [2024-06-27 22:54:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:01,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:01,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:01,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:54:01,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 497 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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) [2024-06-27 22:54:01,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:01,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:54:01,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:01,525 INFO L124 PetriNetUnfolderBase]: 324/717 cut-off events. [2024-06-27 22:54:01,525 INFO L125 PetriNetUnfolderBase]: For 2758/2775 co-relation queries the response was YES. [2024-06-27 22:54:01,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 717 events. 324/717 cut-off events. For 2758/2775 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3848 event pairs, 55 based on Foata normal form. 59/748 useless extension candidates. Maximal degree in co-relation 2670. Up to 286 conditions per place. [2024-06-27 22:54:01,529 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 47 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2024-06-27 22:54:01,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 580 flow [2024-06-27 22:54:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-27 22:54:01,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-27 22:54:01,530 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 497 flow. Second operand 5 states and 106 transitions. [2024-06-27 22:54:01,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 580 flow [2024-06-27 22:54:01,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 470 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-27 22:54:01,534 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 309 flow [2024-06-27 22:54:01,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2024-06-27 22:54:01,534 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2024-06-27 22:54:01,534 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 309 flow [2024-06-27 22:54:01,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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) [2024-06-27 22:54:01,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:01,535 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] [2024-06-27 22:54:01,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:54:01,535 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:01,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1059427678, now seen corresponding path program 1 times [2024-06-27 22:54:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424921590] [2024-06-27 22:54:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424921590] [2024-06-27 22:54:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424921590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158434992] [2024-06-27 22:54:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:01,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:01,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:01,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:54:01,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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) [2024-06-27 22:54:01,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:01,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:54:01,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:01,778 INFO L124 PetriNetUnfolderBase]: 347/880 cut-off events. [2024-06-27 22:54:01,778 INFO L125 PetriNetUnfolderBase]: For 1607/1660 co-relation queries the response was YES. [2024-06-27 22:54:01,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 880 events. 347/880 cut-off events. For 1607/1660 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5751 event pairs, 172 based on Foata normal form. 26/834 useless extension candidates. Maximal degree in co-relation 2614. Up to 339 conditions per place. [2024-06-27 22:54:01,781 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 22 selfloop transitions, 2 changer transitions 30/69 dead transitions. [2024-06-27 22:54:01,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 494 flow [2024-06-27 22:54:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-27 22:54:01,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2024-06-27 22:54:01,783 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 309 flow. Second operand 5 states and 103 transitions. [2024-06-27 22:54:01,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 494 flow [2024-06-27 22:54:01,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 476 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:01,786 INFO L231 Difference]: Finished difference. Result has 73 places, 36 transitions, 186 flow [2024-06-27 22:54:01,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=73, PETRI_TRANSITIONS=36} [2024-06-27 22:54:01,786 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-06-27 22:54:01,786 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 36 transitions, 186 flow [2024-06-27 22:54:01,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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) [2024-06-27 22:54:01,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:01,787 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] [2024-06-27 22:54:01,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:54:01,787 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:01,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash 611652864, now seen corresponding path program 2 times [2024-06-27 22:54:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68531990] [2024-06-27 22:54:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68531990] [2024-06-27 22:54:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68531990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:02,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:02,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287132388] [2024-06-27 22:54:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:02,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:02,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2024-06-27 22:54:02,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 36 transitions, 186 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 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) [2024-06-27 22:54:02,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:02,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2024-06-27 22:54:02,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:02,377 INFO L124 PetriNetUnfolderBase]: 117/329 cut-off events. [2024-06-27 22:54:02,377 INFO L125 PetriNetUnfolderBase]: For 354/372 co-relation queries the response was YES. [2024-06-27 22:54:02,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 329 events. 117/329 cut-off events. For 354/372 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1631 event pairs, 55 based on Foata normal form. 7/314 useless extension candidates. Maximal degree in co-relation 905. Up to 153 conditions per place. [2024-06-27 22:54:02,379 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 17 selfloop transitions, 5 changer transitions 13/49 dead transitions. [2024-06-27 22:54:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 49 transitions, 302 flow [2024-06-27 22:54:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-27 22:54:02,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2024-06-27 22:54:02,380 INFO L175 Difference]: Start difference. First operand has 73 places, 36 transitions, 186 flow. Second operand 7 states and 137 transitions. [2024-06-27 22:54:02,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 49 transitions, 302 flow [2024-06-27 22:54:02,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 259 flow, removed 14 selfloop flow, removed 12 redundant places. [2024-06-27 22:54:02,382 INFO L231 Difference]: Finished difference. Result has 61 places, 33 transitions, 157 flow [2024-06-27 22:54:02,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=61, PETRI_TRANSITIONS=33} [2024-06-27 22:54:02,384 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2024-06-27 22:54:02,384 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 33 transitions, 157 flow [2024-06-27 22:54:02,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 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) [2024-06-27 22:54:02,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:02,384 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] [2024-06-27 22:54:02,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:54:02,385 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:02,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1961372306, now seen corresponding path program 3 times [2024-06-27 22:54:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:02,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119285931] [2024-06-27 22:54:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:54:02,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:54:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:54:02,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:54:02,463 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:54:02,464 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:54:02,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:54:02,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:54:02,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:54:02,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:54:02,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:54:02,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:54:02,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:54:02,467 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:02,471 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:54:02,472 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:54:02,505 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:54:02,505 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:54:02,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:54:02 BasicIcfg [2024-06-27 22:54:02,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:54:02,506 INFO L158 Benchmark]: Toolchain (without parser) took 9491.86ms. Allocated memory was 132.1MB in the beginning and 480.2MB in the end (delta: 348.1MB). Free memory was 91.6MB in the beginning and 186.7MB in the end (delta: -95.1MB). Peak memory consumption was 254.9MB. Max. memory is 16.1GB. [2024-06-27 22:54:02,506 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:54:02,507 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 132.1MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:54:02,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.43ms. Allocated memory is still 132.1MB. Free memory was 91.3MB in the beginning and 63.0MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-06-27 22:54:02,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.45ms. Allocated memory is still 132.1MB. Free memory was 63.0MB in the beginning and 59.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:54:02,507 INFO L158 Benchmark]: Boogie Preprocessor took 70.92ms. Allocated memory is still 132.1MB. Free memory was 59.9MB in the beginning and 56.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:54:02,507 INFO L158 Benchmark]: RCFGBuilder took 524.13ms. Allocated memory is still 132.1MB. Free memory was 56.4MB in the beginning and 68.0MB in the end (delta: -11.6MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-06-27 22:54:02,508 INFO L158 Benchmark]: TraceAbstraction took 8279.70ms. Allocated memory was 132.1MB in the beginning and 480.2MB in the end (delta: 348.1MB). Free memory was 68.0MB in the beginning and 186.7MB in the end (delta: -118.6MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. [2024-06-27 22:54:02,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 132.1MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.43ms. Allocated memory is still 132.1MB. Free memory was 91.3MB in the beginning and 63.0MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.45ms. Allocated memory is still 132.1MB. Free memory was 63.0MB in the beginning and 59.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.92ms. Allocated memory is still 132.1MB. Free memory was 59.9MB in the beginning and 56.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 524.13ms. Allocated memory is still 132.1MB. Free memory was 56.4MB in the beginning and 68.0MB in the end (delta: -11.6MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8279.70ms. Allocated memory was 132.1MB in the beginning and 480.2MB in the end (delta: 348.1MB). Free memory was 68.0MB in the beginning and 186.7MB in the end (delta: -118.6MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L793] 0 //@ assert (!multithreaded || ((((((((((((((((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L794] 0 //@ assert (!multithreaded || ((((((((((((((((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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 [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: 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: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 52 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 419 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1887 IncrementalHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 38 mSDtfsCounter, 1887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=12, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 2841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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! [2024-06-27 22:54:02,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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