./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.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/13-privatized_24-multiple-protecting_true.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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/goblint-regression/13-privatized_24-multiple-protecting_true.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_24-multiple-protecting_true.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-3d25acf-m [2024-01-30 14:21:28,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:21:28,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:21:28,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:21:28,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:21:29,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:21:29,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:21:29,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:21:29,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:21:29,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:21:29,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:21:29,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:21:29,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:21:29,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:21:29,016 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:21:29,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:21:29,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:21:29,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:21:29,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:21:29,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:21:29,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:21:29,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:21:29,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:21:29,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:21:29,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:21:29,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:21:29,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:21:29,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:21:29,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:21:29,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:21:29,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:21:29,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:21:29,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:21:29,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:21:29,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:21:29,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:21:29,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:21:29,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:21:29,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:21:29,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:21:29,022 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:21:29,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:21:29,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:21:29,023 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-30 14:21:29,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:21:29,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:21:29,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:21:29,277 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:21:29,277 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:21:29,278 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/13-privatized_24-multiple-protecting_true.yml/witness.yml [2024-01-30 14:21:29,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:21:29,412 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:21:29,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-01-30 14:21:30,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:21:30,614 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:21:30,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-01-30 14:21:30,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65740fa01/d9cd47d6f1114a3cad895c70fb1a7ae4/FLAGf86d1bb96 [2024-01-30 14:21:30,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65740fa01/d9cd47d6f1114a3cad895c70fb1a7ae4 [2024-01-30 14:21:30,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:21:30,650 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:21:30,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:21:30,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:21:30,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:21:30,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:29" (1/2) ... [2024-01-30 14:21:30,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d243cb3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:21:30, skipping insertion in model container [2024-01-30 14:21:30,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:29" (1/2) ... [2024-01-30 14:21:30,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@21d925f9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:21:30, skipping insertion in model container [2024-01-30 14:21:30,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:21:30" (2/2) ... [2024-01-30 14:21:30,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d243cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:30, skipping insertion in model container [2024-01-30 14:21:30,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:21:30" (2/2) ... [2024-01-30 14:21:30,660 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:21:30,716 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:21:30,717 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((g1 == 0) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,717 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-30 14:21:30,717 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] ((g1 == 1) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L716-L716] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] ((g1 == 0) && (g2 == 1)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((g1 == 0) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,718 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] ((g1 == 0) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] ((g1 == 0) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L714-L714] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((g1 == 0) && (g2 == 1)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((g1 == 1) && (g2 == 0)) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (g2 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,719 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((g1 == 0) && (g2 == 0)) && (g1 == 0)) && (g2 == 0) [2024-01-30 14:21:30,720 INFO L98 nessWitnessExtractor]: Location invariant before [L713-L713] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,720 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (unsigned long )arg == 0UL [2024-01-30 14:21:30,720 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] g1 == 0 [2024-01-30 14:21:30,720 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,720 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (g1 == 1) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (g2 == 1) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] g1 == 0 [2024-01-30 14:21:30,721 INFO L98 nessWitnessExtractor]: Location invariant before [L722-L722] g1 == 0 [2024-01-30 14:21:30,722 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (g1 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,722 INFO L98 nessWitnessExtractor]: Location invariant before [L715-L715] (g1 == 0) && (g2 == 0) [2024-01-30 14:21:30,722 INFO L98 nessWitnessExtractor]: Location invariant before [L695-L695] (g2 == 0) && ((unsigned long )arg == 0UL) [2024-01-30 14:21:30,722 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] g1 == 0 [2024-01-30 14:21:30,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:21:30,907 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2024-01-30 14:21:31,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:21:31,073 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:21:31,084 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2024-01-30 14:21:31,084 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:21:31,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:21:31,214 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:21:31,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31 WrapperNode [2024-01-30 14:21:31,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:21:31,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:21:31,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:21:31,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:21:31,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,271 INFO L138 Inliner]: procedures = 163, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2024-01-30 14:21:31,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:21:31,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:21:31,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:21:31,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:21:31,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,299 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-01-30 14:21:31,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:21:31,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:21:31,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:21:31,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:21:31,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (1/1) ... [2024-01-30 14:21:31,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:21:31,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:21:31,349 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-30 14:21:31,357 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-30 14:21:31,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:21:31,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:21:31,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:21:31,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:21:31,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-30 14:21:31,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:21:31,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:21:31,404 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-30 14:21:31,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:21:31,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:21:31,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:21:31,407 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:21:31,518 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:21:31,520 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:21:31,754 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:21:31,754 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:21:31,912 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:21:31,913 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:21:31,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:21:31 BoogieIcfgContainer [2024-01-30 14:21:31,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:21:31,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:21:31,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:21:31,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:21:31,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:21:29" (1/4) ... [2024-01-30 14:21:31,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1473613c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:21:31, skipping insertion in model container [2024-01-30 14:21:31,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:21:30" (2/4) ... [2024-01-30 14:21:31,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1473613c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:31, skipping insertion in model container [2024-01-30 14:21:31,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:21:31" (3/4) ... [2024-01-30 14:21:31,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1473613c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:21:31, skipping insertion in model container [2024-01-30 14:21:31,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:21:31" (4/4) ... [2024-01-30 14:21:31,923 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2024-01-30 14:21:31,936 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:21:31,937 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-01-30 14:21:31,937 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:21:32,010 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:21:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 141 transitions, 289 flow [2024-01-30 14:21:32,099 INFO L124 PetriNetUnfolderBase]: 4/140 cut-off events. [2024-01-30 14:21:32,099 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:21:32,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 4/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 230 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2024-01-30 14:21:32,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 141 transitions, 289 flow [2024-01-30 14:21:32,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 138 transitions, 279 flow [2024-01-30 14:21:32,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:21:32,128 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;@73bfe083, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:21:32,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-01-30 14:21:32,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:21:32,131 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:21:32,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:32,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:32,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:21:32,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:32,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 15232, now seen corresponding path program 1 times [2024-01-30 14:21:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271847715] [2024-01-30 14:21:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:32,344 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-30 14:21:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271847715] [2024-01-30 14:21:32,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271847715] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:32,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:32,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:21:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538781008] [2024-01-30 14:21:32,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:32,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:21:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:32,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:21:32,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:21:32,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 141 [2024-01-30 14:21:32,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 138 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:32,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:32,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 141 [2024-01-30 14:21:32,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:32,907 INFO L124 PetriNetUnfolderBase]: 896/3534 cut-off events. [2024-01-30 14:21:32,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:21:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 3534 events. 896/3534 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 28616 event pairs, 512 based on Foata normal form. 376/3586 useless extension candidates. Maximal degree in co-relation 5721. Up to 1428 conditions per place. [2024-01-30 14:21:32,923 INFO L140 encePairwiseOnDemand]: 101/141 looper letters, 87 selfloop transitions, 16 changer transitions 0/166 dead transitions. [2024-01-30 14:21:32,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 166 transitions, 541 flow [2024-01-30 14:21:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:21:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:21:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2024-01-30 14:21:32,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7683215130023641 [2024-01-30 14:21:32,934 INFO L175 Difference]: Start difference. First operand has 138 places, 138 transitions, 279 flow. Second operand 3 states and 325 transitions. [2024-01-30 14:21:32,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 166 transitions, 541 flow [2024-01-30 14:21:32,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 166 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:21:32,940 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 414 flow [2024-01-30 14:21:32,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=140, PETRI_TRANSITIONS=144} [2024-01-30 14:21:32,943 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2024-01-30 14:21:32,943 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 414 flow [2024-01-30 14:21:32,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:21:32,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:32,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:21:32,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:21:32,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:32,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 454410114, now seen corresponding path program 1 times [2024-01-30 14:21:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366297384] [2024-01-30 14:21:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:33,073 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-30 14:21:33,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:33,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366297384] [2024-01-30 14:21:33,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366297384] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:33,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:33,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:33,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926132969] [2024-01-30 14:21:33,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:33,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:33,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 141 [2024-01-30 14:21:33,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-30 14:21:33,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:33,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 141 [2024-01-30 14:21:33,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:33,506 INFO L124 PetriNetUnfolderBase]: 653/3055 cut-off events. [2024-01-30 14:21:33,506 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-01-30 14:21:33,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 3055 events. 653/3055 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 25147 event pairs, 511 based on Foata normal form. 61/2827 useless extension candidates. Maximal degree in co-relation 5417. Up to 1342 conditions per place. [2024-01-30 14:21:33,520 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 67 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-01-30 14:21:33,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 163 transitions, 598 flow [2024-01-30 14:21:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2024-01-30 14:21:33,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-01-30 14:21:33,526 INFO L175 Difference]: Start difference. First operand has 140 places, 144 transitions, 414 flow. Second operand 4 states and 424 transitions. [2024-01-30 14:21:33,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 163 transitions, 598 flow [2024-01-30 14:21:33,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 163 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:33,538 INFO L231 Difference]: Finished difference. Result has 138 places, 141 transitions, 380 flow [2024-01-30 14:21:33,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=138, PETRI_TRANSITIONS=141} [2024-01-30 14:21:33,539 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2024-01-30 14:21:33,539 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 141 transitions, 380 flow [2024-01-30 14:21:33,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-30 14:21:33,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:33,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:33,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:21:33,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:33,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash -404631865, now seen corresponding path program 1 times [2024-01-30 14:21:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302704098] [2024-01-30 14:21:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:33,609 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-30 14:21:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302704098] [2024-01-30 14:21:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302704098] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:33,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:21:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124234494] [2024-01-30 14:21:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:33,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:33,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:33,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 141 [2024-01-30 14:21:33,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 141 transitions, 380 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-30 14:21:33,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:33,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 141 [2024-01-30 14:21:33,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:34,141 INFO L124 PetriNetUnfolderBase]: 1180/4215 cut-off events. [2024-01-30 14:21:34,141 INFO L125 PetriNetUnfolderBase]: For 699/716 co-relation queries the response was YES. [2024-01-30 14:21:34,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 4215 events. 1180/4215 cut-off events. For 699/716 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 33913 event pairs, 162 based on Foata normal form. 56/4202 useless extension candidates. Maximal degree in co-relation 8021. Up to 2092 conditions per place. [2024-01-30 14:21:34,159 INFO L140 encePairwiseOnDemand]: 114/141 looper letters, 133 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2024-01-30 14:21:34,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 210 transitions, 872 flow [2024-01-30 14:21:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2024-01-30 14:21:34,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861702127659575 [2024-01-30 14:21:34,160 INFO L175 Difference]: Start difference. First operand has 138 places, 141 transitions, 380 flow. Second operand 4 states and 387 transitions. [2024-01-30 14:21:34,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 210 transitions, 872 flow [2024-01-30 14:21:34,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 210 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:34,166 INFO L231 Difference]: Finished difference. Result has 140 places, 154 transitions, 543 flow [2024-01-30 14:21:34,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=543, PETRI_PLACES=140, PETRI_TRANSITIONS=154} [2024-01-30 14:21:34,167 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2024-01-30 14:21:34,167 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 154 transitions, 543 flow [2024-01-30 14:21:34,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-30 14:21:34,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:34,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:34,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:21:34,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:34,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1585892582, now seen corresponding path program 1 times [2024-01-30 14:21:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495109577] [2024-01-30 14:21:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:34,239 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-30 14:21:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495109577] [2024-01-30 14:21:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495109577] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:21:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553877810] [2024-01-30 14:21:34,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:34,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:34,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:34,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:34,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:34,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2024-01-30 14:21:34,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 154 transitions, 543 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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-30 14:21:34,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:34,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2024-01-30 14:21:34,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:34,690 INFO L124 PetriNetUnfolderBase]: 1114/3782 cut-off events. [2024-01-30 14:21:34,691 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2024-01-30 14:21:34,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8116 conditions, 3782 events. 1114/3782 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 29521 event pairs, 164 based on Foata normal form. 75/3779 useless extension candidates. Maximal degree in co-relation 8099. Up to 1350 conditions per place. [2024-01-30 14:21:34,707 INFO L140 encePairwiseOnDemand]: 118/141 looper letters, 122 selfloop transitions, 28 changer transitions 0/199 dead transitions. [2024-01-30 14:21:34,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 199 transitions, 955 flow [2024-01-30 14:21:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2024-01-30 14:21:34,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-30 14:21:34,709 INFO L175 Difference]: Start difference. First operand has 140 places, 154 transitions, 543 flow. Second operand 4 states and 329 transitions. [2024-01-30 14:21:34,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 199 transitions, 955 flow [2024-01-30 14:21:34,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 199 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:34,713 INFO L231 Difference]: Finished difference. Result has 135 places, 148 transitions, 567 flow [2024-01-30 14:21:34,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=135, PETRI_TRANSITIONS=148} [2024-01-30 14:21:34,714 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -3 predicate places. [2024-01-30 14:21:34,714 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 148 transitions, 567 flow [2024-01-30 14:21:34,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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-30 14:21:34,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:34,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:34,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:21:34,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:34,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1443763574, now seen corresponding path program 1 times [2024-01-30 14:21:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:34,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840972659] [2024-01-30 14:21:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:34,758 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-30 14:21:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840972659] [2024-01-30 14:21:34,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840972659] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:34,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:34,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997399239] [2024-01-30 14:21:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:34,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:21:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:21:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:21:34,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 141 [2024-01-30 14:21:34,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 148 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 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-30 14:21:34,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:34,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 141 [2024-01-30 14:21:34,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:35,220 INFO L124 PetriNetUnfolderBase]: 1107/3673 cut-off events. [2024-01-30 14:21:35,220 INFO L125 PetriNetUnfolderBase]: For 2205/2221 co-relation queries the response was YES. [2024-01-30 14:21:35,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 3673 events. 1107/3673 cut-off events. For 2205/2221 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 27773 event pairs, 646 based on Foata normal form. 0/3634 useless extension candidates. Maximal degree in co-relation 8055. Up to 1841 conditions per place. [2024-01-30 14:21:35,234 INFO L140 encePairwiseOnDemand]: 115/141 looper letters, 103 selfloop transitions, 36 changer transitions 5/190 dead transitions. [2024-01-30 14:21:35,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 190 transitions, 971 flow [2024-01-30 14:21:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:21:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:21:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2024-01-30 14:21:35,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6468085106382979 [2024-01-30 14:21:35,237 INFO L175 Difference]: Start difference. First operand has 135 places, 148 transitions, 567 flow. Second operand 5 states and 456 transitions. [2024-01-30 14:21:35,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 190 transitions, 971 flow [2024-01-30 14:21:35,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 190 transitions, 907 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-30 14:21:35,242 INFO L231 Difference]: Finished difference. Result has 128 places, 146 transitions, 589 flow [2024-01-30 14:21:35,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=128, PETRI_TRANSITIONS=146} [2024-01-30 14:21:35,243 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -10 predicate places. [2024-01-30 14:21:35,243 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 146 transitions, 589 flow [2024-01-30 14:21:35,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 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-30 14:21:35,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:35,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:35,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:21:35,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:35,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1918030378, now seen corresponding path program 1 times [2024-01-30 14:21:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137567412] [2024-01-30 14:21:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:35,334 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-30 14:21:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137567412] [2024-01-30 14:21:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137567412] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:35,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000680180] [2024-01-30 14:21:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:35,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:21:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:35,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:21:35,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:21:35,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 141 [2024-01-30 14:21:35,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 146 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-30 14:21:35,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:35,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 141 [2024-01-30 14:21:35,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:35,926 INFO L124 PetriNetUnfolderBase]: 1083/3448 cut-off events. [2024-01-30 14:21:35,926 INFO L125 PetriNetUnfolderBase]: For 2205/2205 co-relation queries the response was YES. [2024-01-30 14:21:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7785 conditions, 3448 events. 1083/3448 cut-off events. For 2205/2205 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 25179 event pairs, 135 based on Foata normal form. 222/3670 useless extension candidates. Maximal degree in co-relation 7767. Up to 1498 conditions per place. [2024-01-30 14:21:35,938 INFO L140 encePairwiseOnDemand]: 117/141 looper letters, 161 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2024-01-30 14:21:35,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 210 transitions, 1064 flow [2024-01-30 14:21:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:21:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:21:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2024-01-30 14:21:35,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5546099290780142 [2024-01-30 14:21:35,940 INFO L175 Difference]: Start difference. First operand has 128 places, 146 transitions, 589 flow. Second operand 5 states and 391 transitions. [2024-01-30 14:21:35,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 210 transitions, 1064 flow [2024-01-30 14:21:35,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 210 transitions, 1053 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:35,945 INFO L231 Difference]: Finished difference. Result has 127 places, 128 transitions, 483 flow [2024-01-30 14:21:35,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=127, PETRI_TRANSITIONS=128} [2024-01-30 14:21:35,946 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -11 predicate places. [2024-01-30 14:21:35,947 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 128 transitions, 483 flow [2024-01-30 14:21:35,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-30 14:21:35,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:35,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:21:35,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:35,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -476275162, now seen corresponding path program 1 times [2024-01-30 14:21:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047465244] [2024-01-30 14:21:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:36,000 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-30 14:21:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047465244] [2024-01-30 14:21:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047465244] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:36,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:21:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256918582] [2024-01-30 14:21:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:21:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:21:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:21:36,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 141 [2024-01-30 14:21:36,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 128 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-30 14:21:36,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:36,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 141 [2024-01-30 14:21:36,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:36,237 INFO L124 PetriNetUnfolderBase]: 587/2544 cut-off events. [2024-01-30 14:21:36,237 INFO L125 PetriNetUnfolderBase]: For 1688/1698 co-relation queries the response was YES. [2024-01-30 14:21:36,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 2544 events. 587/2544 cut-off events. For 1688/1698 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 20189 event pairs, 348 based on Foata normal form. 7/2470 useless extension candidates. Maximal degree in co-relation 5275. Up to 1101 conditions per place. [2024-01-30 14:21:36,244 INFO L140 encePairwiseOnDemand]: 127/141 looper letters, 78 selfloop transitions, 13 changer transitions 2/169 dead transitions. [2024-01-30 14:21:36,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 169 transitions, 819 flow [2024-01-30 14:21:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:21:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:21:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-01-30 14:21:36,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.851063829787234 [2024-01-30 14:21:36,246 INFO L175 Difference]: Start difference. First operand has 127 places, 128 transitions, 483 flow. Second operand 3 states and 360 transitions. [2024-01-30 14:21:36,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 169 transitions, 819 flow [2024-01-30 14:21:36,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 169 transitions, 780 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-30 14:21:36,255 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 536 flow [2024-01-30 14:21:36,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2024-01-30 14:21:36,256 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -11 predicate places. [2024-01-30 14:21:36,256 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 536 flow [2024-01-30 14:21:36,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-30 14:21:36,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:36,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:36,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:21:36,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:36,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -205365715, now seen corresponding path program 1 times [2024-01-30 14:21:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001303118] [2024-01-30 14:21:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:36,412 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-30 14:21:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:36,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001303118] [2024-01-30 14:21:36,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001303118] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:36,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:36,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:21:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746095015] [2024-01-30 14:21:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:21:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:21:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:21:36,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 141 [2024-01-30 14:21:36,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 536 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 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-30 14:21:36,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:36,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 141 [2024-01-30 14:21:36,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:36,623 INFO L124 PetriNetUnfolderBase]: 406/1830 cut-off events. [2024-01-30 14:21:36,624 INFO L125 PetriNetUnfolderBase]: For 1162/1180 co-relation queries the response was YES. [2024-01-30 14:21:36,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3990 conditions, 1830 events. 406/1830 cut-off events. For 1162/1180 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 13627 event pairs, 182 based on Foata normal form. 16/1781 useless extension candidates. Maximal degree in co-relation 3971. Up to 562 conditions per place. [2024-01-30 14:21:36,628 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 69 selfloop transitions, 8 changer transitions 15/166 dead transitions. [2024-01-30 14:21:36,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 166 transitions, 815 flow [2024-01-30 14:21:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2024-01-30 14:21:36,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8031914893617021 [2024-01-30 14:21:36,630 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 536 flow. Second operand 4 states and 453 transitions. [2024-01-30 14:21:36,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 166 transitions, 815 flow [2024-01-30 14:21:36,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 166 transitions, 789 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-01-30 14:21:36,634 INFO L231 Difference]: Finished difference. Result has 128 places, 132 transitions, 506 flow [2024-01-30 14:21:36,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=128, PETRI_TRANSITIONS=132} [2024-01-30 14:21:36,636 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -10 predicate places. [2024-01-30 14:21:36,636 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 132 transitions, 506 flow [2024-01-30 14:21:36,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 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-30 14:21:36,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:36,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:36,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:21:36,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:36,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1838085288, now seen corresponding path program 1 times [2024-01-30 14:21:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:36,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424264305] [2024-01-30 14:21:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:36,734 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-30 14:21:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424264305] [2024-01-30 14:21:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424264305] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:36,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:21:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132255545] [2024-01-30 14:21:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:36,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:21:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:21:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:21:36,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 141 [2024-01-30 14:21:36,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 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-30 14:21:36,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:36,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 141 [2024-01-30 14:21:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:37,204 INFO L124 PetriNetUnfolderBase]: 768/2372 cut-off events. [2024-01-30 14:21:37,205 INFO L125 PetriNetUnfolderBase]: For 1582/1582 co-relation queries the response was YES. [2024-01-30 14:21:37,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5904 conditions, 2372 events. 768/2372 cut-off events. For 1582/1582 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 15699 event pairs, 372 based on Foata normal form. 206/2573 useless extension candidates. Maximal degree in co-relation 5883. Up to 1186 conditions per place. [2024-01-30 14:21:37,211 INFO L140 encePairwiseOnDemand]: 116/141 looper letters, 145 selfloop transitions, 23 changer transitions 19/214 dead transitions. [2024-01-30 14:21:37,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 214 transitions, 1184 flow [2024-01-30 14:21:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-30 14:21:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-30 14:21:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 419 transitions. [2024-01-30 14:21:37,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49527186761229314 [2024-01-30 14:21:37,214 INFO L175 Difference]: Start difference. First operand has 128 places, 132 transitions, 506 flow. Second operand 6 states and 419 transitions. [2024-01-30 14:21:37,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 214 transitions, 1184 flow [2024-01-30 14:21:37,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 214 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:21:37,218 INFO L231 Difference]: Finished difference. Result has 129 places, 127 transitions, 555 flow [2024-01-30 14:21:37,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=127} [2024-01-30 14:21:37,219 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -9 predicate places. [2024-01-30 14:21:37,220 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 127 transitions, 555 flow [2024-01-30 14:21:37,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 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-30 14:21:37,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:37,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:37,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:21:37,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:37,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash 376341348, now seen corresponding path program 1 times [2024-01-30 14:21:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:37,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455735673] [2024-01-30 14:21:37,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:37,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:21:37,343 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-30 14:21:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:21:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455735673] [2024-01-30 14:21:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455735673] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:21:37,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:21:37,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:21:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62461015] [2024-01-30 14:21:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:21:37,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:21:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:21:37,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:21:37,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:21:37,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 141 [2024-01-30 14:21:37,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 127 transitions, 555 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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-30 14:21:37,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:21:37,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 141 [2024-01-30 14:21:37,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:21:37,499 INFO L124 PetriNetUnfolderBase]: 193/1063 cut-off events. [2024-01-30 14:21:37,499 INFO L125 PetriNetUnfolderBase]: For 1111/1124 co-relation queries the response was YES. [2024-01-30 14:21:37,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1063 events. 193/1063 cut-off events. For 1111/1124 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6578 event pairs, 72 based on Foata normal form. 54/1089 useless extension candidates. Maximal degree in co-relation 2550. Up to 303 conditions per place. [2024-01-30 14:21:37,504 INFO L140 encePairwiseOnDemand]: 123/141 looper letters, 36 selfloop transitions, 21 changer transitions 10/138 dead transitions. [2024-01-30 14:21:37,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 138 transitions, 736 flow [2024-01-30 14:21:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:21:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:21:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2024-01-30 14:21:37,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7730496453900709 [2024-01-30 14:21:37,506 INFO L175 Difference]: Start difference. First operand has 129 places, 127 transitions, 555 flow. Second operand 4 states and 436 transitions. [2024-01-30 14:21:37,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 138 transitions, 736 flow [2024-01-30 14:21:37,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 138 transitions, 677 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-01-30 14:21:37,510 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 527 flow [2024-01-30 14:21:37,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2024-01-30 14:21:37,511 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -18 predicate places. [2024-01-30 14:21:37,511 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 527 flow [2024-01-30 14:21:37,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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-30 14:21:37,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:21:37,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:37,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:21:37,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 52 more)] === [2024-01-30 14:21:37,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:21:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash -409559005, now seen corresponding path program 1 times [2024-01-30 14:21:37,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:21:37,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195585645] [2024-01-30 14:21:37,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:21:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:21:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:21:37,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:21:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:21:37,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:21:37,577 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:21:37,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 55 remaining) [2024-01-30 14:21:37,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 55 remaining) [2024-01-30 14:21:37,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 55 remaining) [2024-01-30 14:21:37,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (51 of 55 remaining) [2024-01-30 14:21:37,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 55 remaining) [2024-01-30 14:21:37,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 55 remaining) [2024-01-30 14:21:37,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 55 remaining) [2024-01-30 14:21:37,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 55 remaining) [2024-01-30 14:21:37,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (46 of 55 remaining) [2024-01-30 14:21:37,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 55 remaining) [2024-01-30 14:21:37,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 55 remaining) [2024-01-30 14:21:37,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 55 remaining) [2024-01-30 14:21:37,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (42 of 55 remaining) [2024-01-30 14:21:37,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 55 remaining) [2024-01-30 14:21:37,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 55 remaining) [2024-01-30 14:21:37,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 55 remaining) [2024-01-30 14:21:37,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 55 remaining) [2024-01-30 14:21:37,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (37 of 55 remaining) [2024-01-30 14:21:37,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 55 remaining) [2024-01-30 14:21:37,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 55 remaining) [2024-01-30 14:21:37,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 55 remaining) [2024-01-30 14:21:37,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 55 remaining) [2024-01-30 14:21:37,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 55 remaining) [2024-01-30 14:21:37,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 55 remaining) [2024-01-30 14:21:37,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 55 remaining) [2024-01-30 14:21:37,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 55 remaining) [2024-01-30 14:21:37,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 55 remaining) [2024-01-30 14:21:37,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 55 remaining) [2024-01-30 14:21:37,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 55 remaining) [2024-01-30 14:21:37,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 55 remaining) [2024-01-30 14:21:37,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 55 remaining) [2024-01-30 14:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 55 remaining) [2024-01-30 14:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 55 remaining) [2024-01-30 14:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 55 remaining) [2024-01-30 14:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 55 remaining) [2024-01-30 14:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 55 remaining) [2024-01-30 14:21:37,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 55 remaining) [2024-01-30 14:21:37,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 55 remaining) [2024-01-30 14:21:37,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 55 remaining) [2024-01-30 14:21:37,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 55 remaining) [2024-01-30 14:21:37,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 55 remaining) [2024-01-30 14:21:37,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 55 remaining) [2024-01-30 14:21:37,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 55 remaining) [2024-01-30 14:21:37,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 55 remaining) [2024-01-30 14:21:37,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 55 remaining) [2024-01-30 14:21:37,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 55 remaining) [2024-01-30 14:21:37,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 55 remaining) [2024-01-30 14:21:37,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 55 remaining) [2024-01-30 14:21:37,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 55 remaining) [2024-01-30 14:21:37,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:21:37,589 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:21:37,598 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:21:37,598 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:21:37,639 INFO L503 ceAbstractionStarter]: Automizer considered 33 witness invariants [2024-01-30 14:21:37,639 INFO L504 ceAbstractionStarter]: WitnessConsidered=33 [2024-01-30 14:21:37,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:21:37 BasicIcfg [2024-01-30 14:21:37,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:21:37,640 INFO L158 Benchmark]: Toolchain (without parser) took 6990.22ms. Allocated memory was 134.2MB in the beginning and 518.0MB in the end (delta: 383.8MB). Free memory was 74.8MB in the beginning and 297.2MB in the end (delta: -222.4MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. [2024-01-30 14:21:37,640 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 99.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:37,640 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:37,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.85ms. Allocated memory is still 134.2MB. Free memory was 74.8MB in the beginning and 49.2MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-30 14:21:37,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.11ms. Allocated memory is still 134.2MB. Free memory was 49.2MB in the beginning and 47.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:21:37,641 INFO L158 Benchmark]: Boogie Preprocessor took 43.21ms. Allocated memory is still 134.2MB. Free memory was 47.1MB in the beginning and 44.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:21:37,641 INFO L158 Benchmark]: RCFGBuilder took 595.33ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 44.3MB in the beginning and 100.9MB in the end (delta: -56.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-01-30 14:21:37,641 INFO L158 Benchmark]: TraceAbstraction took 5723.18ms. Allocated memory was 174.1MB in the beginning and 518.0MB in the end (delta: 343.9MB). Free memory was 99.8MB in the beginning and 297.2MB in the end (delta: -197.5MB). Peak memory consumption was 145.3MB. Max. memory is 16.1GB. [2024-01-30 14:21:37,642 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 134.2MB. Free memory was 99.9MB in the beginning and 99.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.85ms. Allocated memory is still 134.2MB. Free memory was 74.8MB in the beginning and 49.2MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.11ms. Allocated memory is still 134.2MB. Free memory was 49.2MB in the beginning and 47.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.21ms. Allocated memory is still 134.2MB. Free memory was 47.1MB in the beginning and 44.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 595.33ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 44.3MB in the beginning and 100.9MB in the end (delta: -56.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5723.18ms. Allocated memory was 174.1MB in the beginning and 518.0MB in the end (delta: 343.9MB). Free memory was 99.8MB in the beginning and 297.2MB in the end (delta: -197.5MB). Peak memory consumption was 145.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 709]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L681] 0 int g1,g2; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L705] 0 pthread_t id; VAL [__global_lock={5:0}, g1=0, g2=0, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] [L706] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={5:0}, arg={0:0}, g1=0, g2=0, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L688] 1 g1++ VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=1, g2=0, mutex1={3:0}, mutex2={4:0}] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L691] 1 g1-- VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L692] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L693] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L694] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L695] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=0, mutex1={3:0}, mutex2={4:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L696] 1 g2++ VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, mutex1={3:0}, mutex2={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, mutex1={3:0}, mutex2={4:0}] [L708] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, id={6:0}, mutex1={3:0}, mutex2={4:0}] [L709] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g2],IntegerLiteral[0]]]]] VAL [__global_lock={5:0}, arg={0:0}, arg={0:0}, g1=0, g2=1, id={6:0}, mutex1={3:0}, mutex2={4:0}] - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 199 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1655 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1247 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2319 IncrementalHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 39 mSDtfsCounter, 2319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:21:37,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE