./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c --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/parallel-parallel-sum-1.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/parallel-parallel-sum-1.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:36:24,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:36:24,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:36:24,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:36:24,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:36:24,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:36:24,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:36:24,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:36:24,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:36:24,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:36:24,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:36:24,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:36:24,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:36:24,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:36:24,999 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:36:25,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:36:25,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:36:25,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:36:25,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:36:25,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:36:25,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:36:25,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:36:25,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:36:25,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:36:25,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:36:25,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:36:25,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:36:25,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:36:25,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:36:25,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:36:25,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:36:25,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:36:25,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:36:25,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:36:25,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:36:25,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:36:25,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:36:25,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:36:25,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:36:25,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:36:25,027 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:36:25,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:36:25,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:36:25,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 14:36:25,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:36:25,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:36:25,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:36:25,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:36:25,302 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:36:25,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2024-02-07 14:36:26,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:36:26,676 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:36:26,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2024-02-07 14:36:26,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2392588ec/39205225d96e498db0f148dd5601f08b/FLAG9938c46a0 [2024-02-07 14:36:26,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2392588ec/39205225d96e498db0f148dd5601f08b [2024-02-07 14:36:26,696 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:36:26,697 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:36:26,697 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/parallel-parallel-sum-1.wvr.yml/witness.yml [2024-02-07 14:36:26,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:36:26,782 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:36:26,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:36:26,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:36:26,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:36:26,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:36:26" (1/2) ... [2024-02-07 14:36:26,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d870276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:36:26, skipping insertion in model container [2024-02-07 14:36:26,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:36:26" (1/2) ... [2024-02-07 14:36:26,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2455f73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:36:26, skipping insertion in model container [2024-02-07 14:36:26,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:36:26" (2/2) ... [2024-02-07 14:36:26,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d870276 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:26, skipping insertion in model container [2024-02-07 14:36:26,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:36:26" (2/2) ... [2024-02-07 14:36:26,796 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:36:26,824 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:36:26,825 INFO L76 edCorrectnessWitness]: Location invariant before [L143-L143] -2147483647 <= size [2024-02-07 14:36:26,826 INFO L76 edCorrectnessWitness]: Location invariant before [L142-L142] -2147483647 <= size [2024-02-07 14:36:26,826 INFO L76 edCorrectnessWitness]: Location invariant before [L97-L97] -2147483647 <= i2 [2024-02-07 14:36:26,826 INFO L76 edCorrectnessWitness]: Location invariant before [L67-L67] -2147483647 <= i1 [2024-02-07 14:36:26,826 INFO L76 edCorrectnessWitness]: Location invariant before [L154-L154] (1 <= b) && (b != 0) [2024-02-07 14:36:26,827 INFO L76 edCorrectnessWitness]: Location invariant before [L147-L147] ((((((((8 <= i && i <= 2147483646) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-07 14:36:26,827 INFO L76 edCorrectnessWitness]: Location invariant before [L52-L52] -2147483647 <= i1 [2024-02-07 14:36:26,827 INFO L76 edCorrectnessWitness]: Location invariant before [L153-L153] (b <= -1) && (b != 0) [2024-02-07 14:36:26,827 INFO L76 edCorrectnessWitness]: Location invariant before [L82-L82] -2147483647 <= i2 [2024-02-07 14:36:26,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:36:27,069 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2024-02-07 14:36:27,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:36:27,111 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:36:27,167 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:36:27,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:36:27,192 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:36:27,192 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27 WrapperNode [2024-02-07 14:36:27,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:36:27,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:36:27,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:36:27,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:36:27,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,262 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 330 [2024-02-07 14:36:27,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:36:27,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:36:27,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:36:27,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:36:27,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,305 INFO L175 MemorySlicer]: Split 15 memory accesses to 6 slices as follows [2, 2, 5, 2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 1, 1, 1]. [2024-02-07 14:36:27,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:36:27,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:36:27,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:36:27,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:36:27,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (1/1) ... [2024-02-07 14:36:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:36:27,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:36:27,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 14:36:27,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 14:36:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:36:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:36:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:36:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:36:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:36:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:36:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:36:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-07 14:36:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:36:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:36:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:36:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:36:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:36:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-07 14:36:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:36:27,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:36:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:36:27,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:36:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 14:36:27,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 14:36:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 14:36:27,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 14:36:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:36:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:36:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:36:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:36:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:36:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-07 14:36:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:36:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:36:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-07 14:36:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:36:27,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:36:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:36:27,404 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:36:27,520 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:36:27,522 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:36:27,959 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:36:27,960 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:36:28,365 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:36:28,366 INFO L320 CfgBuilder]: Removed 5 assume(true) statements. [2024-02-07 14:36:28,367 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:36:28 BoogieIcfgContainer [2024-02-07 14:36:28,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:36:28,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:36:28,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:36:28,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:36:28,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:36:26" (1/4) ... [2024-02-07 14:36:28,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776bff24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:36:28, skipping insertion in model container [2024-02-07 14:36:28,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:36:26" (2/4) ... [2024-02-07 14:36:28,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776bff24 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:36:28, skipping insertion in model container [2024-02-07 14:36:28,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:36:27" (3/4) ... [2024-02-07 14:36:28,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776bff24 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:36:28, skipping insertion in model container [2024-02-07 14:36:28,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:36:28" (4/4) ... [2024-02-07 14:36:28,378 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2024-02-07 14:36:28,395 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:36:28,396 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-02-07 14:36:28,396 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:36:28,473 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 14:36:28,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 75 transitions, 178 flow [2024-02-07 14:36:28,556 INFO L124 PetriNetUnfolderBase]: 9/71 cut-off events. [2024-02-07 14:36:28,556 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 14:36:28,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 9/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 150 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-02-07 14:36:28,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 75 transitions, 178 flow [2024-02-07 14:36:28,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 70 transitions, 164 flow [2024-02-07 14:36:28,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:36:28,588 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;@21f5cf1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:36:28,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-02-07 14:36:28,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:36:28,591 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:36:28,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:36:28,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:28,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:36:28,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:28,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 1 times [2024-02-07 14:36:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303638604] [2024-02-07 14:36:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:28,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303638604] [2024-02-07 14:36:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303638604] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:36:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:36:28,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:36:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689344737] [2024-02-07 14:36:28,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:36:28,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:36:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:36:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:36:28,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2024-02-07 14:36:28,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:28,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:28,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2024-02-07 14:36:28,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:32,875 INFO L124 PetriNetUnfolderBase]: 30430/41281 cut-off events. [2024-02-07 14:36:32,875 INFO L125 PetriNetUnfolderBase]: For 1983/1983 co-relation queries the response was YES. [2024-02-07 14:36:32,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84006 conditions, 41281 events. 30430/41281 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 3077. Compared 271236 event pairs, 30429 based on Foata normal form. 4730/30562 useless extension candidates. Maximal degree in co-relation 75206. Up to 40961 conditions per place. [2024-02-07 14:36:33,197 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 47 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-02-07 14:36:33,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 60 transitions, 242 flow [2024-02-07 14:36:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:36:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:36:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 14:36:33,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2024-02-07 14:36:33,213 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 164 flow. Second operand 3 states and 104 transitions. [2024-02-07 14:36:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 60 transitions, 242 flow [2024-02-07 14:36:33,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 226 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-07 14:36:33,330 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 132 flow [2024-02-07 14:36:33,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-02-07 14:36:33,335 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2024-02-07 14:36:33,336 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 132 flow [2024-02-07 14:36:33,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:33,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:33,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 14:36:33,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:36:33,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:33,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 892396036, now seen corresponding path program 1 times [2024-02-07 14:36:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588524977] [2024-02-07 14:36:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588524977] [2024-02-07 14:36:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588524977] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:36:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:36:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:36:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994980700] [2024-02-07 14:36:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:36:33,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:36:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:36:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:36:33,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 14:36:33,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:33,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:33,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 14:36:33,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:36,362 INFO L124 PetriNetUnfolderBase]: 30431/41284 cut-off events. [2024-02-07 14:36:36,362 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2024-02-07 14:36:36,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82842 conditions, 41284 events. 30431/41284 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 3077. Compared 271369 event pairs, 30429 based on Foata normal form. 0/25834 useless extension candidates. Maximal degree in co-relation 82818. Up to 40967 conditions per place. [2024-02-07 14:36:36,624 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-02-07 14:36:36,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 242 flow [2024-02-07 14:36:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:36:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:36:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-07 14:36:36,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2024-02-07 14:36:36,626 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 132 flow. Second operand 3 states and 101 transitions. [2024-02-07 14:36:36,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 242 flow [2024-02-07 14:36:36,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:36:36,628 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 147 flow [2024-02-07 14:36:36,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-02-07 14:36:36,629 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2024-02-07 14:36:36,630 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 147 flow [2024-02-07 14:36:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:36,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:36,630 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-02-07 14:36:36,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:36:36,631 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:36,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1400838909, now seen corresponding path program 1 times [2024-02-07 14:36:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925143631] [2024-02-07 14:36:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925143631] [2024-02-07 14:36:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925143631] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:36:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274202032] [2024-02-07 14:36:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:36,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:36:36,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:36:36,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 14:36:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:36,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 14:36:36,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:36:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:36,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274202032] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:36,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-02-07 14:36:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908266624] [2024-02-07 14:36:36,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:36,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:36:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:36,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:36:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:36:36,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 14:36:36,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:36,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:36,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 14:36:36,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:39,351 INFO L124 PetriNetUnfolderBase]: 30432/41287 cut-off events. [2024-02-07 14:36:39,352 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2024-02-07 14:36:39,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82855 conditions, 41287 events. 30432/41287 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 3077. Compared 271143 event pairs, 30429 based on Foata normal form. 0/25837 useless extension candidates. Maximal degree in co-relation 82818. Up to 40968 conditions per place. [2024-02-07 14:36:39,584 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2024-02-07 14:36:39,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 263 flow [2024-02-07 14:36:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:36:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:36:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-02-07 14:36:39,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2024-02-07 14:36:39,591 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 147 flow. Second operand 4 states and 119 transitions. [2024-02-07 14:36:39,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 263 flow [2024-02-07 14:36:39,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:36:39,594 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 171 flow [2024-02-07 14:36:39,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-02-07 14:36:39,595 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2024-02-07 14:36:39,598 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 171 flow [2024-02-07 14:36:39,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:39,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:39,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:36:39,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 14:36:39,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:39,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:39,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1789290326, now seen corresponding path program 1 times [2024-02-07 14:36:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:39,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724624810] [2024-02-07 14:36:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:39,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724624810] [2024-02-07 14:36:39,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724624810] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:36:39,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:36:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:36:39,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728783557] [2024-02-07 14:36:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:36:39,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:36:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:36:39,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:36:39,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2024-02-07 14:36:39,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 171 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 14:36:39,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:39,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2024-02-07 14:36:39,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:41,699 INFO L124 PetriNetUnfolderBase]: 23380/31837 cut-off events. [2024-02-07 14:36:41,700 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-02-07 14:36:41,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63905 conditions, 31837 events. 23380/31837 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 205320 event pairs, 23377 based on Foata normal form. 0/21217 useless extension candidates. Maximal degree in co-relation 63873. Up to 31596 conditions per place. [2024-02-07 14:36:41,853 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 50 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2024-02-07 14:36:41,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2024-02-07 14:36:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:36:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:36:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 14:36:41,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-07 14:36:41,855 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 171 flow. Second operand 3 states and 100 transitions. [2024-02-07 14:36:41,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2024-02-07 14:36:41,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-02-07 14:36:41,857 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 158 flow [2024-02-07 14:36:41,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-02-07 14:36:41,858 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2024-02-07 14:36:41,859 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 158 flow [2024-02-07 14:36:41,859 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 14:36:41,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:41,859 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-02-07 14:36:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:36:41,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:41,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1881398206, now seen corresponding path program 2 times [2024-02-07 14:36:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945215181] [2024-02-07 14:36:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945215181] [2024-02-07 14:36:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945215181] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:36:41,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508712702] [2024-02-07 14:36:41,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:36:41,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:41,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:36:41,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:36:41,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 14:36:42,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:36:42,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:36:42,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 14:36:42,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:36:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:42,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508712702] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:42,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-02-07 14:36:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694908473] [2024-02-07 14:36:42,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:42,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:36:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:36:42,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:36:42,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 14:36:42,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:42,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:42,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 14:36:42,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:44,005 INFO L124 PetriNetUnfolderBase]: 23381/31840 cut-off events. [2024-02-07 14:36:44,005 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2024-02-07 14:36:44,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63910 conditions, 31840 events. 23381/31840 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 205529 event pairs, 23377 based on Foata normal form. 0/21219 useless extension candidates. Maximal degree in co-relation 63902. Up to 31597 conditions per place. [2024-02-07 14:36:44,147 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 47 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2024-02-07 14:36:44,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 278 flow [2024-02-07 14:36:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:36:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:36:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-02-07 14:36:44,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-02-07 14:36:44,149 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 158 flow. Second operand 5 states and 135 transitions. [2024-02-07 14:36:44,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 278 flow [2024-02-07 14:36:44,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:36:44,151 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 192 flow [2024-02-07 14:36:44,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-02-07 14:36:44,152 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2024-02-07 14:36:44,152 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 192 flow [2024-02-07 14:36:44,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:44,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:44,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:36:44,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-07 14:36:44,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:44,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:44,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 366575731, now seen corresponding path program 1 times [2024-02-07 14:36:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450584664] [2024-02-07 14:36:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450584664] [2024-02-07 14:36:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450584664] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:36:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:36:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:36:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523856098] [2024-02-07 14:36:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:36:44,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:36:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:36:44,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:36:44,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 14:36:44,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:44,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:44,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 14:36:44,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:47,030 INFO L124 PetriNetUnfolderBase]: 31193/42788 cut-off events. [2024-02-07 14:36:47,030 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2024-02-07 14:36:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85834 conditions, 42788 events. 31193/42788 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 2878. Compared 291809 event pairs, 31190 based on Foata normal form. 1299/30080 useless extension candidates. Maximal degree in co-relation 85825. Up to 31591 conditions per place. [2024-02-07 14:36:47,234 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 81 selfloop transitions, 7 changer transitions 1/99 dead transitions. [2024-02-07 14:36:47,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 448 flow [2024-02-07 14:36:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:36:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:36:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-02-07 14:36:47,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448 [2024-02-07 14:36:47,236 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 192 flow. Second operand 5 states and 168 transitions. [2024-02-07 14:36:47,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 448 flow [2024-02-07 14:36:47,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 429 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 14:36:47,238 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 194 flow [2024-02-07 14:36:47,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-02-07 14:36:47,239 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2024-02-07 14:36:47,239 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 194 flow [2024-02-07 14:36:47,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:47,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:47,240 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1] [2024-02-07 14:36:47,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:36:47,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:47,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 157585345, now seen corresponding path program 3 times [2024-02-07 14:36:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935006306] [2024-02-07 14:36:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935006306] [2024-02-07 14:36:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935006306] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:36:47,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184484418] [2024-02-07 14:36:47,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:36:47,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:47,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:36:47,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:36:47,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 14:36:47,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 14:36:47,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:36:47,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-07 14:36:47,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:36:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 14:36:47,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 14:36:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184484418] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:47,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:47,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-02-07 14:36:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692724041] [2024-02-07 14:36:47,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:47,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-07 14:36:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-07 14:36:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-02-07 14:36:47,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2024-02-07 14:36:47,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 194 flow. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:47,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:47,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2024-02-07 14:36:47,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:50,203 INFO L124 PetriNetUnfolderBase]: 31195/42690 cut-off events. [2024-02-07 14:36:50,203 INFO L125 PetriNetUnfolderBase]: For 2782/2782 co-relation queries the response was YES. [2024-02-07 14:36:50,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87925 conditions, 42690 events. 31195/42690 cut-off events. For 2782/2782 co-relation queries the response was YES. Maximal size of possible extension queue 2874. Compared 289986 event pairs, 31190 based on Foata normal form. 0/28640 useless extension candidates. Maximal degree in co-relation 87914. Up to 42408 conditions per place. [2024-02-07 14:36:50,407 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 48 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2024-02-07 14:36:50,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 348 flow [2024-02-07 14:36:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-07 14:36:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-07 14:36:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-02-07 14:36:50,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26814814814814814 [2024-02-07 14:36:50,409 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 194 flow. Second operand 9 states and 181 transitions. [2024-02-07 14:36:50,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 348 flow [2024-02-07 14:36:50,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 71 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:36:50,413 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 240 flow [2024-02-07 14:36:50,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-02-07 14:36:50,414 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2024-02-07 14:36:50,414 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 240 flow [2024-02-07 14:36:50,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:50,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:50,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:36:50,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-07 14:36:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:50,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:50,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -849443628, now seen corresponding path program 1 times [2024-02-07 14:36:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126427688] [2024-02-07 14:36:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126427688] [2024-02-07 14:36:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126427688] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:36:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928255497] [2024-02-07 14:36:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:36:50,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:36:50,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 14:36:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:50,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 14:36:50,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:36:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:50,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928255497] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:50,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-07 14:36:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285807305] [2024-02-07 14:36:50,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:50,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-07 14:36:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-07 14:36:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-02-07 14:36:50,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2024-02-07 14:36:50,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:50,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:50,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2024-02-07 14:36:50,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:54,370 INFO L124 PetriNetUnfolderBase]: 39007/53730 cut-off events. [2024-02-07 14:36:54,370 INFO L125 PetriNetUnfolderBase]: For 4304/4304 co-relation queries the response was YES. [2024-02-07 14:36:54,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109946 conditions, 53730 events. 39007/53730 cut-off events. For 4304/4304 co-relation queries the response was YES. Maximal size of possible extension queue 3171. Compared 378245 event pairs, 39003 based on Foata normal form. 1298/37425 useless extension candidates. Maximal degree in co-relation 109933. Up to 31591 conditions per place. [2024-02-07 14:36:54,637 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 80 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-02-07 14:36:54,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 522 flow [2024-02-07 14:36:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 14:36:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 14:36:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-02-07 14:36:54,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2024-02-07 14:36:54,639 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 240 flow. Second operand 8 states and 196 transitions. [2024-02-07 14:36:54,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 522 flow [2024-02-07 14:36:54,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 457 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-02-07 14:36:54,644 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 243 flow [2024-02-07 14:36:54,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=243, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2024-02-07 14:36:54,645 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2024-02-07 14:36:54,645 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 243 flow [2024-02-07 14:36:54,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:36:54,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:54,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:36:54,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 14:36:54,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:36:54,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:54,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 395382333, now seen corresponding path program 1 times [2024-02-07 14:36:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940668820] [2024-02-07 14:36:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:36:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:36:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940668820] [2024-02-07 14:36:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940668820] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:36:54,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:36:54,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:36:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579743920] [2024-02-07 14:36:54,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:36:54,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:36:54,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:36:54,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:36:54,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2024-02-07 14:36:54,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 243 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 14:36:54,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:54,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2024-02-07 14:36:54,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:57,169 INFO L124 PetriNetUnfolderBase]: 29926/41385 cut-off events. [2024-02-07 14:36:57,169 INFO L125 PetriNetUnfolderBase]: For 5468/5468 co-relation queries the response was YES. [2024-02-07 14:36:57,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86511 conditions, 41385 events. 29926/41385 cut-off events. For 5468/5468 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 286535 event pairs, 29922 based on Foata normal form. 0/29586 useless extension candidates. Maximal degree in co-relation 86499. Up to 41011 conditions per place. [2024-02-07 14:36:57,339 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 54 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2024-02-07 14:36:57,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 67 transitions, 349 flow [2024-02-07 14:36:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:36:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:36:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-07 14:36:57,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43555555555555553 [2024-02-07 14:36:57,340 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 243 flow. Second operand 3 states and 98 transitions. [2024-02-07 14:36:57,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 67 transitions, 349 flow [2024-02-07 14:36:57,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 67 transitions, 341 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:36:57,344 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 233 flow [2024-02-07 14:36:57,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2024-02-07 14:36:57,345 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2024-02-07 14:36:57,345 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 233 flow [2024-02-07 14:36:57,346 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 14:36:57,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:36:57,346 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:36:57,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:36:57,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 14:36:57,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:36:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1212943115, now seen corresponding path program 2 times [2024-02-07 14:36:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:36:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110007626] [2024-02-07 14:36:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:36:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:36:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:36:57,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:36:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:36:57,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:36:57,401 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:36:57,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 32 remaining) [2024-02-07 14:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 32 remaining) [2024-02-07 14:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 32 remaining) [2024-02-07 14:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 32 remaining) [2024-02-07 14:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 32 remaining) [2024-02-07 14:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 32 remaining) [2024-02-07 14:36:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 32 remaining) [2024-02-07 14:36:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 32 remaining) [2024-02-07 14:36:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 32 remaining) [2024-02-07 14:36:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 32 remaining) [2024-02-07 14:36:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 32 remaining) [2024-02-07 14:36:57,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 32 remaining) [2024-02-07 14:36:57,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 32 remaining) [2024-02-07 14:36:57,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (18 of 32 remaining) [2024-02-07 14:36:57,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 32 remaining) [2024-02-07 14:36:57,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 32 remaining) [2024-02-07 14:36:57,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 32 remaining) [2024-02-07 14:36:57,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 32 remaining) [2024-02-07 14:36:57,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 32 remaining) [2024-02-07 14:36:57,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 32 remaining) [2024-02-07 14:36:57,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 32 remaining) [2024-02-07 14:36:57,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 32 remaining) [2024-02-07 14:36:57,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 32 remaining) [2024-02-07 14:36:57,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 32 remaining) [2024-02-07 14:36:57,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 32 remaining) [2024-02-07 14:36:57,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 32 remaining) [2024-02-07 14:36:57,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 32 remaining) [2024-02-07 14:36:57,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 32 remaining) [2024-02-07 14:36:57,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 32 remaining) [2024-02-07 14:36:57,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 32 remaining) [2024-02-07 14:36:57,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 32 remaining) [2024-02-07 14:36:57,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 32 remaining) [2024-02-07 14:36:57,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:36:57,409 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2024-02-07 14:36:57,415 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:36:57,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:36:57,437 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 14:36:57,445 INFO L503 ceAbstractionStarter]: Automizer considered 15 witness invariants [2024-02-07 14:36:57,446 INFO L504 ceAbstractionStarter]: WitnessConsidered=15 [2024-02-07 14:36:57,446 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:36:57 BasicIcfg [2024-02-07 14:36:57,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:36:57,447 INFO L158 Benchmark]: Toolchain (without parser) took 30664.77ms. Allocated memory was 176.2MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 121.4MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-02-07 14:36:57,447 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:36:57,448 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:36:57,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.32ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 105.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-02-07 14:36:57,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.38ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 102.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:36:57,448 INFO L158 Benchmark]: Boogie Preprocessor took 69.68ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 98.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 14:36:57,449 INFO L158 Benchmark]: RCFGBuilder took 1033.15ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 81.0MB in the end (delta: 17.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-02-07 14:36:57,449 INFO L158 Benchmark]: TraceAbstraction took 29076.60ms. Allocated memory was 176.2MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 80.3MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-02-07 14:36:57,452 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.32ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 105.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.38ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 102.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.68ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 98.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1033.15ms. Allocated memory is still 176.2MB. Free memory was 98.9MB in the beginning and 81.0MB in the end (delta: 17.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29076.60ms. Allocated memory was 176.2MB in the beginning and 14.1GB in the end (delta: 13.9GB). Free memory was 80.3MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 153]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] 0 int* x; [L42] 0 int i1, i2, t11, t21, t12, t22, s1, s2, n; [L108] 0 pthread_t t1, t2, t3, t4; [L111] 0 i1 = __VERIFIER_nondet_int() [L112] 0 i2 = __VERIFIER_nondet_int() [L113] 0 t11 = __VERIFIER_nondet_int() [L114] 0 t21 = __VERIFIER_nondet_int() [L115] 0 t12 = __VERIFIER_nondet_int() [L116] 0 t22 = __VERIFIER_nondet_int() [L117] 0 s1 = __VERIFIER_nondet_int() [L118] 0 s2 = __VERIFIER_nondet_int() [L119] 0 n = __VERIFIER_nondet_int() [L120] CALL 0 assume_abort_if_not(n < 2147483647) [L38] COND FALSE 0 !(!cond) [L120] RET 0 assume_abort_if_not(n < 2147483647) [L121] CALL, EXPR 0 create_fresh_int_array(n+1) [L142] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[size]]]] [L142] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(size >= 0) [L143] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[size]]]] [L143] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L143] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L145] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L146] 0 int i = 0; VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=0, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L146] COND TRUE 0 i < size VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=0, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L147] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L147] 0 arr[i] = __VERIFIER_nondet_int() [L146] 0 i++ VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=1, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L146] COND TRUE 0 i < size VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=1, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L147] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L147] 0 arr[i] = __VERIFIER_nondet_int() [L146] 0 i++ VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=2, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L146] COND FALSE 0 !(i < size) [L149] 0 return arr; [L121] RET, EXPR 0 create_fresh_int_array(n+1) [L121] 0 x = create_fresh_int_array(n+1) [L124] CALL 0 assume_abort_if_not( s1 == s2 && s1 == i1 && s1 == i2 && s1 == 0 ) [L38] COND FALSE 0 !(!cond) [L124] RET 0 assume_abort_if_not( s1 == s2 && s1 == i1 && s1 == i2 && s1 == 0 ) [L126] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [i1=0, i2=0, n=1, s1=0, s2=0, t11=0, t12=0, t1={7:0}, t21=0, t22=0, t2={6:0}, t3={3:0}, t4={5:0}, x={-2:0}] [L48] COND TRUE 1 __VERIFIER_nondet_bool() [L50] CALL 1 assume_abort_if_not( i1 < n ) [L38] COND FALSE 1 !(!cond) [L50] RET 1 assume_abort_if_not( i1 < n ) [L51] 1 i1++ [L52] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[i1]]]] [L52] EXPR 1 x[i1] [L52] 1 t11 = x[i1] [L55] CALL 1 plus(s1, t11) [L153] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, i1=1, i2=0, n=1, s1=0, s2=0, t11=0, t12=0, t21=0, t22=0, x={-2:0}] - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 143]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 136]: 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: 127]: 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: 128]: 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: 126]: 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: 129]: 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: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 111 locations, 32 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: 28.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 230 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1482 IncrementalHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 4 mSDtfsCounter, 1482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 131 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 549 SizeOfPredicates, 12 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 15/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:36:57,488 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