./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/parallel-parallel-sum-1.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/weaver/parallel-parallel-sum-1.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/parallel-parallel-sum-1.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:14:43,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:14:43,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:14:43,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:14:43,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:14:43,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:14:43,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:14:43,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:14:43,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:14:43,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:14:43,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:14:43,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:14:43,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:14:43,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:14:43,257 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:14:43,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:14:43,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:14:43,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:14:43,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:14:43,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:14:43,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:14:43,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:14:43,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:14:43,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:14:43,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:14:43,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:14:43,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:14:43,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:14:43,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:14:43,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:14:43,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:14:43,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:14:43,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:14:43,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:14:43,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:14:43,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:14:43,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:14:43,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:14:43,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:14:43,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:14:43,263 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:14:43,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:14:43,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:14:43,264 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:14:43,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:14:43,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:14:43,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:14:43,500 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:14:43,501 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:14:43,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/parallel-parallel-sum-1.wvr.yml/witness.yml [2024-02-07 19:14:43,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:14:43,569 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:14:43,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2024-02-07 19:14:44,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:14:44,809 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:14:44,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2024-02-07 19:14:44,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f200332ae/1fdd51f4d03047aab086e4947b3d72d3/FLAG0fe3d416e [2024-02-07 19:14:44,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f200332ae/1fdd51f4d03047aab086e4947b3d72d3 [2024-02-07 19:14:44,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:14:44,831 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:14:44,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:14:44,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:14:44,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:14:44,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:14:43" (1/2) ... [2024-02-07 19:14:44,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a6b422 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:14:44, skipping insertion in model container [2024-02-07 19:14:44,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:14:43" (1/2) ... [2024-02-07 19:14:44,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10f68c12 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:14:44, skipping insertion in model container [2024-02-07 19:14:44,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:14:44" (2/2) ... [2024-02-07 19:14:44,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a6b422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:44, skipping insertion in model container [2024-02-07 19:14:44,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:14:44" (2/2) ... [2024-02-07 19:14:44,839 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:14:44,859 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L67-L67] -2147483647 <= i1 [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L97-L97] -2147483647 <= i2 [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L142-L142] -2147483647 <= size [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L143-L143] -2147483647 <= size [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L52-L52] -2147483647 <= i1 [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L154-L154] (1 <= b) && (b != 0) [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L147-L147] ((((((((8 <= i && i <= 2147483646) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-07 19:14:44,860 INFO L76 edCorrectnessWitness]: Location invariant before [L82-L82] -2147483647 <= i2 [2024-02-07 19:14:44,861 INFO L76 edCorrectnessWitness]: Location invariant before [L153-L153] (b <= -1) && (b != 0) [2024-02-07 19:14:44,879 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:14:45,035 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2024-02-07 19:14:45,050 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:14:45,057 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:14:45,113 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:14:45,125 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:14:45,138 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:14:45,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45 WrapperNode [2024-02-07 19:14:45,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:14:45,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:14:45,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:14:45,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:14:45,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,185 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 330 [2024-02-07 19:14:45,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:14:45,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:14:45,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:14:45,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:14:45,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,232 INFO L175 MemorySlicer]: Split 15 memory accesses to 6 slices as follows [2, 2, 2, 2, 5, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 1, 1, 1]. [2024-02-07 19:14:45,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:14:45,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:14:45,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:14:45,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:14:45,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (1/1) ... [2024-02-07 19:14:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:14:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:14:45,293 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:14:45,295 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:14:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:14:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:14:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:14:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:14:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:14:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:14:45,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:14:45,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-07 19:14:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:14:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:14:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:14:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:14:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:14:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-07 19:14:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 19:14:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 19:14:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 19:14:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 19:14:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 19:14:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 19:14:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 19:14:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 19:14:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:14:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:14:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:14:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:14:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:14:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-07 19:14:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:14:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:14:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-07 19:14:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:14:45,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:14:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:14:45,398 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:14:45,505 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:14:45,506 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:14:45,797 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:14:45,797 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:14:46,163 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:14:46,163 INFO L320 CfgBuilder]: Removed 5 assume(true) statements. [2024-02-07 19:14:46,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:14:46 BoogieIcfgContainer [2024-02-07 19:14:46,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:14:46,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:14:46,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:14:46,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:14:46,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:14:43" (1/4) ... [2024-02-07 19:14:46,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d899 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:14:46, skipping insertion in model container [2024-02-07 19:14:46,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:14:44" (2/4) ... [2024-02-07 19:14:46,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:14:46, skipping insertion in model container [2024-02-07 19:14:46,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:14:45" (3/4) ... [2024-02-07 19:14:46,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:14:46, skipping insertion in model container [2024-02-07 19:14:46,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:14:46" (4/4) ... [2024-02-07 19:14:46,172 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2024-02-07 19:14:46,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:14:46,186 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-02-07 19:14:46,186 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:14:46,246 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 19:14:46,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 75 transitions, 178 flow [2024-02-07 19:14:46,290 INFO L124 PetriNetUnfolderBase]: 9/71 cut-off events. [2024-02-07 19:14:46,291 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 19:14:46,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 71 events. 9/71 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 150 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-02-07 19:14:46,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 75 transitions, 178 flow [2024-02-07 19:14:46,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 70 transitions, 164 flow [2024-02-07 19:14:46,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:14:46,307 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;@4b019ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:14:46,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-02-07 19:14:46,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:14:46,310 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 19:14:46,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:14:46,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:14:46,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 19:14:46,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:14:46,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:14:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 1 times [2024-02-07 19:14:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:14:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391297702] [2024-02-07 19:14:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:14:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:46,490 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:14:46,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:14:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391297702] [2024-02-07 19:14:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391297702] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:14:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:14:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:14:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726654312] [2024-02-07 19:14:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:14:46,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:14:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:14:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:14:46,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 75 [2024-02-07 19:14:46,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:46,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:46,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 75 [2024-02-07 19:14:46,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:14:49,326 INFO L124 PetriNetUnfolderBase]: 30430/41281 cut-off events. [2024-02-07 19:14:49,326 INFO L125 PetriNetUnfolderBase]: For 1983/1983 co-relation queries the response was YES. [2024-02-07 19:14:49,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84006 conditions, 41281 events. 30430/41281 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 3077. Compared 271236 event pairs, 30429 based on Foata normal form. 4730/30562 useless extension candidates. Maximal degree in co-relation 75206. Up to 40961 conditions per place. [2024-02-07 19:14:49,712 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 47 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-02-07 19:14:49,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 60 transitions, 242 flow [2024-02-07 19:14:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:14:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:14:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 19:14:49,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2024-02-07 19:14:49,725 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 164 flow. Second operand 3 states and 104 transitions. [2024-02-07 19:14:49,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 60 transitions, 242 flow [2024-02-07 19:14:49,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 226 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-07 19:14:49,811 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 132 flow [2024-02-07 19:14:49,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-02-07 19:14:49,815 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2024-02-07 19:14:49,815 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 132 flow [2024-02-07 19:14:49,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:49,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:14:49,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 19:14:49,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:14:49,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:14:49,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:14:49,817 INFO L85 PathProgramCache]: Analyzing trace with hash 892396036, now seen corresponding path program 1 times [2024-02-07 19:14:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:14:49,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931396368] [2024-02-07 19:14:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:14:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:49,871 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:14:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:14:49,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931396368] [2024-02-07 19:14:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931396368] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:14:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:14:49,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:14:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797037713] [2024-02-07 19:14:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:14:49,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:14:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:14:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:14:49,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 19:14:49,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:49,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:49,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 19:14:49,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:14:52,157 INFO L124 PetriNetUnfolderBase]: 30431/41284 cut-off events. [2024-02-07 19:14:52,158 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2024-02-07 19:14:52,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82842 conditions, 41284 events. 30431/41284 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 3077. Compared 271369 event pairs, 30429 based on Foata normal form. 0/25834 useless extension candidates. Maximal degree in co-relation 82818. Up to 40967 conditions per place. [2024-02-07 19:14:52,379 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-02-07 19:14:52,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 242 flow [2024-02-07 19:14:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:14:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:14:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-07 19:14:52,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2024-02-07 19:14:52,383 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 132 flow. Second operand 3 states and 101 transitions. [2024-02-07 19:14:52,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 242 flow [2024-02-07 19:14:52,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:14:52,386 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 147 flow [2024-02-07 19:14:52,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-02-07 19:14:52,387 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2024-02-07 19:14:52,388 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 147 flow [2024-02-07 19:14:52,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:52,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:14:52,388 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-02-07 19:14:52,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:14:52,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:14:52,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:14:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1400838909, now seen corresponding path program 1 times [2024-02-07 19:14:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:14:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59019896] [2024-02-07 19:14:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:14:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:14:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59019896] [2024-02-07 19:14:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59019896] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:14:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826266495] [2024-02-07 19:14:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:14:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:14:52,501 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:14:52,517 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:14:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:52,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 19:14:52,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:14:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:52,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:14:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:52,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826266495] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:14:52,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:14:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-02-07 19:14:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623437350] [2024-02-07 19:14:52,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:14:52,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:14:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:52,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:14:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:14:52,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 19:14:52,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:52,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:52,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 19:14:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:14:54,742 INFO L124 PetriNetUnfolderBase]: 30432/41287 cut-off events. [2024-02-07 19:14:54,742 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2024-02-07 19:14:54,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82855 conditions, 41287 events. 30432/41287 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 3077. Compared 271143 event pairs, 30429 based on Foata normal form. 0/25837 useless extension candidates. Maximal degree in co-relation 82818. Up to 40968 conditions per place. [2024-02-07 19:14:54,887 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 49 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2024-02-07 19:14:54,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 263 flow [2024-02-07 19:14:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:14:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:14:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-02-07 19:14:54,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2024-02-07 19:14:54,889 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 147 flow. Second operand 4 states and 119 transitions. [2024-02-07 19:14:54,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 263 flow [2024-02-07 19:14:54,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:14:54,892 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 171 flow [2024-02-07 19:14:54,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-02-07 19:14:54,893 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2024-02-07 19:14:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 171 flow [2024-02-07 19:14:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:14:54,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:14:54,905 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:14:55,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:14:55,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:14:55,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:14:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1789290326, now seen corresponding path program 1 times [2024-02-07 19:14:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:14:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164033698] [2024-02-07 19:14:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:55,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:14:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:55,166 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:14:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:14:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164033698] [2024-02-07 19:14:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164033698] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:14:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:14:55,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:14:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298838126] [2024-02-07 19:14:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:14:55,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:14:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:14:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:14:55,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2024-02-07 19:14:55,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:55,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:55,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2024-02-07 19:14:55,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:14:56,673 INFO L124 PetriNetUnfolderBase]: 23380/31837 cut-off events. [2024-02-07 19:14:56,674 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-02-07 19:14:56,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63905 conditions, 31837 events. 23380/31837 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 205320 event pairs, 23377 based on Foata normal form. 0/21217 useless extension candidates. Maximal degree in co-relation 63873. Up to 31596 conditions per place. [2024-02-07 19:14:56,959 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 50 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2024-02-07 19:14:56,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2024-02-07 19:14:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:14:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:14:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 19:14:56,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-07 19:14:56,961 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 171 flow. Second operand 3 states and 100 transitions. [2024-02-07 19:14:56,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2024-02-07 19:14:56,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-02-07 19:14:56,963 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 158 flow [2024-02-07 19:14:56,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-02-07 19:14:56,964 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2024-02-07 19:14:56,964 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 158 flow [2024-02-07 19:14:56,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:56,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:14:56,964 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-02-07 19:14:56,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:14:56,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:14:56,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:14:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1881398206, now seen corresponding path program 2 times [2024-02-07 19:14:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:14:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861039098] [2024-02-07 19:14:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:14:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:14:57,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861039098] [2024-02-07 19:14:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861039098] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:14:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119124769] [2024-02-07 19:14:57,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:14:57,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:14:57,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:14:57,063 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:14:57,065 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:14:57,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:14:57,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:14:57,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 19:14:57,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:14:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:57,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:14:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:14:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119124769] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:14:57,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:14:57,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-02-07 19:14:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798090046] [2024-02-07 19:14:57,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:14:57,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:14:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:14:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:14:57,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 19:14:57,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:57,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:57,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 19:14:57,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:14:58,693 INFO L124 PetriNetUnfolderBase]: 23381/31840 cut-off events. [2024-02-07 19:14:58,694 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2024-02-07 19:14:58,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63910 conditions, 31840 events. 23381/31840 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 205529 event pairs, 23377 based on Foata normal form. 0/21219 useless extension candidates. Maximal degree in co-relation 63902. Up to 31597 conditions per place. [2024-02-07 19:14:58,830 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 47 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2024-02-07 19:14:58,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 278 flow [2024-02-07 19:14:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:14:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:14:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-02-07 19:14:58,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-02-07 19:14:58,833 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 158 flow. Second operand 5 states and 135 transitions. [2024-02-07 19:14:58,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 278 flow [2024-02-07 19:14:58,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:14:58,834 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 192 flow [2024-02-07 19:14:58,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-02-07 19:14:58,835 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2024-02-07 19:14:58,835 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 192 flow [2024-02-07 19:14:58,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:58,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:14:58,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:14:58,846 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:14:59,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:14:59,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:14:59,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:14:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash 366575731, now seen corresponding path program 1 times [2024-02-07 19:14:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:14:59,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488143665] [2024-02-07 19:14:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:14:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:14:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:14:59,142 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:14:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:14:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488143665] [2024-02-07 19:14:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488143665] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:14:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:14:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:14:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773632812] [2024-02-07 19:14:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:14:59,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:14:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:14:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:14:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:14:59,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2024-02-07 19:14:59,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:14:59,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:14:59,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2024-02-07 19:14:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:15:01,363 INFO L124 PetriNetUnfolderBase]: 31193/42788 cut-off events. [2024-02-07 19:15:01,363 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2024-02-07 19:15:01,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85834 conditions, 42788 events. 31193/42788 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 2878. Compared 291809 event pairs, 31190 based on Foata normal form. 1299/30080 useless extension candidates. Maximal degree in co-relation 85825. Up to 31591 conditions per place. [2024-02-07 19:15:01,527 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 81 selfloop transitions, 7 changer transitions 1/99 dead transitions. [2024-02-07 19:15:01,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 448 flow [2024-02-07 19:15:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:15:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:15:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-02-07 19:15:01,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448 [2024-02-07 19:15:01,528 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 192 flow. Second operand 5 states and 168 transitions. [2024-02-07 19:15:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 448 flow [2024-02-07 19:15:01,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 429 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 19:15:01,531 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 194 flow [2024-02-07 19:15:01,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-02-07 19:15:01,532 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2024-02-07 19:15:01,532 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 194 flow [2024-02-07 19:15:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:15:01,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:15:01,532 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1] [2024-02-07 19:15:01,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:15:01,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:15:01,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:15:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 157585345, now seen corresponding path program 3 times [2024-02-07 19:15:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:15:01,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347687349] [2024-02-07 19:15:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:15:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:15:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:15:01,583 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:15:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:15:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347687349] [2024-02-07 19:15:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347687349] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:15:01,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954634666] [2024-02-07 19:15:01,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 19:15:01,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:15:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:15:01,585 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:15:01,587 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:15:01,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 19:15:01,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:15:01,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-07 19:15:01,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:15:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 19:15:01,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:15:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-07 19:15:01,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954634666] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:15:01,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:15:01,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2024-02-07 19:15:01,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476912297] [2024-02-07 19:15:01,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:15:01,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-07 19:15:01,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:15:01,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-07 19:15:01,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-02-07 19:15:01,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2024-02-07 19:15:01,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 194 flow. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 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:15:01,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:15:01,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2024-02-07 19:15:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:15:04,333 INFO L124 PetriNetUnfolderBase]: 31195/42690 cut-off events. [2024-02-07 19:15:04,333 INFO L125 PetriNetUnfolderBase]: For 2782/2782 co-relation queries the response was YES. [2024-02-07 19:15:04,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87925 conditions, 42690 events. 31195/42690 cut-off events. For 2782/2782 co-relation queries the response was YES. Maximal size of possible extension queue 2874. Compared 289986 event pairs, 31190 based on Foata normal form. 0/28640 useless extension candidates. Maximal degree in co-relation 87914. Up to 42408 conditions per place. [2024-02-07 19:15:04,515 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 48 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2024-02-07 19:15:04,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 348 flow [2024-02-07 19:15:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-07 19:15:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-07 19:15:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-02-07 19:15:04,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26814814814814814 [2024-02-07 19:15:04,517 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 194 flow. Second operand 9 states and 181 transitions. [2024-02-07 19:15:04,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 348 flow [2024-02-07 19:15:04,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 71 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:15:04,520 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 240 flow [2024-02-07 19:15:04,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-02-07 19:15:04,520 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2024-02-07 19:15:04,521 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 240 flow [2024-02-07 19:15:04,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 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:15:04,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:15:04,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:15:04,532 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:15:04,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:15:04,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:15:04,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:15:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash -849443628, now seen corresponding path program 1 times [2024-02-07 19:15:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:15:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701038694] [2024-02-07 19:15:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:15:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:15:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:15:04,818 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:15:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:15:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701038694] [2024-02-07 19:15:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701038694] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:15:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790902479] [2024-02-07 19:15:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:15:04,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:15:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:15:04,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:15:04,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 19:15:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:15:04,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 19:15:04,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:15:04,953 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:15:04,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:15:04,992 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:15:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790902479] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:15:04,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:15:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-07 19:15:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006523953] [2024-02-07 19:15:04,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:15:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-07 19:15:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:15:04,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-07 19:15:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-02-07 19:15:05,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 75 [2024-02-07 19:15:05,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 240 flow. Second operand has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:15:05,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:15:05,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 75 [2024-02-07 19:15:05,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:15:08,001 INFO L124 PetriNetUnfolderBase]: 39007/53730 cut-off events. [2024-02-07 19:15:08,001 INFO L125 PetriNetUnfolderBase]: For 4304/4304 co-relation queries the response was YES. [2024-02-07 19:15:08,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109946 conditions, 53730 events. 39007/53730 cut-off events. For 4304/4304 co-relation queries the response was YES. Maximal size of possible extension queue 3171. Compared 378373 event pairs, 39003 based on Foata normal form. 1298/37425 useless extension candidates. Maximal degree in co-relation 109933. Up to 31591 conditions per place. [2024-02-07 19:15:08,445 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 80 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-02-07 19:15:08,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 522 flow [2024-02-07 19:15:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 19:15:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 19:15:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-02-07 19:15:08,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2024-02-07 19:15:08,447 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 240 flow. Second operand 8 states and 196 transitions. [2024-02-07 19:15:08,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 522 flow [2024-02-07 19:15:08,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 457 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-02-07 19:15:08,450 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 243 flow [2024-02-07 19:15:08,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=243, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2024-02-07 19:15:08,451 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2024-02-07 19:15:08,451 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 243 flow [2024-02-07 19:15:08,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:15:08,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:15:08,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:15:08,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 19:15:08,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:15:08,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:15:08,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:15:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 395382333, now seen corresponding path program 1 times [2024-02-07 19:15:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:15:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136189373] [2024-02-07 19:15:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:15:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:15:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:15:08,705 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:15:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:15:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136189373] [2024-02-07 19:15:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136189373] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:15:08,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:15:08,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:15:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164180694] [2024-02-07 19:15:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:15:08,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:15:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:15:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:15:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:15:08,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2024-02-07 19:15:08,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:15:08,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:15:08,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2024-02-07 19:15:08,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:15:10,959 INFO L124 PetriNetUnfolderBase]: 29926/41385 cut-off events. [2024-02-07 19:15:10,959 INFO L125 PetriNetUnfolderBase]: For 5468/5468 co-relation queries the response was YES. [2024-02-07 19:15:11,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86511 conditions, 41385 events. 29926/41385 cut-off events. For 5468/5468 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 286591 event pairs, 29922 based on Foata normal form. 0/29586 useless extension candidates. Maximal degree in co-relation 86499. Up to 41011 conditions per place. [2024-02-07 19:15:11,124 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 54 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2024-02-07 19:15:11,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 67 transitions, 349 flow [2024-02-07 19:15:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:15:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:15:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-07 19:15:11,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43555555555555553 [2024-02-07 19:15:11,125 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 243 flow. Second operand 3 states and 98 transitions. [2024-02-07 19:15:11,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 67 transitions, 349 flow [2024-02-07 19:15:11,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 67 transitions, 341 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 19:15:11,128 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 233 flow [2024-02-07 19:15:11,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2024-02-07 19:15:11,129 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2024-02-07 19:15:11,129 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 233 flow [2024-02-07 19:15:11,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:15:11,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:15:11,130 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:15:11,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:15:11,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 29 more)] === [2024-02-07 19:15:11,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:15:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1212943115, now seen corresponding path program 2 times [2024-02-07 19:15:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:15:11,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538100180] [2024-02-07 19:15:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:15:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:15:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:15:11,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:15:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:15:11,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:15:11,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:15:11,171 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 32 remaining) [2024-02-07 19:15:11,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 32 remaining) [2024-02-07 19:15:11,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 32 remaining) [2024-02-07 19:15:11,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 32 remaining) [2024-02-07 19:15:11,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 32 remaining) [2024-02-07 19:15:11,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 32 remaining) [2024-02-07 19:15:11,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 32 remaining) [2024-02-07 19:15:11,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (18 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 32 remaining) [2024-02-07 19:15:11,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 32 remaining) [2024-02-07 19:15:11,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 32 remaining) [2024-02-07 19:15:11,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 32 remaining) [2024-02-07 19:15:11,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 32 remaining) [2024-02-07 19:15:11,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:15:11,177 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2024-02-07 19:15:11,181 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:15:11,181 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:15:11,198 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-07 19:15:11,204 INFO L503 ceAbstractionStarter]: Automizer considered 15 witness invariants [2024-02-07 19:15:11,204 INFO L504 ceAbstractionStarter]: WitnessConsidered=15 [2024-02-07 19:15:11,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:15:11 BasicIcfg [2024-02-07 19:15:11,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:15:11,205 INFO L158 Benchmark]: Toolchain (without parser) took 26374.33ms. Allocated memory was 127.9MB in the beginning and 13.9GB in the end (delta: 13.8GB). Free memory was 99.0MB in the beginning and 11.7GB in the end (delta: -11.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-02-07 19:15:11,205 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:15:11,206 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 96.0MB in the end (delta: 201.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:15:11,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.76ms. Allocated memory is still 127.9MB. Free memory was 99.0MB in the beginning and 82.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-02-07 19:15:11,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.03ms. Allocated memory is still 127.9MB. Free memory was 82.9MB in the beginning and 80.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:15:11,206 INFO L158 Benchmark]: Boogie Preprocessor took 66.20ms. Allocated memory is still 127.9MB. Free memory was 80.3MB in the beginning and 76.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:15:11,206 INFO L158 Benchmark]: RCFGBuilder took 908.71ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 76.7MB in the beginning and 78.6MB in the end (delta: -2.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-02-07 19:15:11,207 INFO L158 Benchmark]: TraceAbstraction took 25038.41ms. Allocated memory was 169.9MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 78.6MB in the beginning and 11.7GB in the end (delta: -11.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-07 19:15:11,208 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 96.0MB in the end (delta: 201.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.76ms. Allocated memory is still 127.9MB. Free memory was 99.0MB in the beginning and 82.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.03ms. Allocated memory is still 127.9MB. Free memory was 82.9MB in the beginning and 80.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.20ms. Allocated memory is still 127.9MB. Free memory was 80.3MB in the beginning and 76.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 908.71ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 76.7MB in the beginning and 78.6MB in the end (delta: -2.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25038.41ms. Allocated memory was 169.9MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 78.6MB in the beginning and 11.7GB in the end (delta: -11.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 153]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] 0 int* x; [L42] 0 int i1, i2, t11, t21, t12, t22, s1, s2, n; [L108] 0 pthread_t t1, t2, t3, t4; [L111] 0 i1 = __VERIFIER_nondet_int() [L112] 0 i2 = __VERIFIER_nondet_int() [L113] 0 t11 = __VERIFIER_nondet_int() [L114] 0 t21 = __VERIFIER_nondet_int() [L115] 0 t12 = __VERIFIER_nondet_int() [L116] 0 t22 = __VERIFIER_nondet_int() [L117] 0 s1 = __VERIFIER_nondet_int() [L118] 0 s2 = __VERIFIER_nondet_int() [L119] 0 n = __VERIFIER_nondet_int() [L120] CALL 0 assume_abort_if_not(n < 2147483647) [L38] COND FALSE 0 !(!cond) [L120] RET 0 assume_abort_if_not(n < 2147483647) [L121] CALL, EXPR 0 create_fresh_int_array(n+1) [L142] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[size]]]] [L142] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(size >= 0) [L143] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[size]]]] [L143] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L143] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L145] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L146] 0 int i = 0; VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=0, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L146] COND TRUE 0 i < size VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=0, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L147] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L147] 0 arr[i] = __VERIFIER_nondet_int() [L146] 0 i++ VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=1, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L146] COND TRUE 0 i < size VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=1, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L147] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] [L147] 0 arr[i] = __VERIFIER_nondet_int() [L146] 0 i++ VAL [\old(size)=2, arr={-2:0}, i1=0, i2=0, i=2, n=1, s1=0, s2=0, size=2, t11=0, t12=0, t21=0, t22=0, x={0:0}] [L146] COND FALSE 0 !(i < size) [L149] 0 return arr; [L121] RET, EXPR 0 create_fresh_int_array(n+1) [L121] 0 x = create_fresh_int_array(n+1) [L124] CALL 0 assume_abort_if_not( s1 == s2 && s1 == i1 && s1 == i2 && s1 == 0 ) [L38] COND FALSE 0 !(!cond) [L124] RET 0 assume_abort_if_not( s1 == s2 && s1 == i1 && s1 == i2 && s1 == 0 ) [L126] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [i1=0, i2=0, n=1, s1=0, s2=0, t11=0, t12=0, t1={7:0}, t21=0, t22=0, t2={6:0}, t3={3:0}, t4={5:0}, x={-2:0}] [L48] COND TRUE 1 __VERIFIER_nondet_bool() [L50] CALL 1 assume_abort_if_not( i1 < n ) [L38] COND FALSE 1 !(!cond) [L50] RET 1 assume_abort_if_not( i1 < n ) [L51] 1 i1++ [L52] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[i1]]]] [L52] EXPR 1 x[i1] [L52] 1 t11 = x[i1] [L55] CALL 1 plus(s1, t11) [L153] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=0, \old(b)=0, a=0, b=0, i1=1, i2=0, n=1, s1=0, s2=0, t11=0, t12=0, t21=0, t22=0, x={-2:0}] - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 143]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 136]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 127]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 128]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 129]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 111 locations, 32 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1455 IncrementalHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 4 mSDtfsCounter, 1455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 12 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 15/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:15:11,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE