./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:33:15,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:33:15,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:33:15,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:33:15,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:33:15,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:33:15,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:33:15,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:33:15,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:33:15,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:33:15,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:33:15,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:33:15,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:33:15,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:33:15,296 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:33:15,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:33:15,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:33:15,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:33:15,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:33:15,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:33:15,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:33:15,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:33:15,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:33:15,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:33:15,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:33:15,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:33:15,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:33:15,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:33:15,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:33:15,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:33:15,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:33:15,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:33:15,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:33:15,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:33:15,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:33:15,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:33:15,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:33:15,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:33:15,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:33:15,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:33:15,303 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:33:15,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:33:15,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:33:15,304 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 19:33:15,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:33:15,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:33:15,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:33:15,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:33:15,595 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:33:15,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-07 19:33:16,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:33:17,012 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:33:17,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-07 19:33:17,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d1c293d/22e782e91aa14e43bb8ef46a55cef60e/FLAG9ef7cc3ad [2024-02-07 19:33:17,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d1c293d/22e782e91aa14e43bb8ef46a55cef60e [2024-02-07 19:33:17,048 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:33:17,048 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:33:17,049 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/arithmetic_prog_bad.yml/witness.yml [2024-02-07 19:33:17,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:33:17,144 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:33:17,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:33:17,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:33:17,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:33:17,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:33:17" (1/2) ... [2024-02-07 19:33:17,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d5e326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:17, skipping insertion in model container [2024-02-07 19:33:17,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:33:17" (1/2) ... [2024-02-07 19:33:17,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@776b2b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:33:17, skipping insertion in model container [2024-02-07 19:33:17,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:33:17" (2/2) ... [2024-02-07 19:33:17,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d5e326 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:33:17, skipping insertion in model container [2024-02-07 19:33:17,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:33:17" (2/2) ... [2024-02-07 19:33:17,156 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:33:17,214 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:33:17,216 INFO L76 edCorrectnessWitness]: Location invariant before [L882-L882] num == 0 [2024-02-07 19:33:17,216 INFO L76 edCorrectnessWitness]: Location invariant before [L885-L885] (0 == i && i == 0) || (1 <= i && i <= 2) [2024-02-07 19:33:17,216 INFO L76 edCorrectnessWitness]: Location invariant before [L917-L917] ((0 <= flag) && (flag <= 1)) && (flag == 0 || flag == 1) [2024-02-07 19:33:17,216 INFO L76 edCorrectnessWitness]: Location invariant before [L904-L904] ((0 <= flag) && (flag <= 1)) && (flag == 0 || flag == 1) [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L918-L918] ((0 <= flag) && (flag <= 1)) && (flag == 0 || flag == 1) [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L909-L909] num == 0 [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L896-L896] (0 == j && j == 0) || (1 <= j && j <= 2) [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L897-L897] num == 1 [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L898-L898] num == 0 [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L883-L883] num == 1 [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L902-L902] j == 3 [2024-02-07 19:33:17,217 INFO L76 edCorrectnessWitness]: Location invariant before [L900-L900] (0 == j && j == 0) || (1 <= j && j <= 2) [2024-02-07 19:33:17,218 INFO L76 edCorrectnessWitness]: Location invariant before [L910-L910] total == 0UL [2024-02-07 19:33:17,266 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:33:17,602 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-02-07 19:33:17,618 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:33:17,647 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:33:17,728 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-02-07 19:33:17,729 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:33:17,805 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:33:17,806 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:33:17 WrapperNode [2024-02-07 19:33:17,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:33:17,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:33:17,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:33:17,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:33:17,814 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,846 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,875 INFO L138 Inliner]: procedures = 244, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-02-07 19:33:17,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:33:17,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:33:17,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:33:17,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:33:17,886 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,886 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,898 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,920 INFO L175 MemorySlicer]: Split 15 memory accesses to 5 slices as follows [2, 1, 2, 2, 8]. 53 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 0, 8]. The 2 writes are split as follows [0, 0, 1, 1, 0]. [2024-02-07 19:33:17,923 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,925 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,935 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,941 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,951 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,957 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:33:17,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:33:17,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:33:17,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:33:17,968 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 07:33:17" (1/1) ... [2024-02-07 19:33:17,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:33:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:17,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 19:33:18,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 19:33:18,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:33:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:33:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-02-07 19:33:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-02-07 19:33:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-02-07 19:33:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-02-07 19:33:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-02-07 19:33:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 19:33:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:33:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:33:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:33:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:33:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:33:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:33:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:33:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 19:33:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 19:33:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:33:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:33:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:33:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:33:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:33:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 19:33:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:33:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:33:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:33:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:33:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:33:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:33:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:33:18,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:33:18,044 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:33:18,233 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:33:18,235 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:33:18,505 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:33:18,505 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:33:18,634 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:33:18,634 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 19:33:18,635 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:33:18 BoogieIcfgContainer [2024-02-07 19:33:18,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:33:18,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:33:18,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:33:18,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:33:18,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:33:17" (1/4) ... [2024-02-07 19:33:18,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16c509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:33:18, skipping insertion in model container [2024-02-07 19:33:18,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:33:17" (2/4) ... [2024-02-07 19:33:18,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16c509 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:33:18, skipping insertion in model container [2024-02-07 19:33:18,641 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 07:33:17" (3/4) ... [2024-02-07 19:33:18,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16c509 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:33:18, skipping insertion in model container [2024-02-07 19:33:18,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:33:18" (4/4) ... [2024-02-07 19:33:18,643 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-02-07 19:33:18,659 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:33:18,659 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-02-07 19:33:18,660 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:33:18,704 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 19:33:18,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 146 flow [2024-02-07 19:33:18,769 INFO L124 PetriNetUnfolderBase]: 6/64 cut-off events. [2024-02-07 19:33:18,770 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 19:33:18,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 6/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2024-02-07 19:33:18,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 66 transitions, 146 flow [2024-02-07 19:33:18,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 60 transitions, 132 flow [2024-02-07 19:33:18,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:33:18,794 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;@3eaabf3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:33:18,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-02-07 19:33:18,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:33:18,798 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 19:33:18,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:33:18,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:18,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 19:33:18,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:18,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 12757, now seen corresponding path program 1 times [2024-02-07 19:33:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063923426] [2024-02-07 19:33:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063923426] [2024-02-07 19:33:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063923426] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:33:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4018559] [2024-02-07 19:33:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:19,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:19,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:19,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-02-07 19:33:19,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:19,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:19,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-02-07 19:33:19,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:19,456 INFO L124 PetriNetUnfolderBase]: 971/1916 cut-off events. [2024-02-07 19:33:19,456 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-02-07 19:33:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3597 conditions, 1916 events. 971/1916 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 10261 event pairs, 314 based on Foata normal form. 22/1784 useless extension candidates. Maximal degree in co-relation 3305. Up to 886 conditions per place. [2024-02-07 19:33:19,470 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 57 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-02-07 19:33:19,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 313 flow [2024-02-07 19:33:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-07 19:33:19,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2024-02-07 19:33:19,483 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 132 flow. Second operand 3 states and 146 transitions. [2024-02-07 19:33:19,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 313 flow [2024-02-07 19:33:19,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 299 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 19:33:19,490 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 164 flow [2024-02-07 19:33:19,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-02-07 19:33:19,495 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-02-07 19:33:19,495 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 164 flow [2024-02-07 19:33:19,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:19,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:19,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-07 19:33:19,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:33:19,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:19,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash 395842, now seen corresponding path program 1 times [2024-02-07 19:33:19,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951968431] [2024-02-07 19:33:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:19,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951968431] [2024-02-07 19:33:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951968431] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:19,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:33:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946228854] [2024-02-07 19:33:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:19,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:19,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 19:33:19,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:19,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:19,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 19:33:19,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:19,953 INFO L124 PetriNetUnfolderBase]: 1113/2371 cut-off events. [2024-02-07 19:33:19,953 INFO L125 PetriNetUnfolderBase]: For 289/308 co-relation queries the response was YES. [2024-02-07 19:33:19,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 2371 events. 1113/2371 cut-off events. For 289/308 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 14026 event pairs, 397 based on Foata normal form. 2/2306 useless extension candidates. Maximal degree in co-relation 1636. Up to 1069 conditions per place. [2024-02-07 19:33:19,966 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-02-07 19:33:19,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 317 flow [2024-02-07 19:33:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2024-02-07 19:33:19,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7323232323232324 [2024-02-07 19:33:19,973 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 164 flow. Second operand 3 states and 145 transitions. [2024-02-07 19:33:19,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 317 flow [2024-02-07 19:33:19,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:33:19,980 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 169 flow [2024-02-07 19:33:19,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-02-07 19:33:19,981 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-02-07 19:33:19,982 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 169 flow [2024-02-07 19:33:19,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:19,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:19,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:19,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:33:19,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:19,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 993777905, now seen corresponding path program 1 times [2024-02-07 19:33:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385010893] [2024-02-07 19:33:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385010893] [2024-02-07 19:33:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385010893] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:20,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:20,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:33:20,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443983170] [2024-02-07 19:33:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:20,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:20,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:20,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 19:33:20,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:20,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:20,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 19:33:20,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:20,409 INFO L124 PetriNetUnfolderBase]: 1276/2735 cut-off events. [2024-02-07 19:33:20,410 INFO L125 PetriNetUnfolderBase]: For 149/171 co-relation queries the response was YES. [2024-02-07 19:33:20,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5380 conditions, 2735 events. 1276/2735 cut-off events. For 149/171 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 15921 event pairs, 653 based on Foata normal form. 48/2667 useless extension candidates. Maximal degree in co-relation 1971. Up to 1351 conditions per place. [2024-02-07 19:33:20,424 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 53 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-02-07 19:33:20,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 323 flow [2024-02-07 19:33:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-02-07 19:33:20,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7525252525252525 [2024-02-07 19:33:20,427 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 169 flow. Second operand 3 states and 149 transitions. [2024-02-07 19:33:20,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 323 flow [2024-02-07 19:33:20,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 319 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:20,432 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 176 flow [2024-02-07 19:33:20,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-02-07 19:33:20,433 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-02-07 19:33:20,433 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 176 flow [2024-02-07 19:33:20,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:20,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:20,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:20,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:33:20,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:20,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1770281536, now seen corresponding path program 1 times [2024-02-07 19:33:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148539626] [2024-02-07 19:33:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148539626] [2024-02-07 19:33:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148539626] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:33:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901361471] [2024-02-07 19:33:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:33:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:33:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:33:20,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-02-07 19:33:20,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:20,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:20,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-02-07 19:33:20,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:20,839 INFO L124 PetriNetUnfolderBase]: 1204/2451 cut-off events. [2024-02-07 19:33:20,840 INFO L125 PetriNetUnfolderBase]: For 426/447 co-relation queries the response was YES. [2024-02-07 19:33:20,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5244 conditions, 2451 events. 1204/2451 cut-off events. For 426/447 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13314 event pairs, 471 based on Foata normal form. 169/2604 useless extension candidates. Maximal degree in co-relation 1842. Up to 1174 conditions per place. [2024-02-07 19:33:20,852 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 58 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-02-07 19:33:20,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 337 flow [2024-02-07 19:33:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:33:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:33:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-02-07 19:33:20,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-02-07 19:33:20,855 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 176 flow. Second operand 4 states and 159 transitions. [2024-02-07 19:33:20,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 337 flow [2024-02-07 19:33:20,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:20,857 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 168 flow [2024-02-07 19:33:20,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2024-02-07 19:33:20,858 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-02-07 19:33:20,859 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 168 flow [2024-02-07 19:33:20,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:20,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:20,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:20,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:33:20,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:20,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -553374438, now seen corresponding path program 1 times [2024-02-07 19:33:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:20,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673919108] [2024-02-07 19:33:20,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673919108] [2024-02-07 19:33:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673919108] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:20,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:33:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151856308] [2024-02-07 19:33:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:20,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:20,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2024-02-07 19:33:20,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:20,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:20,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2024-02-07 19:33:20,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:21,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L895-6-->L894-2: Formula: (not (= v_~num~0_In_1 0)) InVars {~num~0=v_~num~0_In_1} OutVars{~num~0=v_~num~0_In_1} AuxVars[] AssignedVars[][41], [14#L915-1true, 77#(= ~total~0 0), 88#true, 28#L881true, Black: 72#(= ~num~0 0), 86#(= ~num~0 1), 81#(= thread2Thread1of1ForFork1_~j~0 0), 55#L894-2true]) [2024-02-07 19:33:21,056 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-07 19:33:21,057 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-07 19:33:21,057 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-07 19:33:21,057 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-07 19:33:21,163 INFO L124 PetriNetUnfolderBase]: 1003/2188 cut-off events. [2024-02-07 19:33:21,164 INFO L125 PetriNetUnfolderBase]: For 453/473 co-relation queries the response was YES. [2024-02-07 19:33:21,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4648 conditions, 2188 events. 1003/2188 cut-off events. For 453/473 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12486 event pairs, 517 based on Foata normal form. 10/2099 useless extension candidates. Maximal degree in co-relation 2143. Up to 1461 conditions per place. [2024-02-07 19:33:21,177 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 52 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-02-07 19:33:21,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 339 flow [2024-02-07 19:33:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-02-07 19:33:21,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-02-07 19:33:21,179 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 168 flow. Second operand 3 states and 150 transitions. [2024-02-07 19:33:21,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 339 flow [2024-02-07 19:33:21,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 329 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:33:21,182 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 176 flow [2024-02-07 19:33:21,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-02-07 19:33:21,183 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-02-07 19:33:21,184 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 176 flow [2024-02-07 19:33:21,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:21,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:21,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:21,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:33:21,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:21,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2142617125, now seen corresponding path program 1 times [2024-02-07 19:33:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:21,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878635254] [2024-02-07 19:33:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:21,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878635254] [2024-02-07 19:33:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878635254] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:21,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:33:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472394265] [2024-02-07 19:33:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:21,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:21,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:21,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2024-02-07 19:33:21,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:21,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:21,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2024-02-07 19:33:21,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:21,444 INFO L124 PetriNetUnfolderBase]: 477/1145 cut-off events. [2024-02-07 19:33:21,444 INFO L125 PetriNetUnfolderBase]: For 296/338 co-relation queries the response was YES. [2024-02-07 19:33:21,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 1145 events. 477/1145 cut-off events. For 296/338 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5608 event pairs, 184 based on Foata normal form. 70/1190 useless extension candidates. Maximal degree in co-relation 1951. Up to 449 conditions per place. [2024-02-07 19:33:21,450 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 41 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2024-02-07 19:33:21,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 316 flow [2024-02-07 19:33:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-02-07 19:33:21,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2024-02-07 19:33:21,452 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 176 flow. Second operand 3 states and 147 transitions. [2024-02-07 19:33:21,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 316 flow [2024-02-07 19:33:21,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 308 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:21,454 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 178 flow [2024-02-07 19:33:21,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-02-07 19:33:21,455 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-02-07 19:33:21,455 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 178 flow [2024-02-07 19:33:21,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:21,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:21,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:21,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:33:21,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:21,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1820565097, now seen corresponding path program 1 times [2024-02-07 19:33:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021901480] [2024-02-07 19:33:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:21,516 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 19:33:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021901480] [2024-02-07 19:33:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021901480] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:33:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733277239] [2024-02-07 19:33:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:21,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:21,519 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 19:33:21,536 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 19:33:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:21,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 19:33:21,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:33:21,697 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 19:33:21,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:33:21,720 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 19:33:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733277239] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:33:21,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:33:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 19:33:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262951396] [2024-02-07 19:33:21,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:33:21,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:33:21,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:33:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:33:21,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2024-02-07 19:33:21,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:21,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:21,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2024-02-07 19:33:21,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:22,006 INFO L124 PetriNetUnfolderBase]: 889/1934 cut-off events. [2024-02-07 19:33:22,006 INFO L125 PetriNetUnfolderBase]: For 763/817 co-relation queries the response was YES. [2024-02-07 19:33:22,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 1934 events. 889/1934 cut-off events. For 763/817 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8832 event pairs, 165 based on Foata normal form. 64/1932 useless extension candidates. Maximal degree in co-relation 1574. Up to 400 conditions per place. [2024-02-07 19:33:22,017 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 94 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2024-02-07 19:33:22,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 628 flow [2024-02-07 19:33:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:33:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:33:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2024-02-07 19:33:22,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2024-02-07 19:33:22,026 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 178 flow. Second operand 6 states and 282 transitions. [2024-02-07 19:33:22,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 628 flow [2024-02-07 19:33:22,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:22,031 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 220 flow [2024-02-07 19:33:22,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-02-07 19:33:22,032 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 8 predicate places. [2024-02-07 19:33:22,032 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 220 flow [2024-02-07 19:33:22,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:22,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:22,033 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:22,052 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 19:33:22,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:22,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:22,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash -163709015, now seen corresponding path program 1 times [2024-02-07 19:33:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064130960] [2024-02-07 19:33:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:22,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:22,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064130960] [2024-02-07 19:33:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064130960] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:33:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183946048] [2024-02-07 19:33:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:22,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:22,369 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 19:33:22,387 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 19:33:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:22,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-07 19:33:22,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:33:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:22,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-07 19:33:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183946048] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-07 19:33:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-02-07 19:33:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676928902] [2024-02-07 19:33:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:22,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:33:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:33:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:33:22,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 19:33:22,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:22,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:22,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 19:33:22,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:22,833 INFO L124 PetriNetUnfolderBase]: 847/1872 cut-off events. [2024-02-07 19:33:22,833 INFO L125 PetriNetUnfolderBase]: For 1160/1178 co-relation queries the response was YES. [2024-02-07 19:33:22,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 1872 events. 847/1872 cut-off events. For 1160/1178 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8620 event pairs, 165 based on Foata normal form. 0/1866 useless extension candidates. Maximal degree in co-relation 2295. Up to 750 conditions per place. [2024-02-07 19:33:22,844 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 74 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-02-07 19:33:22,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 536 flow [2024-02-07 19:33:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:33:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:33:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-02-07 19:33:22,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-02-07 19:33:22,846 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 220 flow. Second operand 5 states and 228 transitions. [2024-02-07 19:33:22,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 536 flow [2024-02-07 19:33:22,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 513 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-02-07 19:33:22,850 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 217 flow [2024-02-07 19:33:22,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-02-07 19:33:22,851 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2024-02-07 19:33:22,851 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 217 flow [2024-02-07 19:33:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:22,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:22,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:22,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 19:33:23,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-02-07 19:33:23,070 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:23,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1812703636, now seen corresponding path program 1 times [2024-02-07 19:33:23,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:23,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60006343] [2024-02-07 19:33:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:23,151 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 19:33:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60006343] [2024-02-07 19:33:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60006343] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:33:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436851506] [2024-02-07 19:33:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:23,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:23,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:33:23,153 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 19:33:23,169 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 19:33:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:23,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-07 19:33:23,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:33:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:33:23,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-07 19:33:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436851506] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-07 19:33:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-02-07 19:33:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924527992] [2024-02-07 19:33:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:33:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:33:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:33:23,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2024-02-07 19:33:23,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:23,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:23,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2024-02-07 19:33:23,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:23,563 INFO L124 PetriNetUnfolderBase]: 793/1786 cut-off events. [2024-02-07 19:33:23,564 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2024-02-07 19:33:23,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 1786 events. 793/1786 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8205 event pairs, 115 based on Foata normal form. 76/1852 useless extension candidates. Maximal degree in co-relation 2271. Up to 620 conditions per place. [2024-02-07 19:33:23,571 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 68 selfloop transitions, 6 changer transitions 6/100 dead transitions. [2024-02-07 19:33:23,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 519 flow [2024-02-07 19:33:23,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:33:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:33:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-02-07 19:33:23,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2024-02-07 19:33:23,573 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 217 flow. Second operand 5 states and 227 transitions. [2024-02-07 19:33:23,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 519 flow [2024-02-07 19:33:23,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 505 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 19:33:23,576 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 215 flow [2024-02-07 19:33:23,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-02-07 19:33:23,577 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2024-02-07 19:33:23,577 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 215 flow [2024-02-07 19:33:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:23,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:23,578 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:23,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 19:33:23,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:33:23,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:23,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -459714941, now seen corresponding path program 1 times [2024-02-07 19:33:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342290343] [2024-02-07 19:33:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-02-07 19:33:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342290343] [2024-02-07 19:33:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342290343] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:33:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007106871] [2024-02-07 19:33:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:23,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:33:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:33:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:33:23,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 19:33:23,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:23,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:23,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 19:33:23,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:24,162 INFO L124 PetriNetUnfolderBase]: 811/1776 cut-off events. [2024-02-07 19:33:24,162 INFO L125 PetriNetUnfolderBase]: For 1710/1714 co-relation queries the response was YES. [2024-02-07 19:33:24,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 1776 events. 811/1776 cut-off events. For 1710/1714 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7881 event pairs, 147 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 2393. Up to 934 conditions per place. [2024-02-07 19:33:24,172 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 63 selfloop transitions, 7 changer transitions 3/92 dead transitions. [2024-02-07 19:33:24,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 481 flow [2024-02-07 19:33:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:33:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:33:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2024-02-07 19:33:24,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2024-02-07 19:33:24,174 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 215 flow. Second operand 5 states and 223 transitions. [2024-02-07 19:33:24,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 481 flow [2024-02-07 19:33:24,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:33:24,177 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 224 flow [2024-02-07 19:33:24,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2024-02-07 19:33:24,179 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2024-02-07 19:33:24,179 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 224 flow [2024-02-07 19:33:24,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:24,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:24,180 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:24,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:33:24,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:24,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -439565505, now seen corresponding path program 1 times [2024-02-07 19:33:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876398105] [2024-02-07 19:33:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:33:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-02-07 19:33:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:33:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876398105] [2024-02-07 19:33:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876398105] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:33:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:33:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:33:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82496856] [2024-02-07 19:33:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:33:24,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:33:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:33:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:33:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:33:24,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2024-02-07 19:33:24,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:24,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:33:24,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2024-02-07 19:33:24,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:33:24,452 INFO L124 PetriNetUnfolderBase]: 659/1532 cut-off events. [2024-02-07 19:33:24,452 INFO L125 PetriNetUnfolderBase]: For 2003/2003 co-relation queries the response was YES. [2024-02-07 19:33:24,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 1532 events. 659/1532 cut-off events. For 2003/2003 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6873 event pairs, 459 based on Foata normal form. 4/1528 useless extension candidates. Maximal degree in co-relation 2042. Up to 1061 conditions per place. [2024-02-07 19:33:24,459 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 44 selfloop transitions, 1 changer transitions 1/65 dead transitions. [2024-02-07 19:33:24,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 347 flow [2024-02-07 19:33:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:33:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:33:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2024-02-07 19:33:24,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-07 19:33:24,461 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 224 flow. Second operand 3 states and 132 transitions. [2024-02-07 19:33:24,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 65 transitions, 347 flow [2024-02-07 19:33:24,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 331 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-07 19:33:24,465 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 204 flow [2024-02-07 19:33:24,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2024-02-07 19:33:24,465 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2024-02-07 19:33:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 204 flow [2024-02-07 19:33:24,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:33:24,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:33:24,466 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:24,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:33:24,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 19:33:24,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:33:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -169475451, now seen corresponding path program 1 times [2024-02-07 19:33:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:33:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629591681] [2024-02-07 19:33:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:33:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:33:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:33:24,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:33:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:33:24,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:33:24,595 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:33:24,596 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (24 of 25 remaining) [2024-02-07 19:33:24,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 25 remaining) [2024-02-07 19:33:24,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 25 remaining) [2024-02-07 19:33:24,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 25 remaining) [2024-02-07 19:33:24,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 25 remaining) [2024-02-07 19:33:24,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 25 remaining) [2024-02-07 19:33:24,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 25 remaining) [2024-02-07 19:33:24,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 25 remaining) [2024-02-07 19:33:24,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 25 remaining) [2024-02-07 19:33:24,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 25 remaining) [2024-02-07 19:33:24,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 25 remaining) [2024-02-07 19:33:24,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 25 remaining) [2024-02-07 19:33:24,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 25 remaining) [2024-02-07 19:33:24,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 25 remaining) [2024-02-07 19:33:24,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 25 remaining) [2024-02-07 19:33:24,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 25 remaining) [2024-02-07 19:33:24,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 25 remaining) [2024-02-07 19:33:24,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 25 remaining) [2024-02-07 19:33:24,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 25 remaining) [2024-02-07 19:33:24,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 25 remaining) [2024-02-07 19:33:24,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 25 remaining) [2024-02-07 19:33:24,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 25 remaining) [2024-02-07 19:33:24,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 25 remaining) [2024-02-07 19:33:24,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 25 remaining) [2024-02-07 19:33:24,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 25 remaining) [2024-02-07 19:33:24,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:33:24,602 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:33:24,608 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:33:24,608 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:33:24,708 INFO L503 ceAbstractionStarter]: Automizer considered 13 witness invariants [2024-02-07 19:33:24,708 INFO L504 ceAbstractionStarter]: WitnessConsidered=13 [2024-02-07 19:33:24,710 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:33:24 BasicIcfg [2024-02-07 19:33:24,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:33:24,710 INFO L158 Benchmark]: Toolchain (without parser) took 7565.93ms. Allocated memory was 138.4MB in the beginning and 295.7MB in the end (delta: 157.3MB). Free memory was 83.7MB in the beginning and 90.5MB in the end (delta: -6.8MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. [2024-02-07 19:33:24,710 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory was 99.2MB in the beginning and 99.1MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:33:24,710 INFO L158 Benchmark]: Witness Parser took 0.07ms. Allocated memory is still 138.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:33:24,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.66ms. Allocated memory was 138.4MB in the beginning and 220.2MB in the end (delta: 81.8MB). Free memory was 83.5MB in the beginning and 182.4MB in the end (delta: -98.9MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-02-07 19:33:24,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.75ms. Allocated memory is still 220.2MB. Free memory was 181.3MB in the beginning and 179.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:33:24,711 INFO L158 Benchmark]: Boogie Preprocessor took 88.43ms. Allocated memory is still 220.2MB. Free memory was 179.2MB in the beginning and 175.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:33:24,711 INFO L158 Benchmark]: RCFGBuilder took 669.33ms. Allocated memory is still 220.2MB. Free memory was 175.6MB in the beginning and 128.9MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-02-07 19:33:24,712 INFO L158 Benchmark]: TraceAbstraction took 6072.73ms. Allocated memory was 220.2MB in the beginning and 295.7MB in the end (delta: 75.5MB). Free memory was 127.8MB in the beginning and 90.5MB in the end (delta: 37.3MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-02-07 19:33:24,713 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 138.4MB. Free memory was 99.2MB in the beginning and 99.1MB in the end (delta: 88.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.07ms. Allocated memory is still 138.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.66ms. Allocated memory was 138.4MB in the beginning and 220.2MB in the end (delta: 81.8MB). Free memory was 83.5MB in the beginning and 182.4MB in the end (delta: -98.9MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.75ms. Allocated memory is still 220.2MB. Free memory was 181.3MB in the beginning and 179.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.43ms. Allocated memory is still 220.2MB. Free memory was 179.2MB in the beginning and 175.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 669.33ms. Allocated memory is still 220.2MB. Free memory was 175.6MB in the beginning and 128.9MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6072.73ms. Allocated memory was 220.2MB in the beginning and 295.7MB in the end (delta: 75.5MB). Free memory was 127.8MB in the beginning and 90.5MB in the end (delta: 37.3MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 VAL [flag=0, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=0] [L909] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L909] 0 total = 0 VAL [flag=0, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=0] [L910] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]]] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, flag=0, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=1] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1={5:0}, t2={6:0}, total=1] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L896] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]]]] [L902] 2 total = total + j [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[flag]],BinaryExpression[COMPLEQ,IdentifierExpression[flag],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[1]]]]]] [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=6] [L917] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[flag]],BinaryExpression[COMPLEQ,IdentifierExpression[flag],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[1]]]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=6] [L918] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[flag]],BinaryExpression[COMPLEQ,IdentifierExpression[flag],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[1]]]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1={5:0}, t2={6:0}, total=6] - UnprovableResult [Line: 882]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 896]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 898]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 900]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 909]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 910]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 914]: 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: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 101 locations, 25 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 416 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1159 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 20 mSDtfsCounter, 1159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=10, 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.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 133/157 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:33:24,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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