./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_tso.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/safe011_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/safe011_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe011_tso.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-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:03:48,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:48,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:03:48,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:48,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:48,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:48,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:48,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:48,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:48,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:48,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:48,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:48,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:48,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:48,882 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:48,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:48,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:48,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:48,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:48,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:48,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:48,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:48,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:48,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:48,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:48,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:48,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:48,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:48,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:48,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:48,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:48,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:48,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:48,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:48,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:48,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:48,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:48,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:48,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:48,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:48,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:48,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:48,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:48,897 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 19:03:49,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:49,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:49,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:49,140 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:03:49,141 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:03:49,142 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/safe011_tso.yml/witness.yml [2024-02-07 19:03:49,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:49,256 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:49,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_tso.i [2024-02-07 19:03:50,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:03:50,526 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:03:50,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_tso.i [2024-02-07 19:03:50,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbbb11066/d354e222290c4a768209d3fa131982db/FLAG632e544f6 [2024-02-07 19:03:50,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbbb11066/d354e222290c4a768209d3fa131982db [2024-02-07 19:03:50,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:03:50,557 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:03:50,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:50,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:03:50,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:03:50,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:49" (1/2) ... [2024-02-07 19:03:50,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168d5cd6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:50, skipping insertion in model container [2024-02-07 19:03:50,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:49" (1/2) ... [2024-02-07 19:03:50,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@efc376f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:50, skipping insertion in model container [2024-02-07 19:03:50,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:50" (2/2) ... [2024-02-07 19:03:50,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168d5cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:50, skipping insertion in model container [2024-02-07 19:03:50,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:50" (2/2) ... [2024-02-07 19:03:50,569 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:03:50,624 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:03:50,625 INFO L76 edCorrectnessWitness]: Location invariant before [L790-L790] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:50,625 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] 0 <= __unbuffered_cnt [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] x == 1 [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L785-L785] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] 0 <= __unbuffered_cnt [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (x == 2)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (z == 2 || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] 1 <= __unbuffered_cnt [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L784-L784] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:50,626 INFO L76 edCorrectnessWitness]: Location invariant before [L783-L783] 0 <= __unbuffered_cnt [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L739-L739] x == 2 [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L742-L742] y == 1 [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] z == 1 [2024-02-07 19:03:50,627 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 0 <= __unbuffered_cnt [2024-02-07 19:03:50,628 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] 1 <= __unbuffered_cnt [2024-02-07 19:03:50,628 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:50,628 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] 1 <= __unbuffered_cnt [2024-02-07 19:03:50,628 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] z == 2 [2024-02-07 19:03:50,677 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:03:50,823 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/safe011_tso.i[945,958] [2024-02-07 19:03:50,934 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:50,957 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:03:50,999 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/safe011_tso.i[945,958] 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 Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:03:51,049 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:51,082 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:03:51,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51 WrapperNode [2024-02-07 19:03:51,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:51,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:51,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:03:51,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:03:51,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,156 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-07 19:03:51,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:51,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:03:51,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:03:51,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:03:51,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,204 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 19:03:51,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:03:51,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:03:51,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:03:51,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:03:51,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (1/1) ... [2024-02-07 19:03:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:03:51,310 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 19:03:51,336 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 19:03:51,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:03:51,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:03:51,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:03:51,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:03:51,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:03:51,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:03:51,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:03:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:03:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:03:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:03:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:03:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:03:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:03:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:03:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:03:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:03:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:03:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:03:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:03:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:03:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:03:51,352 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 19:03:51,484 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:03:51,489 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:03:51,703 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:03:51,703 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:03:51,832 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:03:51,833 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:03:51,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:51 BoogieIcfgContainer [2024-02-07 19:03:51,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:03:51,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:03:51,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:03:51,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:03:51,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:49" (1/4) ... [2024-02-07 19:03:51,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d21d57b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:51, skipping insertion in model container [2024-02-07 19:03:51,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:03:50" (2/4) ... [2024-02-07 19:03:51,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d21d57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:51, skipping insertion in model container [2024-02-07 19:03:51,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51" (3/4) ... [2024-02-07 19:03:51,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d21d57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:51, skipping insertion in model container [2024-02-07 19:03:51,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:51" (4/4) ... [2024-02-07 19:03:51,845 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_tso.i [2024-02-07 19:03:51,859 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:03:51,859 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-02-07 19:03:51,859 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:03:51,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:03:51,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 59 transitions, 130 flow [2024-02-07 19:03:51,995 INFO L124 PetriNetUnfolderBase]: 1/56 cut-off events. [2024-02-07 19:03:51,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:51,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 56 events. 1/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 157 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-02-07 19:03:51,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 59 transitions, 130 flow [2024-02-07 19:03:52,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 121 flow [2024-02-07 19:03:52,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:03:52,025 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;@7e1fb228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:03:52,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-02-07 19:03:52,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:03:52,032 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:03:52,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:52,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:52,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:03:52,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:52,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 9237091, now seen corresponding path program 1 times [2024-02-07 19:03:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197000856] [2024-02-07 19:03:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:52,313 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 19:03:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197000856] [2024-02-07 19:03:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197000856] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:52,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748731853] [2024-02-07 19:03:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:52,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:03:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:03:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:03:52,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:03:52,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 19:03:52,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:52,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:03:52,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:53,340 INFO L124 PetriNetUnfolderBase]: 5603/9828 cut-off events. [2024-02-07 19:03:53,343 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-07 19:03:53,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17875 conditions, 9828 events. 5603/9828 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 76687 event pairs, 5603 based on Foata normal form. 252/7524 useless extension candidates. Maximal degree in co-relation 17864. Up to 7957 conditions per place. [2024-02-07 19:03:53,422 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 30 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2024-02-07 19:03:53,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 157 flow [2024-02-07 19:03:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:03:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:03:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2024-02-07 19:03:53,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-02-07 19:03:53,434 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 2 states and 76 transitions. [2024-02-07 19:03:53,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 157 flow [2024-02-07 19:03:53,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:53,443 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 94 flow [2024-02-07 19:03:53,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-02-07 19:03:53,448 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -13 predicate places. [2024-02-07 19:03:53,448 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 94 flow [2024-02-07 19:03:53,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 19:03:53,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:53,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:03:53,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:53,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 304601740, now seen corresponding path program 1 times [2024-02-07 19:03:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615154332] [2024-02-07 19:03:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:53,536 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 19:03:53,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615154332] [2024-02-07 19:03:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615154332] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:53,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:53,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517951657] [2024-02-07 19:03:53,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:53,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:53,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:03:53,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 94 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 19:03:53,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:53,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:03:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:54,009 INFO L124 PetriNetUnfolderBase]: 4321/6560 cut-off events. [2024-02-07 19:03:54,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:54,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12859 conditions, 6560 events. 4321/6560 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 40056 event pairs, 1451 based on Foata normal form. 0/5239 useless extension candidates. Maximal degree in co-relation 12856. Up to 5321 conditions per place. [2024-02-07 19:03:54,040 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 47 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2024-02-07 19:03:54,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 242 flow [2024-02-07 19:03:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 19:03:54,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2024-02-07 19:03:54,042 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 94 flow. Second operand 3 states and 106 transitions. [2024-02-07 19:03:54,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 242 flow [2024-02-07 19:03:54,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:03:54,044 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 126 flow [2024-02-07 19:03:54,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-02-07 19:03:54,045 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2024-02-07 19:03:54,045 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 126 flow [2024-02-07 19:03:54,045 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 19:03:54,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:54,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:54,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:03:54,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:54,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash -462913884, now seen corresponding path program 1 times [2024-02-07 19:03:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:54,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606560630] [2024-02-07 19:03:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:54,101 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 19:03:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606560630] [2024-02-07 19:03:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606560630] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:54,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:54,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288821712] [2024-02-07 19:03:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:54,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:54,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:03:54,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 19:03:54,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:54,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:03:54,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:54,664 INFO L124 PetriNetUnfolderBase]: 4097/6549 cut-off events. [2024-02-07 19:03:54,664 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-02-07 19:03:54,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14403 conditions, 6549 events. 4097/6549 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 43432 event pairs, 1481 based on Foata normal form. 0/5474 useless extension candidates. Maximal degree in co-relation 14398. Up to 4363 conditions per place. [2024-02-07 19:03:54,694 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 53 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 19:03:54,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 298 flow [2024-02-07 19:03:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 19:03:54,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2024-02-07 19:03:54,699 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 126 flow. Second operand 3 states and 102 transitions. [2024-02-07 19:03:54,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 298 flow [2024-02-07 19:03:54,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:54,702 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 130 flow [2024-02-07 19:03:54,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-02-07 19:03:54,703 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -8 predicate places. [2024-02-07 19:03:54,704 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 130 flow [2024-02-07 19:03:54,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 19:03:54,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:54,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:54,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:03:54,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:54,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1465490519, now seen corresponding path program 1 times [2024-02-07 19:03:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066941097] [2024-02-07 19:03:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:54,782 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 19:03:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066941097] [2024-02-07 19:03:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066941097] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369609694] [2024-02-07 19:03:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:54,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:54,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:03:54,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 130 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 19:03:54,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:54,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:03:54,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:55,174 INFO L124 PetriNetUnfolderBase]: 4097/7067 cut-off events. [2024-02-07 19:03:55,175 INFO L125 PetriNetUnfolderBase]: For 1211/1215 co-relation queries the response was YES. [2024-02-07 19:03:55,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15353 conditions, 7067 events. 4097/7067 cut-off events. For 1211/1215 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 51459 event pairs, 3823 based on Foata normal form. 0/5838 useless extension candidates. Maximal degree in co-relation 15347. Up to 5918 conditions per place. [2024-02-07 19:03:55,210 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 32 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-02-07 19:03:55,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 194 flow [2024-02-07 19:03:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 19:03:55,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4463276836158192 [2024-02-07 19:03:55,211 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 130 flow. Second operand 3 states and 79 transitions. [2024-02-07 19:03:55,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 194 flow [2024-02-07 19:03:55,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:55,214 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 126 flow [2024-02-07 19:03:55,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-02-07 19:03:55,216 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2024-02-07 19:03:55,216 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 126 flow [2024-02-07 19:03:55,216 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 19:03:55,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:55,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:55,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:03:55,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:55,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1999823327, now seen corresponding path program 1 times [2024-02-07 19:03:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537594502] [2024-02-07 19:03:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:55,252 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 19:03:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537594502] [2024-02-07 19:03:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537594502] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271737143] [2024-02-07 19:03:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:55,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:03:55,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 19:03:55,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:55,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:03:55,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:55,605 INFO L124 PetriNetUnfolderBase]: 3702/5966 cut-off events. [2024-02-07 19:03:55,605 INFO L125 PetriNetUnfolderBase]: For 727/731 co-relation queries the response was YES. [2024-02-07 19:03:55,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13139 conditions, 5966 events. 3702/5966 cut-off events. For 727/731 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 39037 event pairs, 1341 based on Foata normal form. 172/5286 useless extension candidates. Maximal degree in co-relation 13133. Up to 3799 conditions per place. [2024-02-07 19:03:55,633 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 53 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2024-02-07 19:03:55,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 290 flow [2024-02-07 19:03:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-07 19:03:55,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5706214689265536 [2024-02-07 19:03:55,635 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 126 flow. Second operand 3 states and 101 transitions. [2024-02-07 19:03:55,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 290 flow [2024-02-07 19:03:55,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:55,637 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 121 flow [2024-02-07 19:03:55,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-02-07 19:03:55,639 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2024-02-07 19:03:55,639 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 121 flow [2024-02-07 19:03:55,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 19:03:55,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:55,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:55,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:03:55,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:55,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash 412893514, now seen corresponding path program 1 times [2024-02-07 19:03:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201204939] [2024-02-07 19:03:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:55,832 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 19:03:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201204939] [2024-02-07 19:03:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201204939] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583455749] [2024-02-07 19:03:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:55,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:55,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:55,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:03:55,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 19:03:55,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:55,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:03:55,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,228 INFO L124 PetriNetUnfolderBase]: 3493/6279 cut-off events. [2024-02-07 19:03:56,228 INFO L125 PetriNetUnfolderBase]: For 823/823 co-relation queries the response was YES. [2024-02-07 19:03:56,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13219 conditions, 6279 events. 3493/6279 cut-off events. For 823/823 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 46341 event pairs, 597 based on Foata normal form. 179/5382 useless extension candidates. Maximal degree in co-relation 13214. Up to 3001 conditions per place. [2024-02-07 19:03:56,261 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 54 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2024-02-07 19:03:56,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 313 flow [2024-02-07 19:03:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-02-07 19:03:56,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296610169491526 [2024-02-07 19:03:56,262 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 121 flow. Second operand 4 states and 125 transitions. [2024-02-07 19:03:56,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 313 flow [2024-02-07 19:03:56,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:56,265 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 146 flow [2024-02-07 19:03:56,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-02-07 19:03:56,268 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -6 predicate places. [2024-02-07 19:03:56,268 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 146 flow [2024-02-07 19:03:56,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 19:03:56,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:56,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:03:56,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash -125461527, now seen corresponding path program 1 times [2024-02-07 19:03:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655436505] [2024-02-07 19:03:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,303 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 19:03:56,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655436505] [2024-02-07 19:03:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655436505] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989995368] [2024-02-07 19:03:56,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:56,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-02-07 19:03:56,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:03:56,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:56,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-02-07 19:03:56,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,555 INFO L124 PetriNetUnfolderBase]: 2080/3778 cut-off events. [2024-02-07 19:03:56,556 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-02-07 19:03:56,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8279 conditions, 3778 events. 2080/3778 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 25196 event pairs, 864 based on Foata normal form. 98/3570 useless extension candidates. Maximal degree in co-relation 8272. Up to 2834 conditions per place. [2024-02-07 19:03:56,575 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 35 selfloop transitions, 3 changer transitions 2/53 dead transitions. [2024-02-07 19:03:56,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 237 flow [2024-02-07 19:03:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-02-07 19:03:56,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536723163841808 [2024-02-07 19:03:56,577 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 146 flow. Second operand 3 states and 95 transitions. [2024-02-07 19:03:56,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 237 flow [2024-02-07 19:03:56,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:56,579 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 124 flow [2024-02-07 19:03:56,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-02-07 19:03:56,579 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -10 predicate places. [2024-02-07 19:03:56,579 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 124 flow [2024-02-07 19:03:56,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:03:56,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:56,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:03:56,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 134355528, now seen corresponding path program 1 times [2024-02-07 19:03:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295662163] [2024-02-07 19:03:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,677 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 19:03:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295662163] [2024-02-07 19:03:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295662163] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845624420] [2024-02-07 19:03:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:56,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:03:56,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:56,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:03:56,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,950 INFO L124 PetriNetUnfolderBase]: 1159/2139 cut-off events. [2024-02-07 19:03:56,950 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2024-02-07 19:03:56,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4764 conditions, 2139 events. 1159/2139 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 12351 event pairs, 149 based on Foata normal form. 98/2093 useless extension candidates. Maximal degree in co-relation 4757. Up to 641 conditions per place. [2024-02-07 19:03:56,961 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 57 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2024-02-07 19:03:56,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 357 flow [2024-02-07 19:03:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 19:03:56,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016949152542373 [2024-02-07 19:03:56,964 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 124 flow. Second operand 5 states and 148 transitions. [2024-02-07 19:03:56,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 357 flow [2024-02-07 19:03:56,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 341 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:56,969 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 157 flow [2024-02-07 19:03:56,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-02-07 19:03:56,971 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -8 predicate places. [2024-02-07 19:03:56,971 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 157 flow [2024-02-07 19:03:56,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,972 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 19:03:56,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:03:56,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1795997098, now seen corresponding path program 1 times [2024-02-07 19:03:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172543978] [2024-02-07 19:03:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:57,135 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 19:03:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172543978] [2024-02-07 19:03:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172543978] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:03:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543011215] [2024-02-07 19:03:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:57,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:03:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:03:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:03:57,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-02-07 19:03:57,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-02-07 19:03:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:57,297 INFO L124 PetriNetUnfolderBase]: 700/1194 cut-off events. [2024-02-07 19:03:57,298 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2024-02-07 19:03:57,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1194 events. 700/1194 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5368 event pairs, 128 based on Foata normal form. 44/1202 useless extension candidates. Maximal degree in co-relation 3106. Up to 378 conditions per place. [2024-02-07 19:03:57,303 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 49 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-02-07 19:03:57,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 353 flow [2024-02-07 19:03:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:03:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:03:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-02-07 19:03:57,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491525423728814 [2024-02-07 19:03:57,305 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 157 flow. Second operand 6 states and 159 transitions. [2024-02-07 19:03:57,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 353 flow [2024-02-07 19:03:57,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 328 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:03:57,308 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 171 flow [2024-02-07 19:03:57,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-02-07 19:03:57,309 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -5 predicate places. [2024-02-07 19:03:57,309 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 171 flow [2024-02-07 19:03:57,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:57,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:57,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:03:57,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:57,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1333646398, now seen corresponding path program 1 times [2024-02-07 19:03:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384561227] [2024-02-07 19:03:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:57,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:03:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:57,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:03:57,354 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:03:57,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 37 remaining) [2024-02-07 19:03:57,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 37 remaining) [2024-02-07 19:03:57,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 37 remaining) [2024-02-07 19:03:57,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 37 remaining) [2024-02-07 19:03:57,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 37 remaining) [2024-02-07 19:03:57,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 37 remaining) [2024-02-07 19:03:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:03:57,361 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:57,366 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:03:57,366 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:03:57,395 INFO L503 ceAbstractionStarter]: Automizer considered 20 witness invariants [2024-02-07 19:03:57,395 INFO L504 ceAbstractionStarter]: WitnessConsidered=20 [2024-02-07 19:03:57,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:03:57 BasicIcfg [2024-02-07 19:03:57,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:03:57,396 INFO L158 Benchmark]: Toolchain (without parser) took 6839.46ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 100.3MB in the beginning and 428.9MB in the end (delta: -328.6MB). Peak memory consumption was 571.4MB. Max. memory is 16.1GB. [2024-02-07 19:03:57,397 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:57,397 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:57,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.41ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 71.2MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-02-07 19:03:57,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.33ms. Allocated memory is still 174.1MB. Free memory was 70.9MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:57,397 INFO L158 Benchmark]: Boogie Preprocessor took 109.78ms. Allocated memory is still 174.1MB. Free memory was 68.8MB in the beginning and 144.9MB in the end (delta: -76.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-02-07 19:03:57,397 INFO L158 Benchmark]: RCFGBuilder took 566.58ms. Allocated memory is still 174.1MB. Free memory was 144.9MB in the beginning and 114.0MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-07 19:03:57,398 INFO L158 Benchmark]: TraceAbstraction took 5559.13ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 113.2MB in the beginning and 428.9MB in the end (delta: -315.7MB). Peak memory consumption was 583.6MB. Max. memory is 16.1GB. [2024-02-07 19:03:57,399 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.15ms. Allocated memory is still 117.4MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.41ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 71.2MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.33ms. Allocated memory is still 174.1MB. Free memory was 70.9MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.78ms. Allocated memory is still 174.1MB. Free memory was 68.8MB in the beginning and 144.9MB in the end (delta: -76.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * RCFGBuilder took 566.58ms. Allocated memory is still 174.1MB. Free memory was 144.9MB in the beginning and 114.0MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5559.13ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 113.2MB in the beginning and 428.9MB in the end (delta: -315.7MB). Peak memory consumption was 583.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 789]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L776] 0 pthread_t t2043; [L777] FCALL, FORK 0 pthread_create(&t2043, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2043={5:0}, x=0, y=0, z=0] [L723] 1 z = 2 [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=2] [L778] 0 pthread_t t2044; [L779] FCALL, FORK 0 pthread_create(&t2044, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2043={5:0}, t2044={6:0}, x=0, y=0, z=2] [L738] 2 x = 2 [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=2, y=0, z=2] [L726] 1 x = 1 [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_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=0, z=2] [L780] 0 pthread_t t2045; [L781] FCALL, FORK 0 pthread_create(&t2045, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2043={5:0}, t2044={6:0}, t2045={3:0}, x=1, y=0, z=2] [L753] 3 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]]]]]] [L753] 3 __unbuffered_p2_EAX = y [L754] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=2] [L741] 2 y = 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=2] [L756] 3 z = 1 [L757] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L731] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L761] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L783] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L784] 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=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2043={5:0}, t2044={6:0}, t2045={3:0}, x=1, y=1, z=1] [L785] 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]]]]]] [L785] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L785] RET 0 assume_abort_if_not(main$tmp_guard0) [L789] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[2]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[z]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[2]]]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2043={5:0}, t2044={6:0}, t2045={3:0}, x=1, y=1, z=1] - UnprovableResult [Line: 724]: 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: 731]: 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: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: 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: 781]: 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: 779]: 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: 777]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 96 locations, 37 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: 5.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 1 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=9, InterpolantAutomatonStates: 32, 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, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 19:03:57,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