./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/singleton.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/singleton.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 13967880 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/singleton.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.extract-columns-1396788-m [2024-02-02 16:16:12,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 16:16:12,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 16:16:12,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 16:16:12,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 16:16:12,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 16:16:12,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 16:16:12,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 16:16:12,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 16:16:12,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 16:16:12,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 16:16:12,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 16:16:12,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 16:16:12,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 16:16:12,239 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 16:16:12,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 16:16:12,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 16:16:12,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 16:16:12,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 16:16:12,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 16:16:12,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 16:16:12,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 16:16:12,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 16:16:12,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 16:16:12,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 16:16:12,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 16:16:12,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 16:16:12,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 16:16:12,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 16:16:12,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 16:16:12,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 16:16:12,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 16:16:12,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 16:16:12,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 16:16:12,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 16:16:12,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 16:16:12,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 16:16:12,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 16:16:12,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 16:16:12,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 16:16:12,247 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 16:16:12,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 16:16:12,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 16:16:12,248 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-02 16:16:12,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 16:16:12,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 16:16:12,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 16:16:12,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 16:16:12,634 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 16:16:12,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2024-02-02 16:16:13,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 16:16:14,065 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 16:16:14,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2024-02-02 16:16:14,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca19c55a/dba1ac07b19647ad9982120f5b6e1a16/FLAG944b1cca6 [2024-02-02 16:16:14,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca19c55a/dba1ac07b19647ad9982120f5b6e1a16 [2024-02-02 16:16:14,109 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 16:16:14,109 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 16:16:14,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/singleton.yml/witness.yml [2024-02-02 16:16:14,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 16:16:14,206 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 16:16:14,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 16:16:14,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 16:16:14,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 16:16:14,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 04:16:14" (1/2) ... [2024-02-02 16:16:14,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e518b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 04:16:14, skipping insertion in model container [2024-02-02 16:16:14,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 04:16:14" (1/2) ... [2024-02-02 16:16:14,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@728796bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 04:16:14, skipping insertion in model container [2024-02-02 16:16:14,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 04:16:14" (2/2) ... [2024-02-02 16:16:14,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e518b46 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14, skipping insertion in model container [2024-02-02 16:16:14,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 04:16:14" (2/2) ... [2024-02-02 16:16:14,217 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 16:16:14,312 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 16:16:14,314 INFO L101 nessWitnessExtractor]: Location invariant after [L1123-L1123] expression == 1 [2024-02-02 16:16:14,314 INFO L101 nessWitnessExtractor]: Location invariant before [L1149-L1149] (unsigned long )arg == 0UL [2024-02-02 16:16:14,315 INFO L101 nessWitnessExtractor]: Location invariant before [L1135-L1135] (unsigned long )arg == 0UL [2024-02-02 16:16:14,315 INFO L101 nessWitnessExtractor]: Location invariant before [L1153-L1153] (unsigned long )arg == 0UL [2024-02-02 16:16:14,315 INFO L101 nessWitnessExtractor]: Location invariant before [L1141-L1141] (unsigned long )arg == 0UL [2024-02-02 16:16:14,315 INFO L101 nessWitnessExtractor]: Location invariant before [L1139-L1139] (unsigned long )arg == 0UL [2024-02-02 16:16:14,315 INFO L101 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 1 [2024-02-02 16:16:14,315 INFO L101 nessWitnessExtractor]: Location invariant before [L1123-L1123] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-02 16:16:14,316 INFO L101 nessWitnessExtractor]: Location invariant before [L1151-L1151] (unsigned long )arg == 0UL [2024-02-02 16:16:14,316 INFO L101 nessWitnessExtractor]: Location invariant before [L1134-L1134] (unsigned long )arg == 0UL [2024-02-02 16:16:14,316 INFO L101 nessWitnessExtractor]: Location invariant before [L1152-L1152] (unsigned long )arg == 0UL [2024-02-02 16:16:14,316 INFO L101 nessWitnessExtractor]: Location invariant before [L1148-L1148] (unsigned long )arg == 0UL [2024-02-02 16:16:14,316 INFO L101 nessWitnessExtractor]: Location invariant before [L1133-L1133] (unsigned long )arg == 0UL [2024-02-02 16:16:14,316 INFO L101 nessWitnessExtractor]: Location invariant before [L1127-L1127] (unsigned long )arg == 0UL [2024-02-02 16:16:14,317 INFO L101 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 0 [2024-02-02 16:16:14,317 INFO L101 nessWitnessExtractor]: Location invariant before [L1142-L1142] (unsigned long )arg == 0UL [2024-02-02 16:16:14,317 INFO L101 nessWitnessExtractor]: Location invariant before [L1154-L1154] (unsigned long )arg == 0UL [2024-02-02 16:16:14,317 INFO L101 nessWitnessExtractor]: Location invariant before [L1147-L1147] (unsigned long )arg == 0UL [2024-02-02 16:16:14,317 INFO L101 nessWitnessExtractor]: Location invariant before [L1155-L1155] (unsigned long )arg == 0UL [2024-02-02 16:16:14,317 INFO L101 nessWitnessExtractor]: Location invariant before [L1157-L1157] (unsigned long )arg == 0UL [2024-02-02 16:16:14,318 INFO L101 nessWitnessExtractor]: Location invariant before [L1128-L1128] (unsigned long )arg == 0UL [2024-02-02 16:16:14,319 INFO L101 nessWitnessExtractor]: Location invariant after [L1123-L1123] expression == 0 [2024-02-02 16:16:14,319 INFO L101 nessWitnessExtractor]: Location invariant before [L1140-L1140] (unsigned long )arg == 0UL [2024-02-02 16:16:14,319 INFO L101 nessWitnessExtractor]: Location invariant before [L1150-L1150] (unsigned long )arg == 0UL [2024-02-02 16:16:14,319 INFO L101 nessWitnessExtractor]: Location invariant before [L1156-L1156] (unsigned long )arg == 0UL [2024-02-02 16:16:14,319 INFO L101 nessWitnessExtractor]: Location invariant before [L1132-L1132] (unsigned long )arg == 0UL [2024-02-02 16:16:14,319 INFO L101 nessWitnessExtractor]: Location invariant before [L1162-L1162] v == 0 [2024-02-02 16:16:14,320 INFO L101 nessWitnessExtractor]: Location invariant after [L1123-L1123] expression == 1 [2024-02-02 16:16:14,374 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-02 16:16:14,781 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2024-02-02 16:16:14,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 16:16:14,820 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-02 16:16:14,880 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] Start Parsing Local Start Parsing Local [2024-02-02 16:16:14,881 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 16:16:14,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 16:16:14,943 INFO L208 MainTranslator]: Completed translation [2024-02-02 16:16:14,944 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14 WrapperNode [2024-02-02 16:16:14,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 16:16:14,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 16:16:14,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 16:16:14,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 16:16:14,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:14,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:14,981 INFO L138 Inliner]: procedures = 324, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-02-02 16:16:14,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 16:16:14,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 16:16:14,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 16:16:14,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 16:16:14,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:14,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:14,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,016 INFO L175 MemorySlicer]: Split 17 memory accesses to 8 slices as follows [2, 2, 2, 2, 3, 2, 2, 2]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [1, 0, 1, 1, 2, 1, 1, 1]. [2024-02-02 16:16:15,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 16:16:15,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 16:16:15,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 16:16:15,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 16:16:15,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (1/1) ... [2024-02-02 16:16:15,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 16:16:15,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 16:16:15,090 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-02 16:16:15,096 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-02 16:16:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 16:16:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 16:16:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 16:16:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 16:16:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 16:16:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 16:16:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 16:16:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 16:16:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-02 16:16:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-02 16:16:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-02 16:16:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-02-02 16:16:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2024-02-02 16:16:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2024-02-02 16:16:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 16:16:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 16:16:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 16:16:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 16:16:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-02 16:16:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-02 16:16:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 16:16:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 16:16:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 16:16:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 16:16:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 16:16:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 16:16:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-02 16:16:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-02 16:16:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-02 16:16:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-02-02 16:16:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 16:16:15,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 16:16:15,158 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 16:16:15,285 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 16:16:15,287 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 16:16:15,598 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 16:16:15,599 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 16:16:15,735 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 16:16:15,736 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 16:16:15,737 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 04:16:15 BoogieIcfgContainer [2024-02-02 16:16:15,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 16:16:15,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 16:16:15,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 16:16:15,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 16:16:15,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 04:16:14" (1/4) ... [2024-02-02 16:16:15,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c88f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 04:16:15, skipping insertion in model container [2024-02-02 16:16:15,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 04:16:14" (2/4) ... [2024-02-02 16:16:15,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c88f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 04:16:15, skipping insertion in model container [2024-02-02 16:16:15,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 04:16:14" (3/4) ... [2024-02-02 16:16:15,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c88f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 04:16:15, skipping insertion in model container [2024-02-02 16:16:15,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 04:16:15" (4/4) ... [2024-02-02 16:16:15,747 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2024-02-02 16:16:15,764 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 16:16:15,765 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-02 16:16:15,765 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 16:16:15,864 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-02-02 16:16:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 399 flow [2024-02-02 16:16:15,930 INFO L124 PetriNetUnfolderBase]: 6/102 cut-off events. [2024-02-02 16:16:15,930 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-02 16:16:15,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 102 events. 6/102 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 145 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2024-02-02 16:16:15,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 399 flow [2024-02-02 16:16:15,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 101 transitions, 253 flow [2024-02-02 16:16:15,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 16:16:15,951 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;@366453f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 16:16:15,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2024-02-02 16:16:15,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 16:16:15,953 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 16:16:15,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 16:16:15,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:15,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 16:16:15,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:15,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 10285, now seen corresponding path program 1 times [2024-02-02 16:16:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:15,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027218998] [2024-02-02 16:16:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:16,136 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-02 16:16:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027218998] [2024-02-02 16:16:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027218998] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 16:16:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530830923] [2024-02-02 16:16:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:16,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 16:16:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 16:16:16,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 16:16:16,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 153 [2024-02-02 16:16:16,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-02 16:16:16,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:16,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 153 [2024-02-02 16:16:16,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:17,531 INFO L124 PetriNetUnfolderBase]: 7191/10960 cut-off events. [2024-02-02 16:16:17,531 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2024-02-02 16:16:17,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21262 conditions, 10960 events. 7191/10960 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 73656 event pairs, 5813 based on Foata normal form. 1/8338 useless extension candidates. Maximal degree in co-relation 21233. Up to 9585 conditions per place. [2024-02-02 16:16:17,629 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 53 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-02-02 16:16:17,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 98 transitions, 357 flow [2024-02-02 16:16:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 16:16:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 16:16:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-02-02 16:16:17,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5708061002178649 [2024-02-02 16:16:17,647 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 253 flow. Second operand 3 states and 262 transitions. [2024-02-02 16:16:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 98 transitions, 357 flow [2024-02-02 16:16:17,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 98 transitions, 323 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-02-02 16:16:17,669 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 211 flow [2024-02-02 16:16:17,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2024-02-02 16:16:17,674 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -15 predicate places. [2024-02-02 16:16:17,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 211 flow [2024-02-02 16:16:17,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-02 16:16:17,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:17,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 16:16:17,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 16:16:17,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:17,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash 306859334, now seen corresponding path program 1 times [2024-02-02 16:16:17,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760694241] [2024-02-02 16:16:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:17,895 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-02 16:16:17,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:17,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760694241] [2024-02-02 16:16:17,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760694241] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:17,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925120736] [2024-02-02 16:16:17,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:17,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:17,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:17,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 153 [2024-02-02 16:16:17,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-02 16:16:17,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:17,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 153 [2024-02-02 16:16:17,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:18,894 INFO L124 PetriNetUnfolderBase]: 7191/10301 cut-off events. [2024-02-02 16:16:18,894 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-02-02 16:16:18,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20087 conditions, 10301 events. 7191/10301 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 62962 event pairs, 5816 based on Foata normal form. 0/7678 useless extension candidates. Maximal degree in co-relation 11202. Up to 9599 conditions per place. [2024-02-02 16:16:18,957 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 51 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-02-02 16:16:18,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 297 flow [2024-02-02 16:16:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2024-02-02 16:16:18,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2024-02-02 16:16:18,960 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 211 flow. Second operand 4 states and 292 transitions. [2024-02-02 16:16:18,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 297 flow [2024-02-02 16:16:18,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:18,964 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 189 flow [2024-02-02 16:16:18,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2024-02-02 16:16:18,967 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -25 predicate places. [2024-02-02 16:16:18,967 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 189 flow [2024-02-02 16:16:18,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-02 16:16:18,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:18,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:18,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 16:16:18,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:18,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1956477425, now seen corresponding path program 1 times [2024-02-02 16:16:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:18,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585521191] [2024-02-02 16:16:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:19,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585521191] [2024-02-02 16:16:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585521191] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:19,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:19,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981999144] [2024-02-02 16:16:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:19,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:19,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:19,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-02 16:16:19,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-02 16:16:19,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:19,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-02 16:16:19,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:19,905 INFO L124 PetriNetUnfolderBase]: 7198/10308 cut-off events. [2024-02-02 16:16:19,905 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-02-02 16:16:19,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20103 conditions, 10308 events. 7198/10308 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 62939 event pairs, 5810 based on Foata normal form. 0/7687 useless extension candidates. Maximal degree in co-relation 20084. Up to 9597 conditions per place. [2024-02-02 16:16:19,984 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 55 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-02-02 16:16:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 307 flow [2024-02-02 16:16:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2024-02-02 16:16:19,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212418300653595 [2024-02-02 16:16:19,986 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 189 flow. Second operand 4 states and 319 transitions. [2024-02-02 16:16:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 307 flow [2024-02-02 16:16:19,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:19,990 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 186 flow [2024-02-02 16:16:19,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-02-02 16:16:19,992 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -26 predicate places. [2024-02-02 16:16:19,992 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 186 flow [2024-02-02 16:16:19,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-02 16:16:19,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:19,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:19,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 16:16:19,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:19,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2006888034, now seen corresponding path program 1 times [2024-02-02 16:16:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475739722] [2024-02-02 16:16:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:19,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 16:16:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475739722] [2024-02-02 16:16:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475739722] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681447458] [2024-02-02 16:16:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:20,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:20,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:20,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:20,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-02 16:16:20,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-02 16:16:20,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:20,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-02 16:16:20,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:20,957 INFO L124 PetriNetUnfolderBase]: 7191/10423 cut-off events. [2024-02-02 16:16:20,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 16:16:20,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20208 conditions, 10423 events. 7191/10423 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 66330 event pairs, 921 based on Foata normal form. 510/9036 useless extension candidates. Maximal degree in co-relation 20190. Up to 7885 conditions per place. [2024-02-02 16:16:21,014 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-02-02 16:16:21,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 375 flow [2024-02-02 16:16:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-02 16:16:21,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-02 16:16:21,017 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 186 flow. Second operand 4 states and 337 transitions. [2024-02-02 16:16:21,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 375 flow [2024-02-02 16:16:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 101 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:21,020 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 181 flow [2024-02-02 16:16:21,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2024-02-02 16:16:21,021 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -28 predicate places. [2024-02-02 16:16:21,021 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 181 flow [2024-02-02 16:16:21,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-02 16:16:21,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:21,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:21,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 16:16:21,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:21,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash 742818681, now seen corresponding path program 1 times [2024-02-02 16:16:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726520952] [2024-02-02 16:16:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:21,147 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-02 16:16:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726520952] [2024-02-02 16:16:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726520952] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:21,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597248999] [2024-02-02 16:16:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:21,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:21,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:21,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-02 16:16:21,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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-02 16:16:21,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:21,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-02 16:16:21,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:21,669 INFO L124 PetriNetUnfolderBase]: 5528/8020 cut-off events. [2024-02-02 16:16:21,669 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-02-02 16:16:21,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15592 conditions, 8020 events. 5528/8020 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 44817 event pairs, 2094 based on Foata normal form. 442/7397 useless extension candidates. Maximal degree in co-relation 15574. Up to 5903 conditions per place. [2024-02-02 16:16:21,831 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-02-02 16:16:21,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 99 transitions, 373 flow [2024-02-02 16:16:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-02 16:16:21,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-02 16:16:21,833 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 181 flow. Second operand 4 states and 337 transitions. [2024-02-02 16:16:21,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 99 transitions, 373 flow [2024-02-02 16:16:21,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:21,835 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 176 flow [2024-02-02 16:16:21,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-02-02 16:16:21,836 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -30 predicate places. [2024-02-02 16:16:21,836 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 176 flow [2024-02-02 16:16:21,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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-02 16:16:21,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:21,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:21,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 16:16:21,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:21,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1586901252, now seen corresponding path program 1 times [2024-02-02 16:16:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819582073] [2024-02-02 16:16:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:21,932 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-02 16:16:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819582073] [2024-02-02 16:16:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819582073] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877028000] [2024-02-02 16:16:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:21,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:21,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-02 16:16:21,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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-02 16:16:21,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:21,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-02 16:16:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:22,338 INFO L124 PetriNetUnfolderBase]: 4095/6027 cut-off events. [2024-02-02 16:16:22,338 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-02-02 16:16:22,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11702 conditions, 6027 events. 4095/6027 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 35010 event pairs, 281 based on Foata normal form. 334/5868 useless extension candidates. Maximal degree in co-relation 11684. Up to 4245 conditions per place. [2024-02-02 16:16:22,377 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2024-02-02 16:16:22,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 371 flow [2024-02-02 16:16:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-02 16:16:22,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-02 16:16:22,378 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 176 flow. Second operand 4 states and 337 transitions. [2024-02-02 16:16:22,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 371 flow [2024-02-02 16:16:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:22,380 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 171 flow [2024-02-02 16:16:22,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2024-02-02 16:16:22,381 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -32 predicate places. [2024-02-02 16:16:22,381 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 171 flow [2024-02-02 16:16:22,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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-02 16:16:22,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:22,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:22,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 16:16:22,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:22,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 643951003, now seen corresponding path program 1 times [2024-02-02 16:16:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260436074] [2024-02-02 16:16:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:22,467 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-02 16:16:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260436074] [2024-02-02 16:16:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260436074] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:22,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373143351] [2024-02-02 16:16:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:22,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:22,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-02 16:16:22,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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-02 16:16:22,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:22,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-02 16:16:22,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:22,819 INFO L124 PetriNetUnfolderBase]: 3032/4448 cut-off events. [2024-02-02 16:16:22,819 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-02-02 16:16:22,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8732 conditions, 4448 events. 3032/4448 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23568 event pairs, 494 based on Foata normal form. 214/4515 useless extension candidates. Maximal degree in co-relation 8714. Up to 2671 conditions per place. [2024-02-02 16:16:22,840 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-02-02 16:16:22,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 369 flow [2024-02-02 16:16:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-02 16:16:22,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-02 16:16:22,842 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 171 flow. Second operand 4 states and 337 transitions. [2024-02-02 16:16:22,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 369 flow [2024-02-02 16:16:22,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:22,844 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 166 flow [2024-02-02 16:16:22,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-02-02 16:16:22,845 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -34 predicate places. [2024-02-02 16:16:22,845 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 166 flow [2024-02-02 16:16:22,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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-02 16:16:22,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:22,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:22,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 16:16:22,846 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:22,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1270670161, now seen corresponding path program 1 times [2024-02-02 16:16:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422826044] [2024-02-02 16:16:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:23,168 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-02 16:16:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:23,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422826044] [2024-02-02 16:16:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422826044] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:23,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:23,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862856729] [2024-02-02 16:16:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:23,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:23,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 153 [2024-02-02 16:16:23,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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-02 16:16:23,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:23,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 153 [2024-02-02 16:16:23,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:23,699 INFO L124 PetriNetUnfolderBase]: 3743/5433 cut-off events. [2024-02-02 16:16:23,700 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-02-02 16:16:23,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10916 conditions, 5433 events. 3743/5433 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27097 event pairs, 1249 based on Foata normal form. 3/5230 useless extension candidates. Maximal degree in co-relation 10898. Up to 3255 conditions per place. [2024-02-02 16:16:23,723 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 69 selfloop transitions, 4 changer transitions 13/104 dead transitions. [2024-02-02 16:16:23,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 420 flow [2024-02-02 16:16:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2024-02-02 16:16:23,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5637254901960784 [2024-02-02 16:16:23,725 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 166 flow. Second operand 4 states and 345 transitions. [2024-02-02 16:16:23,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 420 flow [2024-02-02 16:16:23,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 16:16:23,728 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 199 flow [2024-02-02 16:16:23,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2024-02-02 16:16:23,730 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -30 predicate places. [2024-02-02 16:16:23,730 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 199 flow [2024-02-02 16:16:23,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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-02 16:16:23,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:23,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:23,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 16:16:23,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:23,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash -618533663, now seen corresponding path program 2 times [2024-02-02 16:16:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080916955] [2024-02-02 16:16:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 16:16:24,012 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-02 16:16:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 16:16:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080916955] [2024-02-02 16:16:24,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080916955] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 16:16:24,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 16:16:24,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 16:16:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665260070] [2024-02-02 16:16:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 16:16:24,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 16:16:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 16:16:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 16:16:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 16:16:24,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 153 [2024-02-02 16:16:24,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 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-02 16:16:24,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 16:16:24,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 153 [2024-02-02 16:16:24,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 16:16:24,464 INFO L124 PetriNetUnfolderBase]: 3197/4626 cut-off events. [2024-02-02 16:16:24,464 INFO L125 PetriNetUnfolderBase]: For 1917/1917 co-relation queries the response was YES. [2024-02-02 16:16:24,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11036 conditions, 4626 events. 3197/4626 cut-off events. For 1917/1917 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 22753 event pairs, 1269 based on Foata normal form. 2/4422 useless extension candidates. Maximal degree in co-relation 11025. Up to 2693 conditions per place. [2024-02-02 16:16:24,489 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 60 selfloop transitions, 2 changer transitions 20/98 dead transitions. [2024-02-02 16:16:24,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 432 flow [2024-02-02 16:16:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 16:16:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 16:16:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2024-02-02 16:16:24,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.545751633986928 [2024-02-02 16:16:24,491 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 199 flow. Second operand 4 states and 334 transitions. [2024-02-02 16:16:24,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 432 flow [2024-02-02 16:16:24,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 416 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-02 16:16:24,495 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 189 flow [2024-02-02 16:16:24,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-02-02 16:16:24,496 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -34 predicate places. [2024-02-02 16:16:24,496 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 189 flow [2024-02-02 16:16:24,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 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-02 16:16:24,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 16:16:24,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:24,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 16:16:24,497 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-02 16:16:24,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 16:16:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash -955877365, now seen corresponding path program 1 times [2024-02-02 16:16:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 16:16:24,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226669233] [2024-02-02 16:16:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 16:16:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 16:16:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 16:16:24,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 16:16:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 16:16:24,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 16:16:24,622 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 16:16:24,623 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (65 of 66 remaining) [2024-02-02 16:16:24,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 66 remaining) [2024-02-02 16:16:24,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 66 remaining) [2024-02-02 16:16:24,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 66 remaining) [2024-02-02 16:16:24,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 66 remaining) [2024-02-02 16:16:24,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 66 remaining) [2024-02-02 16:16:24,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 66 remaining) [2024-02-02 16:16:24,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 66 remaining) [2024-02-02 16:16:24,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 66 remaining) [2024-02-02 16:16:24,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 66 remaining) [2024-02-02 16:16:24,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 66 remaining) [2024-02-02 16:16:24,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 66 remaining) [2024-02-02 16:16:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 66 remaining) [2024-02-02 16:16:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 66 remaining) [2024-02-02 16:16:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 66 remaining) [2024-02-02 16:16:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 66 remaining) [2024-02-02 16:16:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 66 remaining) [2024-02-02 16:16:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 66 remaining) [2024-02-02 16:16:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 66 remaining) [2024-02-02 16:16:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 66 remaining) [2024-02-02 16:16:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 66 remaining) [2024-02-02 16:16:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 66 remaining) [2024-02-02 16:16:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 66 remaining) [2024-02-02 16:16:24,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 66 remaining) [2024-02-02 16:16:24,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 66 remaining) [2024-02-02 16:16:24,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 66 remaining) [2024-02-02 16:16:24,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 66 remaining) [2024-02-02 16:16:24,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 66 remaining) [2024-02-02 16:16:24,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 66 remaining) [2024-02-02 16:16:24,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 66 remaining) [2024-02-02 16:16:24,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 66 remaining) [2024-02-02 16:16:24,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 66 remaining) [2024-02-02 16:16:24,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 66 remaining) [2024-02-02 16:16:24,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 66 remaining) [2024-02-02 16:16:24,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 66 remaining) [2024-02-02 16:16:24,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 66 remaining) [2024-02-02 16:16:24,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 66 remaining) [2024-02-02 16:16:24,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 66 remaining) [2024-02-02 16:16:24,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 66 remaining) [2024-02-02 16:16:24,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 66 remaining) [2024-02-02 16:16:24,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 66 remaining) [2024-02-02 16:16:24,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 66 remaining) [2024-02-02 16:16:24,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 66 remaining) [2024-02-02 16:16:24,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 66 remaining) [2024-02-02 16:16:24,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 66 remaining) [2024-02-02 16:16:24,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 66 remaining) [2024-02-02 16:16:24,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 66 remaining) [2024-02-02 16:16:24,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 66 remaining) [2024-02-02 16:16:24,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 16:16:24,636 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 16:16:24,641 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 16:16:24,641 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 16:16:24,712 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-02-02 16:16:24,712 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-02-02 16:16:24,713 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 04:16:24 BasicIcfg [2024-02-02 16:16:24,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 16:16:24,714 INFO L158 Benchmark]: Toolchain (without parser) took 10507.29ms. Allocated memory was 188.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 146.2MB in the beginning and 1.1GB in the end (delta: -986.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-02-02 16:16:24,714 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 16:16:24,714 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 188.7MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 16:16:24,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.68ms. Allocated memory is still 188.7MB. Free memory was 145.5MB in the beginning and 101.4MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-02-02 16:16:24,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.65ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 16:16:24,715 INFO L158 Benchmark]: Boogie Preprocessor took 56.47ms. Allocated memory is still 188.7MB. Free memory was 99.3MB in the beginning and 96.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 16:16:24,715 INFO L158 Benchmark]: RCFGBuilder took 698.10ms. Allocated memory is still 188.7MB. Free memory was 96.5MB in the beginning and 124.0MB in the end (delta: -27.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-02-02 16:16:24,715 INFO L158 Benchmark]: TraceAbstraction took 8973.62ms. Allocated memory was 188.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 124.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-02-02 16:16:24,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 188.7MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.68ms. Allocated memory is still 188.7MB. Free memory was 145.5MB in the beginning and 101.4MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.65ms. Allocated memory is still 188.7MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.47ms. Allocated memory is still 188.7MB. Free memory was 99.3MB in the beginning and 96.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 698.10ms. Allocated memory is still 188.7MB. Free memory was 96.5MB in the beginning and 124.0MB in the end (delta: -27.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8973.62ms. Allocated memory was 188.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 124.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; VAL [t={5:0}, v={0:0}] [L1162] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v],IntegerLiteral[0]]]] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, t={5:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={0:0}] [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={0:0}] [L1147] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={0:0}] [L1127] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1127] 2 v = malloc(sizeof(char)) [L1148] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1148] 1 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1128] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1149] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1132] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1133] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1133] 3 v[0] = 'X' [L1134] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1150] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1139] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1135] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 3 return 0; [L1151] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1132] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1133] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1133] 5 v[0] = 'X' [L1134] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1152] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1132] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1133] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1133] 6 v[0] = 'X' [L1134] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1135] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 5 return 0; [L1153] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1153] 1 \read(t2) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1135] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 6 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1154] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1154] 1 \read(t3) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1140] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1140] 4 v[0] = 'Y' [L1141] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1142] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1155] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1155] 1 \read(t4) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1156] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1156] 1 \read(t5) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-7:0}] [L1157] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={5:0}, v={-7:0}] [L1164] EXPR 0 v[0] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X') [L1123] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[expression]],BinaryExpression[COMPLEQ,IdentifierExpression[expression],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]]]]]] VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-7:0}] [L1123] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-7:0}] [L1123] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-7:0}] [L1123] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-7:0}] - UnprovableResult [Line: 1147]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1148]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1152]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1155]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1156]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1157]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1147]: 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: 1151]: 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: 1152]: 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: 1150]: 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: 1149]: 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: 1127]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1128]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1132]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1133]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1134]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1135]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1139]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1140]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1141]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1142]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1162]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1123]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1123]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1123]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1162]: 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: 1152]: 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: 1149]: 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: 1150]: 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: 1147]: 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: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 182 locations, 66 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: 8.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1178 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 15 mSDtfsCounter, 1178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-02 16:16:24,752 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