./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe036.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe036.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/safe036.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe036.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-dev-958ec4d-m [2024-02-07 14:25:24,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:25:24,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:25:24,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:25:24,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:25:24,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:25:24,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:25:24,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:25:24,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:25:24,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:25:24,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:25:24,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:25:24,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:25:24,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:25:24,786 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:25:24,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:25:24,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:25:24,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:25:24,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:25:24,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:25:24,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:25:24,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:25:24,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:25:24,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:25:24,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:25:24,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:25:24,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:25:24,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:25:24,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:25:24,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:25:24,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:25:24,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:25:24,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:24,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:25:24,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:25:24,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:25:24,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:25:24,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:25:24,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:25:24,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:25:24,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:25:24,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:25:24,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:25:24,793 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-02-07 14:25:25,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:25:25,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:25:25,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:25:25,051 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:25:25,054 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:25:25,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe036.yml/witness.yml [2024-02-07 14:25:25,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:25:25,175 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:25:25,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe036.i [2024-02-07 14:25:26,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:25:26,407 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:25:26,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i [2024-02-07 14:25:26,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d74f9498/dcf43bc6b25443a099a97adeea9da148/FLAGde2160f62 [2024-02-07 14:25:26,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d74f9498/dcf43bc6b25443a099a97adeea9da148 [2024-02-07 14:25:26,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:25:26,435 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:25:26,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:26,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:25:26,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:25:26,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:25" (1/2) ... [2024-02-07 14:25:26,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23060054 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:26, skipping insertion in model container [2024-02-07 14:25:26,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:25" (1/2) ... [2024-02-07 14:25:26,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4a237346 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:26, skipping insertion in model container [2024-02-07 14:25:26,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:26" (2/2) ... [2024-02-07 14:25:26,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23060054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:26, skipping insertion in model container [2024-02-07 14:25:26,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:26" (2/2) ... [2024-02-07 14:25:26,447 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:25:26,573 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:25:26,575 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] 1 <= __unbuffered_cnt [2024-02-07 14:25:26,575 INFO L76 edCorrectnessWitness]: Location invariant before [L769-L769] 0 <= __unbuffered_cnt [2024-02-07 14:25:26,575 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:26,575 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] 0 <= __unbuffered_cnt [2024-02-07 14:25:26,576 INFO L76 edCorrectnessWitness]: Location invariant before [L740-L740] x == 1 [2024-02-07 14:25:26,576 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] 0 <= __unbuffered_cnt [2024-02-07 14:25:26,576 INFO L76 edCorrectnessWitness]: Location invariant before [L777-L777] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L770-L770] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L744-L744] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L723-L723] y == 1 [2024-02-07 14:25:26,577 INFO L76 edCorrectnessWitness]: Location invariant before [L750-L750] 1 <= __unbuffered_cnt [2024-02-07 14:25:26,578 INFO L76 edCorrectnessWitness]: Location invariant before [L775-L775] (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p0_EAX == 0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 14:25:26,578 INFO L76 edCorrectnessWitness]: Location invariant before [L776-L776] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:26,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:25:26,757 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i[941,954] [2024-02-07 14:25:26,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:26,925 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:25:26,953 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i[941,954] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:25:27,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:27,041 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:25:27,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27 WrapperNode [2024-02-07 14:25:27,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:27,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:27,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:25:27,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:25:27,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,098 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-02-07 14:25:27,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:27,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:25:27,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:25:27,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:25:27,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,132 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-07 14:25:27,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:25:27,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:25:27,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:25:27,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:25:27,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (1/1) ... [2024-02-07 14:25:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:27,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:25:27,197 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-02-07 14:25:27,221 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-02-07 14:25:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:25:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:25:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:25:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:25:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:25:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:25:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:25:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:25:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:25:27,237 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:25:27,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:25:27,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:25:27,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:25:27,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:25:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:25:27,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:25:27,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:25:27,239 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:25:27,360 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:25:27,362 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:25:27,548 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:25:27,548 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:25:27,658 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:25:27,659 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:25:27,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:27 BoogieIcfgContainer [2024-02-07 14:25:27,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:25:27,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:25:27,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:25:27,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:25:27,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:25" (1/4) ... [2024-02-07 14:25:27,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65858ece and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:25:27, skipping insertion in model container [2024-02-07 14:25:27,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:25:26" (2/4) ... [2024-02-07 14:25:27,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65858ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:27, skipping insertion in model container [2024-02-07 14:25:27,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:27" (3/4) ... [2024-02-07 14:25:27,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65858ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:27, skipping insertion in model container [2024-02-07 14:25:27,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:27" (4/4) ... [2024-02-07 14:25:27,669 INFO L112 eAbstractionObserver]: Analyzing ICFG safe036.i [2024-02-07 14:25:27,682 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:25:27,690 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-02-07 14:25:27,691 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:25:27,725 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:25:27,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 106 flow [2024-02-07 14:25:27,799 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-02-07 14:25:27,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:27,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-02-07 14:25:27,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 106 flow [2024-02-07 14:25:27,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 100 flow [2024-02-07 14:25:27,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:25:27,826 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;@1fc3ef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:25:27,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-02-07 14:25:27,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:25:27,830 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:25:27,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:27,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:27,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:25:27,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:27,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 8174771, now seen corresponding path program 1 times [2024-02-07 14:25:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842092724] [2024-02-07 14:25:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:27,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842092724] [2024-02-07 14:25:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842092724] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:27,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:27,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228074398] [2024-02-07 14:25:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:25:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:25:28,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:25:28,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:28,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-02-07 14:25:28,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:28,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,234 INFO L124 PetriNetUnfolderBase]: 720/1515 cut-off events. [2024-02-07 14:25:28,234 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 14:25:28,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 1515 events. 720/1515 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10924 event pairs, 720 based on Foata normal form. 42/1091 useless extension candidates. Maximal degree in co-relation 2701. Up to 1177 conditions per place. [2024-02-07 14:25:28,249 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 24 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-02-07 14:25:28,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 130 flow [2024-02-07 14:25:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:25:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:25:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2024-02-07 14:25:28,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6632653061224489 [2024-02-07 14:25:28,259 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 100 flow. Second operand 2 states and 65 transitions. [2024-02-07 14:25:28,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 130 flow [2024-02-07 14:25:28,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:28,263 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 80 flow [2024-02-07 14:25:28,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-02-07 14:25:28,267 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2024-02-07 14:25:28,267 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 80 flow [2024-02-07 14:25:28,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-02-07 14:25:28,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:25:28,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:28,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash -734068165, now seen corresponding path program 1 times [2024-02-07 14:25:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228069519] [2024-02-07 14:25:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228069519] [2024-02-07 14:25:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228069519] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559358284] [2024-02-07 14:25:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:28,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:28,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-07 14:25:28,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:28,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,494 INFO L124 PetriNetUnfolderBase]: 533/1033 cut-off events. [2024-02-07 14:25:28,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:28,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1033 events. 533/1033 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6319 event pairs, 235 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1937. Up to 571 conditions per place. [2024-02-07 14:25:28,501 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 38 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-02-07 14:25:28,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 198 flow [2024-02-07 14:25:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-02-07 14:25:28,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6258503401360545 [2024-02-07 14:25:28,508 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 80 flow. Second operand 3 states and 92 transitions. [2024-02-07 14:25:28,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 198 flow [2024-02-07 14:25:28,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:28,511 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 103 flow [2024-02-07 14:25:28,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-02-07 14:25:28,512 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-02-07 14:25:28,512 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 103 flow [2024-02-07 14:25:28,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-07 14:25:28,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:25:28,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:28,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash -733970411, now seen corresponding path program 1 times [2024-02-07 14:25:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670391083] [2024-02-07 14:25:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:28,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:28,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670391083] [2024-02-07 14:25:28,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670391083] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:28,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:28,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792819781] [2024-02-07 14:25:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:28,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:28,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:28,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-07 14:25:28,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:28,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,671 INFO L124 PetriNetUnfolderBase]: 516/991 cut-off events. [2024-02-07 14:25:28,672 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-02-07 14:25:28,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 991 events. 516/991 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5892 event pairs, 86 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 2095. Up to 774 conditions per place. [2024-02-07 14:25:28,677 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 36 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-02-07 14:25:28,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 208 flow [2024-02-07 14:25:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-02-07 14:25:28,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2024-02-07 14:25:28,680 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 103 flow. Second operand 3 states and 85 transitions. [2024-02-07 14:25:28,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 208 flow [2024-02-07 14:25:28,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:28,682 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 108 flow [2024-02-07 14:25:28,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-02-07 14:25:28,683 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-02-07 14:25:28,684 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 108 flow [2024-02-07 14:25:28,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-07 14:25:28,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:25:28,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:28,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1281276323, now seen corresponding path program 1 times [2024-02-07 14:25:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258062605] [2024-02-07 14:25:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258062605] [2024-02-07 14:25:28,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258062605] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:28,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909509282] [2024-02-07 14:25:28,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:28,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 14:25:28,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-07 14:25:28,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 14:25:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,851 INFO L124 PetriNetUnfolderBase]: 516/1075 cut-off events. [2024-02-07 14:25:28,851 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-02-07 14:25:28,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 1075 events. 516/1075 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7103 event pairs, 498 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 2240. Up to 863 conditions per place. [2024-02-07 14:25:28,856 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 25 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2024-02-07 14:25:28,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 158 flow [2024-02-07 14:25:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-07 14:25:28,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-02-07 14:25:28,858 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 108 flow. Second operand 3 states and 70 transitions. [2024-02-07 14:25:28,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 158 flow [2024-02-07 14:25:28,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:28,859 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 104 flow [2024-02-07 14:25:28,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-02-07 14:25:28,860 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-02-07 14:25:28,860 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 104 flow [2024-02-07 14:25:28,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-07 14:25:28,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:25:28,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:28,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1063917646, now seen corresponding path program 1 times [2024-02-07 14:25:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187027827] [2024-02-07 14:25:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:28,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:28,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187027827] [2024-02-07 14:25:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187027827] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:28,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:28,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358750695] [2024-02-07 14:25:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:28,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:28,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:28,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:28,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-07 14:25:28,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:28,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:28,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:28,980 INFO L124 PetriNetUnfolderBase]: 501/956 cut-off events. [2024-02-07 14:25:28,980 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2024-02-07 14:25:28,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 956 events. 501/956 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5561 event pairs, 106 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 2056. Up to 767 conditions per place. [2024-02-07 14:25:28,984 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 38 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-02-07 14:25:28,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 219 flow [2024-02-07 14:25:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-07 14:25:28,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-02-07 14:25:28,986 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-02-07 14:25:28,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 219 flow [2024-02-07 14:25:28,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:28,987 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 111 flow [2024-02-07 14:25:28,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-02-07 14:25:28,988 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-02-07 14:25:28,988 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 111 flow [2024-02-07 14:25:28,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-07 14:25:28,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:28,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:25:28,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:28,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1349075264, now seen corresponding path program 1 times [2024-02-07 14:25:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446570061] [2024-02-07 14:25:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446570061] [2024-02-07 14:25:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446570061] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:29,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980619635] [2024-02-07 14:25:29,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:29,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:29,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:29,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-07 14:25:29,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:29,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,120 INFO L124 PetriNetUnfolderBase]: 487/935 cut-off events. [2024-02-07 14:25:29,121 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-02-07 14:25:29,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 935 events. 487/935 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5394 event pairs, 147 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 2135. Up to 714 conditions per place. [2024-02-07 14:25:29,124 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-02-07 14:25:29,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 229 flow [2024-02-07 14:25:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-07 14:25:29,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-02-07 14:25:29,126 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 111 flow. Second operand 3 states and 87 transitions. [2024-02-07 14:25:29,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 229 flow [2024-02-07 14:25:29,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:29,127 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 126 flow [2024-02-07 14:25:29,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-02-07 14:25:29,128 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-02-07 14:25:29,128 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 126 flow [2024-02-07 14:25:29,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-07 14:25:29,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:25:29,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1053065834, now seen corresponding path program 1 times [2024-02-07 14:25:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925746914] [2024-02-07 14:25:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925746914] [2024-02-07 14:25:29,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925746914] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267376458] [2024-02-07 14:25:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:29,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:29,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-07 14:25:29,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:29,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,224 INFO L124 PetriNetUnfolderBase]: 421/827 cut-off events. [2024-02-07 14:25:29,225 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-02-07 14:25:29,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 827 events. 421/827 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4608 event pairs, 69 based on Foata normal form. 40/814 useless extension candidates. Maximal degree in co-relation 1976. Up to 627 conditions per place. [2024-02-07 14:25:29,228 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 38 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2024-02-07 14:25:29,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 234 flow [2024-02-07 14:25:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-07 14:25:29,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-07 14:25:29,230 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 126 flow. Second operand 3 states and 84 transitions. [2024-02-07 14:25:29,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 234 flow [2024-02-07 14:25:29,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:29,231 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 119 flow [2024-02-07 14:25:29,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-02-07 14:25:29,232 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-02-07 14:25:29,232 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 119 flow [2024-02-07 14:25:29,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-07 14:25:29,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:25:29,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1227073100, now seen corresponding path program 1 times [2024-02-07 14:25:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725184351] [2024-02-07 14:25:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725184351] [2024-02-07 14:25:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725184351] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733556484] [2024-02-07 14:25:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:29,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:29,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-07 14:25:29,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:29,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,336 INFO L124 PetriNetUnfolderBase]: 368/723 cut-off events. [2024-02-07 14:25:29,337 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-02-07 14:25:29,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 723 events. 368/723 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3807 event pairs, 129 based on Foata normal form. 33/707 useless extension candidates. Maximal degree in co-relation 1696. Up to 557 conditions per place. [2024-02-07 14:25:29,340 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 39 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2024-02-07 14:25:29,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 235 flow [2024-02-07 14:25:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-02-07 14:25:29,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2024-02-07 14:25:29,342 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 119 flow. Second operand 3 states and 85 transitions. [2024-02-07 14:25:29,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 235 flow [2024-02-07 14:25:29,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:29,344 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 114 flow [2024-02-07 14:25:29,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-02-07 14:25:29,346 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-02-07 14:25:29,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 114 flow [2024-02-07 14:25:29,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-07 14:25:29,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:25:29,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1128339503, now seen corresponding path program 1 times [2024-02-07 14:25:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836924570] [2024-02-07 14:25:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836924570] [2024-02-07 14:25:29,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836924570] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317096888] [2024-02-07 14:25:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:29,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 14:25:29,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-07 14:25:29,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 14:25:29,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,470 INFO L124 PetriNetUnfolderBase]: 368/769 cut-off events. [2024-02-07 14:25:29,470 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2024-02-07 14:25:29,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 769 events. 368/769 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4615 event pairs, 324 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 1742. Up to 627 conditions per place. [2024-02-07 14:25:29,473 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 25 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2024-02-07 14:25:29,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 164 flow [2024-02-07 14:25:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-02-07 14:25:29,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-02-07 14:25:29,474 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 114 flow. Second operand 3 states and 68 transitions. [2024-02-07 14:25:29,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 164 flow [2024-02-07 14:25:29,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:29,476 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 113 flow [2024-02-07 14:25:29,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-02-07 14:25:29,477 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-02-07 14:25:29,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 113 flow [2024-02-07 14:25:29,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-02-07 14:25:29,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:25:29,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash -618785941, now seen corresponding path program 1 times [2024-02-07 14:25:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841113382] [2024-02-07 14:25:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841113382] [2024-02-07 14:25:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841113382] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50808266] [2024-02-07 14:25:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:29,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 14:25:29,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-07 14:25:29,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 14:25:29,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,687 INFO L124 PetriNetUnfolderBase]: 294/664 cut-off events. [2024-02-07 14:25:29,688 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-02-07 14:25:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 664 events. 294/664 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3811 event pairs, 59 based on Foata normal form. 29/601 useless extension candidates. Maximal degree in co-relation 1472. Up to 289 conditions per place. [2024-02-07 14:25:29,691 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 40 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-02-07 14:25:29,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 259 flow [2024-02-07 14:25:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-02-07 14:25:29,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-02-07 14:25:29,692 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 113 flow. Second operand 4 states and 104 transitions. [2024-02-07 14:25:29,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 259 flow [2024-02-07 14:25:29,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:29,693 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 134 flow [2024-02-07 14:25:29,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2024-02-07 14:25:29,695 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-02-07 14:25:29,695 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 134 flow [2024-02-07 14:25:29,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-07 14:25:29,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:25:29,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1081936029, now seen corresponding path program 1 times [2024-02-07 14:25:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747446938] [2024-02-07 14:25:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747446938] [2024-02-07 14:25:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747446938] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73392758] [2024-02-07 14:25:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:29,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:29,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-07 14:25:29,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:29,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,781 INFO L124 PetriNetUnfolderBase]: 220/506 cut-off events. [2024-02-07 14:25:29,781 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-02-07 14:25:29,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 506 events. 220/506 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2668 event pairs, 107 based on Foata normal form. 16/478 useless extension candidates. Maximal degree in co-relation 1222. Up to 336 conditions per place. [2024-02-07 14:25:29,784 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 27 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-02-07 14:25:29,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 206 flow [2024-02-07 14:25:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-02-07 14:25:29,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2024-02-07 14:25:29,785 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 134 flow. Second operand 3 states and 80 transitions. [2024-02-07 14:25:29,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 206 flow [2024-02-07 14:25:29,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:29,789 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 115 flow [2024-02-07 14:25:29,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2024-02-07 14:25:29,790 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-02-07 14:25:29,790 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 115 flow [2024-02-07 14:25:29,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-07 14:25:29,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:25:29,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -389839926, now seen corresponding path program 1 times [2024-02-07 14:25:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931627921] [2024-02-07 14:25:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931627921] [2024-02-07 14:25:29,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931627921] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:29,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025378860] [2024-02-07 14:25:29,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:29,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:29,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-07 14:25:29,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:29,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:29,914 INFO L124 PetriNetUnfolderBase]: 190/448 cut-off events. [2024-02-07 14:25:29,915 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-02-07 14:25:29,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 448 events. 190/448 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2323 event pairs, 40 based on Foata normal form. 4/425 useless extension candidates. Maximal degree in co-relation 1063. Up to 258 conditions per place. [2024-02-07 14:25:29,917 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 35 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2024-02-07 14:25:29,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 263 flow [2024-02-07 14:25:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-02-07 14:25:29,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-02-07 14:25:29,918 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 115 flow. Second operand 4 states and 103 transitions. [2024-02-07 14:25:29,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 263 flow [2024-02-07 14:25:29,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 235 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:29,920 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 135 flow [2024-02-07 14:25:29,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2024-02-07 14:25:29,921 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-02-07 14:25:29,921 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 135 flow [2024-02-07 14:25:29,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-07 14:25:29,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:29,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:29,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:25:29,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:29,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash -205952504, now seen corresponding path program 1 times [2024-02-07 14:25:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480444939] [2024-02-07 14:25:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:29,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480444939] [2024-02-07 14:25:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480444939] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:29,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:29,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240823304] [2024-02-07 14:25:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:29,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:29,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:29,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:29,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:29,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:29,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-07 14:25:29,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:29,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:29,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:30,059 INFO L124 PetriNetUnfolderBase]: 206/516 cut-off events. [2024-02-07 14:25:30,060 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-02-07 14:25:30,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 516 events. 206/516 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2723 event pairs, 77 based on Foata normal form. 4/478 useless extension candidates. Maximal degree in co-relation 1226. Up to 298 conditions per place. [2024-02-07 14:25:30,062 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 40 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-02-07 14:25:30,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 302 flow [2024-02-07 14:25:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-02-07 14:25:30,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2024-02-07 14:25:30,063 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 135 flow. Second operand 4 states and 107 transitions. [2024-02-07 14:25:30,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 302 flow [2024-02-07 14:25:30,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:30,065 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 166 flow [2024-02-07 14:25:30,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2024-02-07 14:25:30,066 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-02-07 14:25:30,066 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 166 flow [2024-02-07 14:25:30,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-02-07 14:25:30,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:30,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:30,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:25:30,067 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:30,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2007339448, now seen corresponding path program 1 times [2024-02-07 14:25:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243951563] [2024-02-07 14:25:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243951563] [2024-02-07 14:25:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243951563] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:30,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345920408] [2024-02-07 14:25:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:30,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:30,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:30,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:30,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:30,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 14:25:30,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-02-07 14:25:30,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:30,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 14:25:30,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:30,209 INFO L124 PetriNetUnfolderBase]: 122/274 cut-off events. [2024-02-07 14:25:30,209 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2024-02-07 14:25:30,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 274 events. 122/274 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1039 event pairs, 24 based on Foata normal form. 20/273 useless extension candidates. Maximal degree in co-relation 800. Up to 116 conditions per place. [2024-02-07 14:25:30,211 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 34 selfloop transitions, 6 changer transitions 1/53 dead transitions. [2024-02-07 14:25:30,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 307 flow [2024-02-07 14:25:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-02-07 14:25:30,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-02-07 14:25:30,212 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 166 flow. Second operand 5 states and 110 transitions. [2024-02-07 14:25:30,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 307 flow [2024-02-07 14:25:30,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 282 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:30,214 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 168 flow [2024-02-07 14:25:30,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2024-02-07 14:25:30,214 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-02-07 14:25:30,214 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 168 flow [2024-02-07 14:25:30,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-02-07 14:25:30,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:30,215 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] [2024-02-07 14:25:30,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:25:30,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:30,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash 110935548, now seen corresponding path program 1 times [2024-02-07 14:25:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929130313] [2024-02-07 14:25:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:30,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929130313] [2024-02-07 14:25:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929130313] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:30,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:30,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141872030] [2024-02-07 14:25:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:30,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:30,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:30,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 14:25:30,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:30,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:30,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 14:25:30,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:30,321 INFO L124 PetriNetUnfolderBase]: 125/309 cut-off events. [2024-02-07 14:25:30,322 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2024-02-07 14:25:30,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 309 events. 125/309 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1279 event pairs, 44 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 860. Up to 127 conditions per place. [2024-02-07 14:25:30,323 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 34 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-02-07 14:25:30,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 320 flow [2024-02-07 14:25:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-02-07 14:25:30,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2024-02-07 14:25:30,325 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 168 flow. Second operand 4 states and 97 transitions. [2024-02-07 14:25:30,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 320 flow [2024-02-07 14:25:30,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 267 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-02-07 14:25:30,326 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 170 flow [2024-02-07 14:25:30,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-02-07 14:25:30,327 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-02-07 14:25:30,327 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 170 flow [2024-02-07 14:25:30,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:30,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:30,327 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] [2024-02-07 14:25:30,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:25:30,328 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 14:25:30,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash -40217984, now seen corresponding path program 2 times [2024-02-07 14:25:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:30,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126447468] [2024-02-07 14:25:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:30,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:30,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:30,359 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:30,360 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 30 remaining) [2024-02-07 14:25:30,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 30 remaining) [2024-02-07 14:25:30,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 30 remaining) [2024-02-07 14:25:30,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 30 remaining) [2024-02-07 14:25:30,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 30 remaining) [2024-02-07 14:25:30,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 30 remaining) [2024-02-07 14:25:30,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 30 remaining) [2024-02-07 14:25:30,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 30 remaining) [2024-02-07 14:25:30,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 30 remaining) [2024-02-07 14:25:30,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 30 remaining) [2024-02-07 14:25:30,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 30 remaining) [2024-02-07 14:25:30,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:25:30,365 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:30,370 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:30,370 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:30,391 INFO L503 ceAbstractionStarter]: Automizer considered 17 witness invariants [2024-02-07 14:25:30,391 INFO L504 ceAbstractionStarter]: WitnessConsidered=17 [2024-02-07 14:25:30,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:30 BasicIcfg [2024-02-07 14:25:30,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:30,392 INFO L158 Benchmark]: Toolchain (without parser) took 3956.53ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 87.4MB in the beginning and 107.3MB in the end (delta: -19.8MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-02-07 14:25:30,392 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 85.8MB in the beginning and 85.7MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:30,392 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 159.4MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:30,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.13ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 105.8MB in the end (delta: -18.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-02-07 14:25:30,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.92ms. Allocated memory is still 159.4MB. Free memory was 105.8MB in the beginning and 103.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:30,393 INFO L158 Benchmark]: Boogie Preprocessor took 58.43ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:30,393 INFO L158 Benchmark]: RCFGBuilder took 503.78ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 73.3MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 14:25:30,393 INFO L158 Benchmark]: TraceAbstraction took 2728.01ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 72.3MB in the beginning and 107.3MB in the end (delta: -35.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-02-07 14:25:30,394 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.17ms. Allocated memory is still 119.5MB. Free memory was 85.8MB in the beginning and 85.7MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 159.4MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.13ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 105.8MB in the end (delta: -18.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.92ms. Allocated memory is still 159.4MB. Free memory was 105.8MB in the beginning and 103.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.43ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 101.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.78ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 73.3MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2728.01ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 72.3MB in the beginning and 107.3MB in the end (delta: -35.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 775]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L764] 0 pthread_t t2625; [L765] FCALL, FORK 0 pthread_create(&t2625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2625={5:0}, x=0, y=0] [L722] 1 y = 1 [L723] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L766] 0 pthread_t t2626; [L767] FCALL, FORK 0 pthread_create(&t2626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2625={5:0}, t2626={3:0}, x=0, y=1] [L739] 2 x = 1 [L740] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L727] 1 __unbuffered_p0_EAX = x [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L732] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L744] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L744] 2 __unbuffered_p1_EAX = y [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L749] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L749] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L769] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L769] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L770] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2625={5:0}, t2626={3:0}, x=1, y=1] [L771] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L771] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(main$tmp_guard0) [L775] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2625={5:0}, t2626={3:0}, x=1, y=1] - UnprovableResult [Line: 723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 767]: 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: 765]: 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, 77 locations, 30 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: 2.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 3 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=15, InterpolantAutomatonStates: 50, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-02-07 14:25:30,428 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