./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s2.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/bigshot_s2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/bigshot_s2.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bigshot_s2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:49:40,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:49:40,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:49:40,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:49:40,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:49:41,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:49:41,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:49:41,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:49:41,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:49:41,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:49:41,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:49:41,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:49:41,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:49:41,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:49:41,012 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:49:41,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:49:41,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:49:41,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:49:41,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:49:41,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:49:41,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:49:41,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:49:41,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:49:41,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:49:41,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:49:41,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:49:41,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:49:41,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:49:41,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:49:41,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:49:41,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:49:41,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:49:41,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:49:41,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:49:41,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:49:41,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:49:41,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:49:41,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:49:41,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:49:41,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:49:41,018 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:49:41,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:49:41,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:49:41,019 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-01-29 22:49:41,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:49:41,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:49:41,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:49:41,258 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:49:41,258 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:49:41,259 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/bigshot_s2.yml/witness.yml [2024-01-29 22:49:41,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:49:41,346 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:49:41,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2024-01-29 22:49:42,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:49:43,203 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:49:43,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2024-01-29 22:49:43,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c29d398/a301d1d6b58f4289bdfde7cb194df8fd/FLAGdb3abf94b [2024-01-29 22:49:43,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c29d398/a301d1d6b58f4289bdfde7cb194df8fd [2024-01-29 22:49:43,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:49:43,235 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:49:43,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:49:43,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:49:43,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:49:43,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:49:41" (1/2) ... [2024-01-29 22:49:43,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddddc85 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:49:43, skipping insertion in model container [2024-01-29 22:49:43,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:49:41" (1/2) ... [2024-01-29 22:49:43,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@351a03f9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:49:43, skipping insertion in model container [2024-01-29 22:49:43,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:49:43" (2/2) ... [2024-01-29 22:49:43,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddddc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43, skipping insertion in model container [2024-01-29 22:49:43,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:49:43" (2/2) ... [2024-01-29 22:49:43,245 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:49:43,272 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:49:43,273 INFO L98 nessWitnessExtractor]: Location invariant before [L1122-L1122] v == 0 [2024-01-29 22:49:43,273 INFO L98 nessWitnessExtractor]: Location invariant before [L1107-L1107] (expression == 1) && (0 <= expression) [2024-01-29 22:49:43,273 INFO L98 nessWitnessExtractor]: Location invariant before [L1107-L1107] ((expression == 1) && (0 <= expression)) && (expression == 0 || expression == 1) [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1107-L1107] ((expression == 1) && (0 <= expression)) && (expression == 0) [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1107-L1107] expression == 1 [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1107-L1107] ((expression == 1) && (0 <= expression)) && (expression <= 1) [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1117-L1117] (unsigned long )arg == 0UL [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1112-L1112] (unsigned long )arg == 0UL [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1116-L1116] (unsigned long )arg == 0UL [2024-01-29 22:49:43,274 INFO L98 nessWitnessExtractor]: Location invariant before [L1116-L1116] ((unsigned long )arg == 0UL) && ((unsigned long )arg == 0UL) [2024-01-29 22:49:43,275 INFO L98 nessWitnessExtractor]: Location invariant before [L1111-L1111] (unsigned long )arg == 0UL [2024-01-29 22:49:43,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:49:43,627 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/bigshot_s2.i[55203,55216] [2024-01-29 22:49:43,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:49:43,643 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:49:43,669 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/bigshot_s2.i[55203,55216] [2024-01-29 22:49:43,670 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();}}; return; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:49:43,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:49:43,747 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:49:43,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43 WrapperNode [2024-01-29 22:49:43,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:49:43,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:49:43,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:49:43,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:49:43,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,784 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-01-29 22:49:43,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:49:43,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:49:43,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:49:43,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:49:43,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,804 INFO L175 MemorySlicer]: Split 17 memory accesses to 5 slices as follows [2, 2, 9, 2, 2]. 53 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0, 0]. The 3 writes are split as follows [0, 1, 0, 1, 1]. [2024-01-29 22:49:43,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:49:43,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:49:43,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:49:43,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:49:43,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (1/1) ... [2024-01-29 22:49:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:49:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:43,840 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-01-29 22:49:43,863 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-01-29 22:49:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:49:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:49:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:49:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:49:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 22:49:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:49:43,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:49:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:49:43,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 22:49:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:49:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:49:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:49:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:49:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:49:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 22:49:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:49:43,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:49:43,894 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:49:44,006 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:49:44,008 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:49:44,124 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:49:44,124 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:49:44,233 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:49:44,234 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-01-29 22:49:44,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:49:44 BoogieIcfgContainer [2024-01-29 22:49:44,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:49:44,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:49:44,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:49:44,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:49:44,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:49:41" (1/4) ... [2024-01-29 22:49:44,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a75668 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:49:44, skipping insertion in model container [2024-01-29 22:49:44,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:49:43" (2/4) ... [2024-01-29 22:49:44,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a75668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:49:44, skipping insertion in model container [2024-01-29 22:49:44,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:43" (3/4) ... [2024-01-29 22:49:44,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a75668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:49:44, skipping insertion in model container [2024-01-29 22:49:44,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:49:44" (4/4) ... [2024-01-29 22:49:44,244 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2024-01-29 22:49:44,257 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:49:44,258 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-01-29 22:49:44,258 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:49:44,311 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:49:44,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 88 flow [2024-01-29 22:49:44,375 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-01-29 22:49:44,375 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:49:44,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 4/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-01-29 22:49:44,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 37 transitions, 88 flow [2024-01-29 22:49:44,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-01-29 22:49:44,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:49:44,391 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;@a8dfbba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:49:44,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-01-29 22:49:44,394 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:49:44,394 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:49:44,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:49:44,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:44,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:49:44,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:44,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash 7565, now seen corresponding path program 1 times [2024-01-29 22:49:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741568412] [2024-01-29 22:49:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:44,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741568412] [2024-01-29 22:49:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741568412] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:49:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:49:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:49:44,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215473668] [2024-01-29 22:49:44,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:49:44,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:49:44,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:49:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:49:44,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-01-29 22:49:44,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:49:44,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:44,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-01-29 22:49:44,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:44,776 INFO L124 PetriNetUnfolderBase]: 10/57 cut-off events. [2024-01-29 22:49:44,776 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:49:44,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 57 events. 10/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 4 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 73. Up to 27 conditions per place. [2024-01-29 22:49:44,778 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 20 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2024-01-29 22:49:44,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 131 flow [2024-01-29 22:49:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:49:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:49:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-01-29 22:49:44,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6306306306306306 [2024-01-29 22:49:44,793 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 70 transitions. [2024-01-29 22:49:44,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 131 flow [2024-01-29 22:49:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 121 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:49:44,798 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 70 flow [2024-01-29 22:49:44,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2024-01-29 22:49:44,804 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2024-01-29 22:49:44,805 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 70 flow [2024-01-29 22:49:44,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:49:44,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:44,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:49:44,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:49:44,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:44,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 225628379, now seen corresponding path program 1 times [2024-01-29 22:49:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:44,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068814665] [2024-01-29 22:49:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:45,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068814665] [2024-01-29 22:49:45,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068814665] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:49:45,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:49:45,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:49:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038787810] [2024-01-29 22:49:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:49:45,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:49:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:49:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:49:45,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-01-29 22:49:45,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-29 22:49:45,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:45,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-01-29 22:49:45,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:45,116 INFO L124 PetriNetUnfolderBase]: 10/53 cut-off events. [2024-01-29 22:49:45,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:49:45,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 53 events. 10/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 5 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 54. Up to 34 conditions per place. [2024-01-29 22:49:45,117 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-01-29 22:49:45,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 106 flow [2024-01-29 22:49:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:49:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:49:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-01-29 22:49:45,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-01-29 22:49:45,119 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 70 flow. Second operand 4 states and 77 transitions. [2024-01-29 22:49:45,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 106 flow [2024-01-29 22:49:45,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:49:45,120 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 64 flow [2024-01-29 22:49:45,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2024-01-29 22:49:45,121 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2024-01-29 22:49:45,121 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 64 flow [2024-01-29 22:49:45,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-29 22:49:45,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:45,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:45,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:49:45,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:45,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -886870397, now seen corresponding path program 1 times [2024-01-29 22:49:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804557195] [2024-01-29 22:49:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:45,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:45,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804557195] [2024-01-29 22:49:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804557195] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:49:45,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:49:45,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:49:45,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481041978] [2024-01-29 22:49:45,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:49:45,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:49:45,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:49:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:49:45,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-01-29 22:49:45,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-29 22:49:45,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:45,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-01-29 22:49:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:45,378 INFO L124 PetriNetUnfolderBase]: 10/43 cut-off events. [2024-01-29 22:49:45,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:49:45,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 43 events. 10/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 2 based on Foata normal form. 4/46 useless extension candidates. Maximal degree in co-relation 69. Up to 18 conditions per place. [2024-01-29 22:49:45,379 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-01-29 22:49:45,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 98 flow [2024-01-29 22:49:45,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:49:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:49:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-01-29 22:49:45,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-29 22:49:45,383 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 64 flow. Second operand 4 states and 74 transitions. [2024-01-29 22:49:45,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 98 flow [2024-01-29 22:49:45,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 95 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:49:45,387 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 59 flow [2024-01-29 22:49:45,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-01-29 22:49:45,388 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2024-01-29 22:49:45,388 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 59 flow [2024-01-29 22:49:45,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-29 22:49:45,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:45,389 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-01-29 22:49:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:49:45,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:45,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1914405790, now seen corresponding path program 1 times [2024-01-29 22:49:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700435890] [2024-01-29 22:49:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:45,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:45,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700435890] [2024-01-29 22:49:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700435890] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:49:45,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:49:45,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:49:45,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608382080] [2024-01-29 22:49:45,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:49:45,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:49:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:49:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:49:45,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:45,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:49:45,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:45,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:45,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:45,505 INFO L124 PetriNetUnfolderBase]: 8/38 cut-off events. [2024-01-29 22:49:45,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:49:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 38 events. 8/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 24 event pairs, 4 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2024-01-29 22:49:45,506 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 17 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2024-01-29 22:49:45,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 95 flow [2024-01-29 22:49:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:49:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:49:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-01-29 22:49:45,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6036036036036037 [2024-01-29 22:49:45,510 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 59 flow. Second operand 3 states and 67 transitions. [2024-01-29 22:49:45,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 95 flow [2024-01-29 22:49:45,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:49:45,514 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 56 flow [2024-01-29 22:49:45,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-01-29 22:49:45,516 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2024-01-29 22:49:45,516 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 56 flow [2024-01-29 22:49:45,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:49:45,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:45,518 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-01-29 22:49:45,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:49:45,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:45,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -36492107, now seen corresponding path program 1 times [2024-01-29 22:49:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689693061] [2024-01-29 22:49:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:45,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689693061] [2024-01-29 22:49:45,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689693061] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:49:45,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:49:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:49:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322365981] [2024-01-29 22:49:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:49:45,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:49:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:49:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:49:45,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:45,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-01-29 22:49:45,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:45,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:45,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:45,799 INFO L124 PetriNetUnfolderBase]: 12/48 cut-off events. [2024-01-29 22:49:45,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:49:45,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 48 events. 12/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 7 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 87. Up to 33 conditions per place. [2024-01-29 22:49:45,800 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 19 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2024-01-29 22:49:45,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 116 flow [2024-01-29 22:49:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 22:49:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 22:49:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-01-29 22:49:45,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.545045045045045 [2024-01-29 22:49:45,802 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 56 flow. Second operand 6 states and 121 transitions. [2024-01-29 22:49:45,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 116 flow [2024-01-29 22:49:45,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:49:45,803 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 79 flow [2024-01-29 22:49:45,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=79, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-01-29 22:49:45,803 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-01-29 22:49:45,804 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 79 flow [2024-01-29 22:49:45,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-01-29 22:49:45,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:45,804 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:45,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:49:45,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:45,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1513467612, now seen corresponding path program 1 times [2024-01-29 22:49:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051470997] [2024-01-29 22:49:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051470997] [2024-01-29 22:49:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051470997] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226053540] [2024-01-29 22:49:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:45,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:45,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:45,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-29 22:49:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:46,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-29 22:49:46,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:46,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-29 22:49:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:46,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:49:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226053540] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:49:46,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:49:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-01-29 22:49:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498932139] [2024-01-29 22:49:46,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:49:46,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-29 22:49:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:46,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-29 22:49:46,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-01-29 22:49:46,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:46,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 79 flow. Second operand has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 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-01-29 22:49:46,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:46,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:46,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:46,326 INFO L124 PetriNetUnfolderBase]: 14/54 cut-off events. [2024-01-29 22:49:46,327 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:49:46,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 54 events. 14/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 7 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 119. Up to 33 conditions per place. [2024-01-29 22:49:46,327 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 21 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2024-01-29 22:49:46,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 149 flow [2024-01-29 22:49:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 22:49:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 22:49:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-01-29 22:49:46,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-01-29 22:49:46,329 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 79 flow. Second operand 7 states and 140 transitions. [2024-01-29 22:49:46,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 149 flow [2024-01-29 22:49:46,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:49:46,330 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 108 flow [2024-01-29 22:49:46,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-01-29 22:49:46,331 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2024-01-29 22:49:46,331 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 108 flow [2024-01-29 22:49:46,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 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-01-29 22:49:46,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:46,331 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:46,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-29 22:49:46,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-29 22:49:46,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:46,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash -722349663, now seen corresponding path program 2 times [2024-01-29 22:49:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89780079] [2024-01-29 22:49:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89780079] [2024-01-29 22:49:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89780079] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:46,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189448541] [2024-01-29 22:49:46,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-29 22:49:46,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:46,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:46,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:46,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-29 22:49:46,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-29 22:49:46,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 22:49:46,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-29 22:49:46,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:46,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-29 22:49:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:46,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:49:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:46,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189448541] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:49:46,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:49:46,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-01-29 22:49:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832164134] [2024-01-29 22:49:46,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:49:46,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-29 22:49:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-29 22:49:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-01-29 22:49:47,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:47,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 108 flow. Second operand has 17 states, 17 states have (on average 19.235294117647058) internal successors, (327), 17 states have internal predecessors, (327), 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-01-29 22:49:47,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:47,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:47,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:47,145 INFO L124 PetriNetUnfolderBase]: 16/60 cut-off events. [2024-01-29 22:49:47,146 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-29 22:49:47,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 60 events. 16/60 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 7 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 159. Up to 33 conditions per place. [2024-01-29 22:49:47,147 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 23 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2024-01-29 22:49:47,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 190 flow [2024-01-29 22:49:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-29 22:49:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-29 22:49:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-01-29 22:49:47,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2024-01-29 22:49:47,148 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 108 flow. Second operand 8 states and 159 transitions. [2024-01-29 22:49:47,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 190 flow [2024-01-29 22:49:47,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 178 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-29 22:49:47,150 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 132 flow [2024-01-29 22:49:47,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2024-01-29 22:49:47,150 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2024-01-29 22:49:47,150 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 132 flow [2024-01-29 22:49:47,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.235294117647058) internal successors, (327), 17 states have internal predecessors, (327), 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-01-29 22:49:47,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:47,151 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:47,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-29 22:49:47,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-29 22:49:47,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:47,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash -667212066, now seen corresponding path program 3 times [2024-01-29 22:49:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:47,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313023418] [2024-01-29 22:49:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:47,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313023418] [2024-01-29 22:49:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313023418] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414149389] [2024-01-29 22:49:47,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-29 22:49:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:47,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:47,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-29 22:49:47,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-29 22:49:47,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 22:49:47,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2024-01-29 22:49:47,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:47,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-29 22:49:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:47,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:49:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:47,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414149389] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:49:47,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:49:47,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-01-29 22:49:47,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625149153] [2024-01-29 22:49:47,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:49:47,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-29 22:49:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-29 22:49:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-01-29 22:49:47,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:47,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 132 flow. Second operand has 20 states, 20 states have (on average 19.05) internal successors, (381), 20 states have internal predecessors, (381), 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-01-29 22:49:47,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:47,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:47,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:48,044 INFO L124 PetriNetUnfolderBase]: 18/66 cut-off events. [2024-01-29 22:49:48,045 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-01-29 22:49:48,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 66 events. 18/66 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 7 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 195. Up to 33 conditions per place. [2024-01-29 22:49:48,046 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-01-29 22:49:48,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 39 transitions, 226 flow [2024-01-29 22:49:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-29 22:49:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-29 22:49:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-01-29 22:49:48,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345345345345346 [2024-01-29 22:49:48,047 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 132 flow. Second operand 9 states and 178 transitions. [2024-01-29 22:49:48,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 39 transitions, 226 flow [2024-01-29 22:49:48,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 208 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-01-29 22:49:48,049 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 156 flow [2024-01-29 22:49:48,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2024-01-29 22:49:48,050 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2024-01-29 22:49:48,050 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 156 flow [2024-01-29 22:49:48,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 19.05) internal successors, (381), 20 states have internal predecessors, (381), 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-01-29 22:49:48,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:48,051 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:48,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-29 22:49:48,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:48,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:48,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash 780411099, now seen corresponding path program 4 times [2024-01-29 22:49:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181575406] [2024-01-29 22:49:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181575406] [2024-01-29 22:49:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181575406] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642958880] [2024-01-29 22:49:48,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-29 22:49:48,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:48,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:48,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:48,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-29 22:49:48,611 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-29 22:49:48,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 22:49:48,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 17 conjunts are in the unsatisfiable core [2024-01-29 22:49:48,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:48,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-29 22:49:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:48,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:49:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642958880] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:49:48,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:49:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-01-29 22:49:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293346585] [2024-01-29 22:49:48,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:49:48,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-29 22:49:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-29 22:49:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-01-29 22:49:48,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:48,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 156 flow. Second operand has 23 states, 23 states have (on average 18.91304347826087) internal successors, (435), 23 states have internal predecessors, (435), 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-01-29 22:49:48,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:48,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:48,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:49,200 INFO L124 PetriNetUnfolderBase]: 20/72 cut-off events. [2024-01-29 22:49:49,200 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-29 22:49:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 72 events. 20/72 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 7 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 231. Up to 33 conditions per place. [2024-01-29 22:49:49,204 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 27 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2024-01-29 22:49:49,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 42 transitions, 262 flow [2024-01-29 22:49:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-29 22:49:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-29 22:49:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-01-29 22:49:49,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324324324324324 [2024-01-29 22:49:49,207 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 156 flow. Second operand 10 states and 197 transitions. [2024-01-29 22:49:49,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 42 transitions, 262 flow [2024-01-29 22:49:49,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 238 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-01-29 22:49:49,211 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 180 flow [2024-01-29 22:49:49,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2024-01-29 22:49:49,213 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-01-29 22:49:49,213 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 180 flow [2024-01-29 22:49:49,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 18.91304347826087) internal successors, (435), 23 states have internal predecessors, (435), 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-01-29 22:49:49,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:49,214 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:49,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-29 22:49:49,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:49,431 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:49,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 376868760, now seen corresponding path program 5 times [2024-01-29 22:49:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255439024] [2024-01-29 22:49:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:49,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255439024] [2024-01-29 22:49:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255439024] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896749137] [2024-01-29 22:49:49,654 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-29 22:49:49,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:49,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:49,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:49,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-29 22:49:49,758 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-01-29 22:49:49,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 22:49:49,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2024-01-29 22:49:49,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:49,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-29 22:49:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:49,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:49:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896749137] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:49:50,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:49:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-01-29 22:49:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177562565] [2024-01-29 22:49:50,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:49:50,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-01-29 22:49:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:50,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-01-29 22:49:50,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-01-29 22:49:50,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:50,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 180 flow. Second operand has 26 states, 26 states have (on average 18.807692307692307) internal successors, (489), 26 states have internal predecessors, (489), 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-01-29 22:49:50,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:50,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:50,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:50,381 INFO L124 PetriNetUnfolderBase]: 22/78 cut-off events. [2024-01-29 22:49:50,382 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2024-01-29 22:49:50,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 78 events. 22/78 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 7 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 267. Up to 33 conditions per place. [2024-01-29 22:49:50,382 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 29 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2024-01-29 22:49:50,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 45 transitions, 298 flow [2024-01-29 22:49:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-29 22:49:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-29 22:49:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-01-29 22:49:50,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5307125307125307 [2024-01-29 22:49:50,384 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 180 flow. Second operand 11 states and 216 transitions. [2024-01-29 22:49:50,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 45 transitions, 298 flow [2024-01-29 22:49:50,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 45 transitions, 268 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-01-29 22:49:50,386 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 204 flow [2024-01-29 22:49:50,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=204, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2024-01-29 22:49:50,386 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-01-29 22:49:50,387 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 204 flow [2024-01-29 22:49:50,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 18.807692307692307) internal successors, (489), 26 states have internal predecessors, (489), 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-01-29 22:49:50,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:50,387 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:50,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-29 22:49:50,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-29 22:49:50,596 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:50,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash -880262379, now seen corresponding path program 6 times [2024-01-29 22:49:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793824893] [2024-01-29 22:49:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793824893] [2024-01-29 22:49:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793824893] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680849369] [2024-01-29 22:49:50,853 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-29 22:49:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:50,854 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:50,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-29 22:49:50,963 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-01-29 22:49:50,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 22:49:50,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-29 22:49:50,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:51,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-29 22:49:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:51,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:49:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680849369] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:49:51,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:49:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-01-29 22:49:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731809828] [2024-01-29 22:49:51,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:49:51,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-01-29 22:49:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:49:51,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-01-29 22:49:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-01-29 22:49:51,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-01-29 22:49:51,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 204 flow. Second operand has 29 states, 29 states have (on average 18.724137931034484) internal successors, (543), 29 states have internal predecessors, (543), 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-01-29 22:49:51,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:49:51,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-01-29 22:49:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:49:51,773 INFO L124 PetriNetUnfolderBase]: 24/84 cut-off events. [2024-01-29 22:49:51,773 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2024-01-29 22:49:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 84 events. 24/84 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 7 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 303. Up to 33 conditions per place. [2024-01-29 22:49:51,774 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2024-01-29 22:49:51,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 48 transitions, 334 flow [2024-01-29 22:49:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-29 22:49:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-29 22:49:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-01-29 22:49:51,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292792792792793 [2024-01-29 22:49:51,776 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 204 flow. Second operand 12 states and 235 transitions. [2024-01-29 22:49:51,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 48 transitions, 334 flow [2024-01-29 22:49:51,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 48 transitions, 298 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-01-29 22:49:51,779 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 228 flow [2024-01-29 22:49:51,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=228, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2024-01-29 22:49:51,779 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2024-01-29 22:49:51,780 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 228 flow [2024-01-29 22:49:51,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 18.724137931034484) internal successors, (543), 29 states have internal predecessors, (543), 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-01-29 22:49:51,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:49:51,781 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:49:51,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-29 22:49:51,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:51,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 11 more)] === [2024-01-29 22:49:51,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:49:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2097476782, now seen corresponding path program 7 times [2024-01-29 22:49:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:49:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524982581] [2024-01-29 22:49:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:49:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:49:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:49:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524982581] [2024-01-29 22:49:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524982581] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 22:49:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654148419] [2024-01-29 22:49:53,378 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-29 22:49:53,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:49:53,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:49:53,390 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 22:49:53,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-29 22:49:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:49:53,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2024-01-29 22:49:53,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 22:49:53,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-29 22:49:53,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-29 22:49:53,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-29 22:49:53,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-29 22:49:53,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-29 22:49:53,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-29 22:49:53,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-29 22:49:53,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,886 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-01-29 22:49:53,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2024-01-29 22:49:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:49:53,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 22:51:30,775 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)) (forall ((v_ArrVal_335 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| Int) (v_ArrVal_332 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| Int) (v_ArrVal_329 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int) (v_ArrVal_337 Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| 1)) (= 66 (select (select (store |c_#memory_int#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (select |c_#memory_int#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_329) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_332) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_335) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_337)) c_~v~0.base) c_~v~0.offset)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| 1)))))) is different from false [2024-01-29 22:53:21,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| Int) (v_ArrVal_335 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| Int) (v_ArrVal_332 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| Int) (v_ArrVal_329 Int) (v_ArrVal_327 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| 1)) (= 66 (select (select (store |c_#memory_int#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (store (store (select |c_#memory_int#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_325) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_327) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_329) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_332) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_335) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_337)) c_~v~0.base) c_~v~0.offset)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| 1)))) is different from false [2024-01-29 22:53:25,560 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)) (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| Int) (v_ArrVal_335 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| Int) (v_ArrVal_332 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| Int) (v_ArrVal_329 Int) (v_ArrVal_327 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| 1)) (= (select (select (store |c_#memory_int#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (store (store (select |c_#memory_int#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_325) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_327) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_329) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_332) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_335) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_337)) c_~v~0.base) c_~v~0.offset) 66) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| 1)))))) is different from false [2024-01-29 22:53:25,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25658 treesize of output 25626 [2024-01-29 22:53:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 16 refuted. 4 times theorem prover too weak. 2 trivial. 20 not checked. [2024-01-29 22:53:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654148419] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 22:53:27,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 22:53:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 17] total 38 [2024-01-29 22:53:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379833969] [2024-01-29 22:53:27,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 22:53:27,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-01-29 22:53:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:53:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-01-29 22:53:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=938, Unknown=48, NotChecked=210, Total=1482 [2024-01-29 22:53:27,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-01-29 22:53:27,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 39 transitions, 228 flow. Second operand has 39 states, 39 states have (on average 14.846153846153847) internal successors, (579), 39 states have internal predecessors, (579), 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-01-29 22:53:27,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:53:27,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-01-29 22:53:27,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:53:28,847 INFO L124 PetriNetUnfolderBase]: 23/81 cut-off events. [2024-01-29 22:53:28,848 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-01-29 22:53:28,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 81 events. 23/81 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 2 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 293. Up to 20 conditions per place. [2024-01-29 22:53:28,848 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 0 selfloop transitions, 0 changer transitions 47/47 dead transitions. [2024-01-29 22:53:28,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 47 transitions, 328 flow [2024-01-29 22:53:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-29 22:53:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-01-29 22:53:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 224 transitions. [2024-01-29 22:53:28,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2024-01-29 22:53:28,849 INFO L175 Difference]: Start difference. First operand has 67 places, 39 transitions, 228 flow. Second operand 14 states and 224 transitions. [2024-01-29 22:53:28,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 47 transitions, 328 flow [2024-01-29 22:53:28,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 47 transitions, 286 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-01-29 22:53:28,851 INFO L231 Difference]: Finished difference. Result has 69 places, 0 transitions, 0 flow [2024-01-29 22:53:28,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=69, PETRI_TRANSITIONS=0} [2024-01-29 22:53:28,852 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2024-01-29 22:53:28,852 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 0 transitions, 0 flow [2024-01-29 22:53:28,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 14.846153846153847) internal successors, (579), 39 states have internal predecessors, (579), 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-01-29 22:53:28,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 14 remaining) [2024-01-29 22:53:28,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 14 remaining) [2024-01-29 22:53:28,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-01-29 22:53:29,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 22:53:29,063 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2024-01-29 22:53:29,067 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:53:29,068 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:53:29,070 INFO L503 ceAbstractionStarter]: Automizer considered 6 witness invariants [2024-01-29 22:53:29,070 INFO L504 ceAbstractionStarter]: WitnessConsidered=6 [2024-01-29 22:53:29,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:53:29 BasicIcfg [2024-01-29 22:53:29,071 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:53:29,071 INFO L158 Benchmark]: Toolchain (without parser) took 225836.42ms. Allocated memory was 180.4MB in the beginning and 427.8MB in the end (delta: 247.5MB). Free memory was 103.5MB in the beginning and 325.0MB in the end (delta: -221.5MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-01-29 22:53:29,071 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:53:29,071 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:53:29,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.70ms. Allocated memory was 180.4MB in the beginning and 257.9MB in the end (delta: 77.6MB). Free memory was 103.2MB in the beginning and 205.4MB in the end (delta: -102.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-01-29 22:53:29,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 257.9MB. Free memory was 205.4MB in the beginning and 203.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:53:29,072 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 257.9MB. Free memory was 203.3MB in the beginning and 200.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:53:29,074 INFO L158 Benchmark]: RCFGBuilder took 419.66ms. Allocated memory is still 257.9MB. Free memory was 200.2MB in the beginning and 172.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-29 22:53:29,074 INFO L158 Benchmark]: TraceAbstraction took 224832.58ms. Allocated memory was 257.9MB in the beginning and 427.8MB in the end (delta: 169.9MB). Free memory was 171.9MB in the beginning and 325.0MB in the end (delta: -153.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-01-29 22:53:29,075 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.70ms. Allocated memory was 180.4MB in the beginning and 257.9MB in the end (delta: 77.6MB). Free memory was 103.2MB in the beginning and 205.4MB in the end (delta: -102.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 257.9MB. Free memory was 205.4MB in the beginning and 203.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 257.9MB. Free memory was 203.3MB in the beginning and 200.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 419.66ms. Allocated memory is still 257.9MB. Free memory was 200.2MB in the beginning and 172.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 224832.58ms. Allocated memory was 257.9MB in the beginning and 427.8MB in the end (delta: 169.9MB). Free memory was 171.9MB in the beginning and 325.0MB in the end (delta: -153.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1111]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1112]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1116]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1116]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1117]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1122]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 14 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: 224.7s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 117 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2730 IncrementalHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 17 mSDtfsCounter, 2730 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 217 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 213.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=11, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 218.6s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 687 ConstructedInterpolants, 14 QuantifiedInterpolants, 6194 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1575 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 72/504 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-29 22:53:29,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE