./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-d8006e4-m [2024-02-05 10:31:41,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:31:42,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:31:42,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:31:42,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:31:42,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:31:42,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:31:42,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:31:42,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:31:42,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:31:42,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:31:42,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:31:42,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:31:42,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:31:42,113 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:31:42,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:31:42,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:31:42,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:31:42,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:31:42,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:31:42,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:31:42,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:31:42,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:31:42,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:31:42,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:31:42,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:31:42,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:31:42,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:31:42,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:31:42,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:31:42,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:31:42,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:31:42,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:31:42,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:31:42,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:31:42,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:31:42,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:31:42,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:31:42,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:31:42,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:31:42,122 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:31:42,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:31:42,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:31:42,123 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-05 10:31:42,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:31:42,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:31:42,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:31:42,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:31:42,393 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:31:42,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-02-05 10:31:43,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:31:43,765 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:31:43,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-02-05 10:31:43,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80c14487/b1f11355c5fd43f2bccc01bc819c0ad0/FLAG2e413b193 [2024-02-05 10:31:43,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80c14487/b1f11355c5fd43f2bccc01bc819c0ad0 [2024-02-05 10:31:43,789 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:31:43,790 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:31:43,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml [2024-02-05 10:31:43,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:31:43,916 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:31:43,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:31:43,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:31:43,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:31:43,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:43" (1/2) ... [2024-02-05 10:31:43,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299e5281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:43, skipping insertion in model container [2024-02-05 10:31:43,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:43" (1/2) ... [2024-02-05 10:31:43,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@319f4eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:43, skipping insertion in model container [2024-02-05 10:31:43,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:31:43" (2/2) ... [2024-02-05 10:31:43,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299e5281 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:43, skipping insertion in model container [2024-02-05 10:31:43,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:31:43" (2/2) ... [2024-02-05 10:31:43,932 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:31:43,964 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:31:43,966 INFO L101 nessWitnessExtractor]: Loop invariant at [L56-L56] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,966 INFO L101 nessWitnessExtractor]: Location invariant before [L79-L79] ((x3 == 0U) && (x4 == 0U)) && (n == 0U) [2024-02-05 10:31:43,966 INFO L101 nessWitnessExtractor]: Loop invariant at [L47-L47] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,966 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,966 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,967 INFO L101 nessWitnessExtractor]: Location invariant before [L81-L81] n == 0U [2024-02-05 10:31:43,967 INFO L101 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,967 INFO L101 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,968 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,968 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,968 INFO L101 nessWitnessExtractor]: Location invariant before [L77-L77] (((((((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL)) && (x1 == 0U)) && (x2 == 0U)) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-02-05 10:31:43,968 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,968 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,969 INFO L101 nessWitnessExtractor]: Location invariant before [L80-L80] (x4 == 0U) && (n == 0U) [2024-02-05 10:31:43,969 INFO L101 nessWitnessExtractor]: Loop invariant at [L65-L65] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,969 INFO L101 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,969 INFO L101 nessWitnessExtractor]: Loop invariant at [L38-L38] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,969 INFO L101 nessWitnessExtractor]: Location invariant before [L40-L40] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,969 INFO L101 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,970 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-05 10:31:43,970 INFO L101 nessWitnessExtractor]: Location invariant before [L78-L78] (((x2 == 0U) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-02-05 10:31:43,994 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:31:44,197 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-02-05 10:31:44,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:31:44,218 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-05 10:31:44,272 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-02-05 10:31:44,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:31:44,287 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:31:44,287 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44 WrapperNode [2024-02-05 10:31:44,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:31:44,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:31:44,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:31:44,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:31:44,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,350 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-02-05 10:31:44,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:31:44,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:31:44,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:31:44,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:31:44,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,415 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-05 10:31:44,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:31:44,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:31:44,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:31:44,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:31:44,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (1/1) ... [2024-02-05 10:31:44,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:31:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:44,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-05 10:31:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-05 10:31:44,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:31:44,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:31:44,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:31:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:31:44,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:31:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-05 10:31:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-05 10:31:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-05 10:31:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-05 10:31:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:31:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:31:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:31:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:31:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-05 10:31:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:31:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:31:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:31:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:31:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:31:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-05 10:31:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:31:44,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:31:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:31:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:31:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:31:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:31:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-05 10:31:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:31:44,529 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:31:44,662 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:31:44,664 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:31:44,983 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:31:44,986 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:31:45,139 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:31:45,139 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-05 10:31:45,140 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:31:45 BoogieIcfgContainer [2024-02-05 10:31:45,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:31:45,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:31:45,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:31:45,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:31:45,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:31:43" (1/4) ... [2024-02-05 10:31:45,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@929307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:31:45, skipping insertion in model container [2024-02-05 10:31:45,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:31:43" (2/4) ... [2024-02-05 10:31:45,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@929307 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:31:45, skipping insertion in model container [2024-02-05 10:31:45,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:44" (3/4) ... [2024-02-05 10:31:45,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@929307 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:31:45, skipping insertion in model container [2024-02-05 10:31:45,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:31:45" (4/4) ... [2024-02-05 10:31:45,174 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-02-05 10:31:45,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:31:45,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-02-05 10:31:45,193 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:31:45,292 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-05 10:31:45,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 190 flow [2024-02-05 10:31:45,381 INFO L124 PetriNetUnfolderBase]: 8/77 cut-off events. [2024-02-05 10:31:45,382 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-05 10:31:45,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 77 events. 8/77 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-02-05 10:31:45,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 81 transitions, 190 flow [2024-02-05 10:31:45,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 176 flow [2024-02-05 10:31:45,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:31:45,409 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;@67549211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:31:45,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-02-05 10:31:45,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:31:45,412 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:31:45,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:31:45,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:45,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:31:45,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:45,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash 11727, now seen corresponding path program 1 times [2024-02-05 10:31:45,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:45,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542350690] [2024-02-05 10:31:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542350690] [2024-02-05 10:31:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542350690] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:31:45,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281350285] [2024-02-05 10:31:45,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:46,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:46,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 81 [2024-02-05 10:31:46,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:46,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:46,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 81 [2024-02-05 10:31:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:47,499 INFO L124 PetriNetUnfolderBase]: 7159/12076 cut-off events. [2024-02-05 10:31:47,500 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-02-05 10:31:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21533 conditions, 12076 events. 7159/12076 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94775 event pairs, 4547 based on Foata normal form. 2553/13440 useless extension candidates. Maximal degree in co-relation 18658. Up to 8983 conditions per place. [2024-02-05 10:31:47,736 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 40 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-02-05 10:31:47,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 250 flow [2024-02-05 10:31:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-05 10:31:47,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6008230452674898 [2024-02-05 10:31:47,752 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 176 flow. Second operand 3 states and 146 transitions. [2024-02-05 10:31:47,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 250 flow [2024-02-05 10:31:47,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 234 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-05 10:31:47,768 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 154 flow [2024-02-05 10:31:47,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2024-02-05 10:31:47,773 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -7 predicate places. [2024-02-05 10:31:47,774 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 154 flow [2024-02-05 10:31:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:47,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:47,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-05 10:31:47,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:31:47,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:47,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash 363897, now seen corresponding path program 1 times [2024-02-05 10:31:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:47,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928535110] [2024-02-05 10:31:47,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:47,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:47,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:47,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928535110] [2024-02-05 10:31:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928535110] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:31:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264114783] [2024-02-05 10:31:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:47,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:47,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 81 [2024-02-05 10:31:47,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:47,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:47,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 81 [2024-02-05 10:31:47,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:49,016 INFO L124 PetriNetUnfolderBase]: 7159/12075 cut-off events. [2024-02-05 10:31:49,017 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-05 10:31:49,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21218 conditions, 12075 events. 7159/12075 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94722 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21209. Up to 8981 conditions per place. [2024-02-05 10:31:49,097 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 39 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-02-05 10:31:49,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 234 flow [2024-02-05 10:31:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2024-02-05 10:31:49,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-02-05 10:31:49,104 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 154 flow. Second operand 3 states and 144 transitions. [2024-02-05 10:31:49,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 234 flow [2024-02-05 10:31:49,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:49,107 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 152 flow [2024-02-05 10:31:49,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-02-05 10:31:49,108 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2024-02-05 10:31:49,109 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 152 flow [2024-02-05 10:31:49,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:49,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:49,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-05 10:31:49,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:31:49,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:49,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 11281214, now seen corresponding path program 1 times [2024-02-05 10:31:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454573645] [2024-02-05 10:31:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454573645] [2024-02-05 10:31:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454573645] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:31:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083068075] [2024-02-05 10:31:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:49,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:49,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2024-02-05 10:31:49,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:49,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:49,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2024-02-05 10:31:49,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:50,300 INFO L124 PetriNetUnfolderBase]: 7159/12074 cut-off events. [2024-02-05 10:31:50,301 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-05 10:31:50,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21216 conditions, 12074 events. 7159/12074 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94742 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21205. Up to 8979 conditions per place. [2024-02-05 10:31:50,402 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 38 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-05 10:31:50,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 230 flow [2024-02-05 10:31:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-05 10:31:50,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6008230452674898 [2024-02-05 10:31:50,405 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 152 flow. Second operand 3 states and 146 transitions. [2024-02-05 10:31:50,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 230 flow [2024-02-05 10:31:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:50,409 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 150 flow [2024-02-05 10:31:50,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-02-05 10:31:50,410 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -9 predicate places. [2024-02-05 10:31:50,410 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 150 flow [2024-02-05 10:31:50,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:50,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:50,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:31:50,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:31:50,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:50,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 349717991, now seen corresponding path program 1 times [2024-02-05 10:31:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035372797] [2024-02-05 10:31:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035372797] [2024-02-05 10:31:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035372797] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:50,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:50,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:31:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539925229] [2024-02-05 10:31:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:50,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 81 [2024-02-05 10:31:50,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:50,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:50,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 81 [2024-02-05 10:31:50,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:51,427 INFO L124 PetriNetUnfolderBase]: 7159/12073 cut-off events. [2024-02-05 10:31:51,427 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-05 10:31:51,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21214 conditions, 12073 events. 7159/12073 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94724 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21201. Up to 8977 conditions per place. [2024-02-05 10:31:51,515 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 37 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-05 10:31:51,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 226 flow [2024-02-05 10:31:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-02-05 10:31:51,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6090534979423868 [2024-02-05 10:31:51,517 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 150 flow. Second operand 3 states and 148 transitions. [2024-02-05 10:31:51,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 226 flow [2024-02-05 10:31:51,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:51,522 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 148 flow [2024-02-05 10:31:51,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-02-05 10:31:51,524 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -10 predicate places. [2024-02-05 10:31:51,525 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 148 flow [2024-02-05 10:31:51,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:51,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:51,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-05 10:31:51,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:31:51,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:51,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2043643756, now seen corresponding path program 1 times [2024-02-05 10:31:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290671035] [2024-02-05 10:31:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290671035] [2024-02-05 10:31:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290671035] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:31:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218020906] [2024-02-05 10:31:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:51,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:51,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:51,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-02-05 10:31:51,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:51,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:51,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-02-05 10:31:51,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:52,522 INFO L124 PetriNetUnfolderBase]: 7159/12072 cut-off events. [2024-02-05 10:31:52,522 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-05 10:31:52,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21212 conditions, 12072 events. 7159/12072 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94718 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21197. Up to 8975 conditions per place. [2024-02-05 10:31:52,600 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 36 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-02-05 10:31:52,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 222 flow [2024-02-05 10:31:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-02-05 10:31:52,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2024-02-05 10:31:52,602 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 148 flow. Second operand 3 states and 150 transitions. [2024-02-05 10:31:52,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 222 flow [2024-02-05 10:31:52,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:52,604 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 146 flow [2024-02-05 10:31:52,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-02-05 10:31:52,605 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -11 predicate places. [2024-02-05 10:31:52,605 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 146 flow [2024-02-05 10:31:52,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:52,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:52,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:52,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:31:52,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:52,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1029244279, now seen corresponding path program 1 times [2024-02-05 10:31:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481808711] [2024-02-05 10:31:52,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481808711] [2024-02-05 10:31:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481808711] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352265843] [2024-02-05 10:31:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:52,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:52,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-02-05 10:31:52,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:52,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:52,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-02-05 10:31:52,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:53,069 INFO L124 PetriNetUnfolderBase]: 3215/5330 cut-off events. [2024-02-05 10:31:53,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:31:53,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9478 conditions, 5330 events. 3215/5330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 37041 event pairs, 271 based on Foata normal form. 170/4841 useless extension candidates. Maximal degree in co-relation 9461. Up to 3435 conditions per place. [2024-02-05 10:31:53,115 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 49 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-02-05 10:31:53,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 275 flow [2024-02-05 10:31:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:31:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:31:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2024-02-05 10:31:53,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2024-02-05 10:31:53,117 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 146 flow. Second operand 4 states and 203 transitions. [2024-02-05 10:31:53,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 275 flow [2024-02-05 10:31:53,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:53,122 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 138 flow [2024-02-05 10:31:53,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-02-05 10:31:53,125 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2024-02-05 10:31:53,125 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 138 flow [2024-02-05 10:31:53,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:53,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:53,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:31:53,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:53,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1262851629, now seen corresponding path program 1 times [2024-02-05 10:31:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437502] [2024-02-05 10:31:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437502] [2024-02-05 10:31:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437502] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258276602] [2024-02-05 10:31:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:53,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:53,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:53,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:53,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-02-05 10:31:53,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-02-05 10:31:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:53,751 INFO L124 PetriNetUnfolderBase]: 3186/5869 cut-off events. [2024-02-05 10:31:53,751 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-02-05 10:31:53,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9988 conditions, 5869 events. 3186/5869 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 44156 event pairs, 968 based on Foata normal form. 200/5334 useless extension candidates. Maximal degree in co-relation 9967. Up to 3278 conditions per place. [2024-02-05 10:31:53,790 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 52 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-02-05 10:31:53,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 279 flow [2024-02-05 10:31:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:31:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:31:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2024-02-05 10:31:53,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-02-05 10:31:53,792 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 138 flow. Second operand 4 states and 206 transitions. [2024-02-05 10:31:53,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 279 flow [2024-02-05 10:31:53,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:53,795 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 131 flow [2024-02-05 10:31:53,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-02-05 10:31:53,795 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -17 predicate places. [2024-02-05 10:31:53,796 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 131 flow [2024-02-05 10:31:53,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:53,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:53,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:53,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:31:53,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:53,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1873504155, now seen corresponding path program 1 times [2024-02-05 10:31:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108015408] [2024-02-05 10:31:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108015408] [2024-02-05 10:31:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108015408] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:53,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:53,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949837924] [2024-02-05 10:31:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:53,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:53,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-02-05 10:31:53,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:53,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:53,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-02-05 10:31:53,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:54,238 INFO L124 PetriNetUnfolderBase]: 3146/5099 cut-off events. [2024-02-05 10:31:54,238 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-02-05 10:31:54,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9177 conditions, 5099 events. 3146/5099 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 33793 event pairs, 126 based on Foata normal form. 200/4775 useless extension candidates. Maximal degree in co-relation 9157. Up to 3162 conditions per place. [2024-02-05 10:31:54,272 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 55 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-02-05 10:31:54,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 284 flow [2024-02-05 10:31:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:31:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:31:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-02-05 10:31:54,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6450617283950617 [2024-02-05 10:31:54,274 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 131 flow. Second operand 4 states and 209 transitions. [2024-02-05 10:31:54,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 284 flow [2024-02-05 10:31:54,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:54,277 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 124 flow [2024-02-05 10:31:54,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-02-05 10:31:54,281 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -20 predicate places. [2024-02-05 10:31:54,281 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 124 flow [2024-02-05 10:31:54,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:54,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:54,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:31:54,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:54,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash 845398480, now seen corresponding path program 1 times [2024-02-05 10:31:54,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:54,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037466495] [2024-02-05 10:31:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037466495] [2024-02-05 10:31:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037466495] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:54,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857162189] [2024-02-05 10:31:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:54,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:54,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:54,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:54,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:54,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-02-05 10:31:54,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:54,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:54,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-02-05 10:31:54,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:54,785 INFO L124 PetriNetUnfolderBase]: 3228/4961 cut-off events. [2024-02-05 10:31:54,785 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-02-05 10:31:54,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 4961 events. 3228/4961 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 30812 event pairs, 323 based on Foata normal form. 170/4681 useless extension candidates. Maximal degree in co-relation 9129. Up to 2710 conditions per place. [2024-02-05 10:31:54,810 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 58 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-02-05 10:31:54,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 289 flow [2024-02-05 10:31:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:31:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:31:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-02-05 10:31:54,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-02-05 10:31:54,812 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 124 flow. Second operand 4 states and 212 transitions. [2024-02-05 10:31:54,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 289 flow [2024-02-05 10:31:54,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:54,815 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 117 flow [2024-02-05 10:31:54,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-02-05 10:31:54,816 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -23 predicate places. [2024-02-05 10:31:54,816 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 117 flow [2024-02-05 10:31:54,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:54,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:54,817 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] [2024-02-05 10:31:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:31:54,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:54,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1458738582, now seen corresponding path program 1 times [2024-02-05 10:31:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982356451] [2024-02-05 10:31:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982356451] [2024-02-05 10:31:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982356451] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85227113] [2024-02-05 10:31:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:55,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:55,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 81 [2024-02-05 10:31:55,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:55,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:55,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 81 [2024-02-05 10:31:55,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:55,399 INFO L124 PetriNetUnfolderBase]: 3654/6002 cut-off events. [2024-02-05 10:31:55,400 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-02-05 10:31:55,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 6002 events. 3654/6002 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 40123 event pairs, 589 based on Foata normal form. 1/5324 useless extension candidates. Maximal degree in co-relation 10758. Up to 4384 conditions per place. [2024-02-05 10:31:55,433 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 48 selfloop transitions, 7 changer transitions 1/73 dead transitions. [2024-02-05 10:31:55,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 282 flow [2024-02-05 10:31:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-02-05 10:31:55,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-02-05 10:31:55,435 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 117 flow. Second operand 3 states and 183 transitions. [2024-02-05 10:31:55,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 282 flow [2024-02-05 10:31:55,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:55,438 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 153 flow [2024-02-05 10:31:55,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-02-05 10:31:55,438 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -22 predicate places. [2024-02-05 10:31:55,439 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 153 flow [2024-02-05 10:31:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:55,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:55,439 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:55,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:31:55,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:55,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1162734183, now seen corresponding path program 1 times [2024-02-05 10:31:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992317086] [2024-02-05 10:31:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992317086] [2024-02-05 10:31:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992317086] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:31:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193489366] [2024-02-05 10:31:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:55,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:55,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:31:55,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:55,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:55,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:31:55,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:56,619 INFO L124 PetriNetUnfolderBase]: 10159/15230 cut-off events. [2024-02-05 10:31:56,619 INFO L125 PetriNetUnfolderBase]: For 2984/3484 co-relation queries the response was YES. [2024-02-05 10:31:56,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32084 conditions, 15230 events. 10159/15230 cut-off events. For 2984/3484 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 105119 event pairs, 2359 based on Foata normal form. 22/12897 useless extension candidates. Maximal degree in co-relation 32059. Up to 5037 conditions per place. [2024-02-05 10:31:56,730 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 96 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2024-02-05 10:31:56,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 562 flow [2024-02-05 10:31:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:31:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:31:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2024-02-05 10:31:56,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2024-02-05 10:31:56,733 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 153 flow. Second operand 5 states and 294 transitions. [2024-02-05 10:31:56,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 562 flow [2024-02-05 10:31:56,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 124 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:31:56,736 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 244 flow [2024-02-05 10:31:56,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-02-05 10:31:56,737 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2024-02-05 10:31:56,737 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 244 flow [2024-02-05 10:31:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:56,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:56,737 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:56,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-05 10:31:56,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:56,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1642145201, now seen corresponding path program 2 times [2024-02-05 10:31:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428215057] [2024-02-05 10:31:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428215057] [2024-02-05 10:31:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428215057] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:31:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548179538] [2024-02-05 10:31:56,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:31:56,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:56,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:31:56,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-05 10:31:56,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:31:56,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:31:56,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-05 10:31:56,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:31:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:57,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:31:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548179538] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:31:57,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:31:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-05 10:31:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835977221] [2024-02-05 10:31:57,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:31:57,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:31:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:31:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:31:57,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:31:57,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:57,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:57,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:31:57,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:58,678 INFO L124 PetriNetUnfolderBase]: 11125/15933 cut-off events. [2024-02-05 10:31:58,679 INFO L125 PetriNetUnfolderBase]: For 10584/10684 co-relation queries the response was YES. [2024-02-05 10:31:58,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39874 conditions, 15933 events. 11125/15933 cut-off events. For 10584/10684 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 102552 event pairs, 1776 based on Foata normal form. 342/15414 useless extension candidates. Maximal degree in co-relation 39842. Up to 6392 conditions per place. [2024-02-05 10:31:58,857 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 145 selfloop transitions, 21 changer transitions 0/179 dead transitions. [2024-02-05 10:31:58,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 179 transitions, 911 flow [2024-02-05 10:31:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-05 10:31:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-05 10:31:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 499 transitions. [2024-02-05 10:31:58,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844993141289437 [2024-02-05 10:31:58,860 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 244 flow. Second operand 9 states and 499 transitions. [2024-02-05 10:31:58,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 179 transitions, 911 flow [2024-02-05 10:31:58,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 911 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-05 10:31:58,870 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 391 flow [2024-02-05 10:31:58,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=391, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-02-05 10:31:58,870 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2024-02-05 10:31:58,871 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 391 flow [2024-02-05 10:31:58,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:58,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:58,871 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:58,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-05 10:31:59,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-02-05 10:31:59,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:31:59,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 269701643, now seen corresponding path program 1 times [2024-02-05 10:31:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415102628] [2024-02-05 10:31:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:59,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:59,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415102628] [2024-02-05 10:31:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415102628] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:31:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571824705] [2024-02-05 10:31:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:59,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:59,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:31:59,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:59,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:59,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:31:59,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:00,421 INFO L124 PetriNetUnfolderBase]: 10837/16305 cut-off events. [2024-02-05 10:32:00,421 INFO L125 PetriNetUnfolderBase]: For 25374/25545 co-relation queries the response was YES. [2024-02-05 10:32:00,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44310 conditions, 16305 events. 10837/16305 cut-off events. For 25374/25545 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 114488 event pairs, 2900 based on Foata normal form. 160/15288 useless extension candidates. Maximal degree in co-relation 44268. Up to 7669 conditions per place. [2024-02-05 10:32:00,522 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 107 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-02-05 10:32:00,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 789 flow [2024-02-05 10:32:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:32:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:32:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2024-02-05 10:32:00,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7209876543209877 [2024-02-05 10:32:00,524 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 391 flow. Second operand 5 states and 292 transitions. [2024-02-05 10:32:00,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 789 flow [2024-02-05 10:32:00,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 132 transitions, 775 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-02-05 10:32:00,558 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 422 flow [2024-02-05 10:32:00,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2024-02-05 10:32:00,559 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2024-02-05 10:32:00,559 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 422 flow [2024-02-05 10:32:00,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:00,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:00,560 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:00,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-05 10:32:00,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:32:00,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash -114063623, now seen corresponding path program 1 times [2024-02-05 10:32:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:00,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44633809] [2024-02-05 10:32:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:00,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44633809] [2024-02-05 10:32:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44633809] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:32:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913205056] [2024-02-05 10:32:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:00,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:32:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:32:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:32:00,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:32:00,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:00,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:00,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:32:00,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:02,301 INFO L124 PetriNetUnfolderBase]: 16654/23027 cut-off events. [2024-02-05 10:32:02,301 INFO L125 PetriNetUnfolderBase]: For 42414/50900 co-relation queries the response was YES. [2024-02-05 10:32:02,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61574 conditions, 23027 events. 16654/23027 cut-off events. For 42414/50900 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 148100 event pairs, 1337 based on Foata normal form. 609/20284 useless extension candidates. Maximal degree in co-relation 61524. Up to 9856 conditions per place. [2024-02-05 10:32:02,499 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 122 selfloop transitions, 15 changer transitions 0/162 dead transitions. [2024-02-05 10:32:02,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 162 transitions, 1152 flow [2024-02-05 10:32:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:32:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:32:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2024-02-05 10:32:02,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2024-02-05 10:32:02,502 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 422 flow. Second operand 5 states and 290 transitions. [2024-02-05 10:32:02,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 162 transitions, 1152 flow [2024-02-05 10:32:02,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 162 transitions, 1131 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-02-05 10:32:02,533 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 505 flow [2024-02-05 10:32:02,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=505, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2024-02-05 10:32:02,534 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2024-02-05 10:32:02,534 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 505 flow [2024-02-05 10:32:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:02,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:02,535 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:02,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-05 10:32:02,535 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:32:02,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1482865469, now seen corresponding path program 2 times [2024-02-05 10:32:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764048291] [2024-02-05 10:32:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:02,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764048291] [2024-02-05 10:32:02,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764048291] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:02,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:02,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:32:02,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268904898] [2024-02-05 10:32:02,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:02,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:32:02,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:02,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:32:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:32:02,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:32:02,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:02,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:02,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:32:02,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:04,528 INFO L124 PetriNetUnfolderBase]: 16146/22325 cut-off events. [2024-02-05 10:32:04,528 INFO L125 PetriNetUnfolderBase]: For 50396/58945 co-relation queries the response was YES. [2024-02-05 10:32:04,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68452 conditions, 22325 events. 16146/22325 cut-off events. For 50396/58945 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 142266 event pairs, 1636 based on Foata normal form. 1173/22484 useless extension candidates. Maximal degree in co-relation 68394. Up to 9632 conditions per place. [2024-02-05 10:32:04,667 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 128 selfloop transitions, 17 changer transitions 0/170 dead transitions. [2024-02-05 10:32:04,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 1259 flow [2024-02-05 10:32:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:32:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:32:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 293 transitions. [2024-02-05 10:32:04,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7234567901234568 [2024-02-05 10:32:04,670 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 505 flow. Second operand 5 states and 293 transitions. [2024-02-05 10:32:04,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 1259 flow [2024-02-05 10:32:04,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 170 transitions, 1259 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-05 10:32:04,693 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 614 flow [2024-02-05 10:32:04,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=614, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2024-02-05 10:32:04,694 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 17 predicate places. [2024-02-05 10:32:04,694 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 614 flow [2024-02-05 10:32:04,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:04,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:04,695 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-05 10:32:04,695 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:32:04,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash 107448667, now seen corresponding path program 1 times [2024-02-05 10:32:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:04,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017169221] [2024-02-05 10:32:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:04,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017169221] [2024-02-05 10:32:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017169221] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:04,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:04,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:32:04,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036865084] [2024-02-05 10:32:04,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:04,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:32:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:32:04,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:32:04,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:32:04,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:04,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:04,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:32:04,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:06,515 INFO L124 PetriNetUnfolderBase]: 16866/23446 cut-off events. [2024-02-05 10:32:06,515 INFO L125 PetriNetUnfolderBase]: For 75355/84479 co-relation queries the response was YES. [2024-02-05 10:32:06,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80845 conditions, 23446 events. 16866/23446 cut-off events. For 75355/84479 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 151436 event pairs, 1331 based on Foata normal form. 888/23323 useless extension candidates. Maximal degree in co-relation 80777. Up to 11680 conditions per place. [2024-02-05 10:32:06,734 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 130 selfloop transitions, 14 changer transitions 0/169 dead transitions. [2024-02-05 10:32:06,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 169 transitions, 1365 flow [2024-02-05 10:32:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:32:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:32:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2024-02-05 10:32:06,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7135802469135802 [2024-02-05 10:32:06,737 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 614 flow. Second operand 5 states and 289 transitions. [2024-02-05 10:32:06,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 169 transitions, 1365 flow [2024-02-05 10:32:06,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 169 transitions, 1361 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-02-05 10:32:06,877 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 701 flow [2024-02-05 10:32:06,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2024-02-05 10:32:06,878 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 24 predicate places. [2024-02-05 10:32:06,878 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 701 flow [2024-02-05 10:32:06,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:06,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:06,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:06,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-05 10:32:06,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:32:06,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:06,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1659088813, now seen corresponding path program 2 times [2024-02-05 10:32:06,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:06,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607192717] [2024-02-05 10:32:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:06,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607192717] [2024-02-05 10:32:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607192717] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:32:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505851276] [2024-02-05 10:32:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:06,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:32:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:32:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:32:07,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:32:07,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:07,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:07,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:32:07,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:08,727 INFO L124 PetriNetUnfolderBase]: 16348/22583 cut-off events. [2024-02-05 10:32:08,727 INFO L125 PetriNetUnfolderBase]: For 84822/94121 co-relation queries the response was YES. [2024-02-05 10:32:08,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82099 conditions, 22583 events. 16348/22583 cut-off events. For 84822/94121 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 142054 event pairs, 2622 based on Foata normal form. 1250/22832 useless extension candidates. Maximal degree in co-relation 82022. Up to 11607 conditions per place. [2024-02-05 10:32:08,950 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 133 selfloop transitions, 16 changer transitions 0/174 dead transitions. [2024-02-05 10:32:08,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 174 transitions, 1463 flow [2024-02-05 10:32:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:32:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:32:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2024-02-05 10:32:08,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2024-02-05 10:32:08,951 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 701 flow. Second operand 5 states and 290 transitions. [2024-02-05 10:32:08,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 174 transitions, 1463 flow [2024-02-05 10:32:09,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 174 transitions, 1454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-05 10:32:09,166 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 781 flow [2024-02-05 10:32:09,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=781, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2024-02-05 10:32:09,166 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 30 predicate places. [2024-02-05 10:32:09,167 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 781 flow [2024-02-05 10:32:09,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:09,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:09,167 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:09,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-05 10:32:09,167 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:32:09,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash 486838833, now seen corresponding path program 2 times [2024-02-05 10:32:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:09,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911392191] [2024-02-05 10:32:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911392191] [2024-02-05 10:32:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911392191] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:32:09,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:32:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:32:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91984143] [2024-02-05 10:32:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:32:09,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:32:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:32:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:32:09,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-02-05 10:32:09,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:09,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:09,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-02-05 10:32:09,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:11,243 INFO L124 PetriNetUnfolderBase]: 15666/23841 cut-off events. [2024-02-05 10:32:11,243 INFO L125 PetriNetUnfolderBase]: For 113007/116827 co-relation queries the response was YES. [2024-02-05 10:32:11,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97156 conditions, 23841 events. 15666/23841 cut-off events. For 113007/116827 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 174099 event pairs, 5753 based on Foata normal form. 770/23174 useless extension candidates. Maximal degree in co-relation 97072. Up to 11646 conditions per place. [2024-02-05 10:32:11,463 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 141 selfloop transitions, 16 changer transitions 0/184 dead transitions. [2024-02-05 10:32:11,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 184 transitions, 1692 flow [2024-02-05 10:32:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:32:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:32:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2024-02-05 10:32:11,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2024-02-05 10:32:11,465 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 781 flow. Second operand 5 states and 294 transitions. [2024-02-05 10:32:11,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 184 transitions, 1692 flow [2024-02-05 10:32:11,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 184 transitions, 1667 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-02-05 10:32:11,616 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 883 flow [2024-02-05 10:32:11,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=883, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2024-02-05 10:32:11,617 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 36 predicate places. [2024-02-05 10:32:11,617 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 883 flow [2024-02-05 10:32:11,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:11,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:32:11,618 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:32:11,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-05 10:32:11,618 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:32:11,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:32:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1273281472, now seen corresponding path program 1 times [2024-02-05 10:32:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:32:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240047598] [2024-02-05 10:32:11,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:32:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:32:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240047598] [2024-02-05 10:32:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240047598] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:32:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387771483] [2024-02-05 10:32:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:32:12,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:32:12,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:32:12,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:32:12,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-05 10:32:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:32:12,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-05 10:32:12,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:32:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:26,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:32:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387771483] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:32:31,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:32:31,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2024-02-05 10:32:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915767732] [2024-02-05 10:32:31,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:32:31,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-05 10:32:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:31,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-05 10:32:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-02-05 10:32:35,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:38,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:40,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:45,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:48,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:52,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:56,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:00,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:02,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:06,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:11,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:11,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 81 [2024-02-05 10:33:11,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 883 flow. Second operand has 19 states, 19 states have (on average 37.68421052631579) internal successors, (716), 19 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:11,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:33:11,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 81 [2024-02-05 10:33:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:33:18,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:27,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:38,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:45,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:47,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:54,138 WARN L293 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 69 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:34:01,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:07,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:09,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:13,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:17,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:18,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:23,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:27,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:30,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:37,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:42,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:45,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:57,641 INFO L124 PetriNetUnfolderBase]: 32090/46061 cut-off events. [2024-02-05 10:34:57,641 INFO L125 PetriNetUnfolderBase]: For 270160/278744 co-relation queries the response was YES. [2024-02-05 10:34:57,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195471 conditions, 46061 events. 32090/46061 cut-off events. For 270160/278744 co-relation queries the response was YES. Maximal size of possible extension queue 1987. Compared 328058 event pairs, 4896 based on Foata normal form. 306/45026 useless extension candidates. Maximal degree in co-relation 195381. Up to 28371 conditions per place. [2024-02-05 10:34:58,164 INFO L140 encePairwiseOnDemand]: 68/81 looper letters, 368 selfloop transitions, 87 changer transitions 12/486 dead transitions. [2024-02-05 10:34:58,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 486 transitions, 4246 flow [2024-02-05 10:34:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-05 10:34:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-05 10:34:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 960 transitions. [2024-02-05 10:34:58,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584362139917695 [2024-02-05 10:34:58,168 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 883 flow. Second operand 18 states and 960 transitions. [2024-02-05 10:34:58,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 486 transitions, 4246 flow [2024-02-05 10:34:58,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 486 transitions, 4201 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-02-05 10:34:58,537 INFO L231 Difference]: Finished difference. Result has 139 places, 182 transitions, 2023 flow [2024-02-05 10:34:58,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2023, PETRI_PLACES=139, PETRI_TRANSITIONS=182} [2024-02-05 10:34:58,538 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 58 predicate places. [2024-02-05 10:34:58,538 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 182 transitions, 2023 flow [2024-02-05 10:34:58,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 37.68421052631579) internal successors, (716), 19 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:34:58,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:34:58,539 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:34:58,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-05 10:34:58,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:34:58,747 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:34:58,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:34:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 842980512, now seen corresponding path program 2 times [2024-02-05 10:34:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:34:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218340438] [2024-02-05 10:34:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:34:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:34:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:34:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:34:59,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:34:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218340438] [2024-02-05 10:34:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218340438] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:34:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717593819] [2024-02-05 10:34:59,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:34:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:34:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:34:59,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:34:59,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-05 10:35:00,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:35:00,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:35:00,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-05 10:35:00,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:35:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:09,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:35:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717593819] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:35:15,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:35:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2024-02-05 10:35:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818647370] [2024-02-05 10:35:15,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:35:15,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-05 10:35:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-05 10:35:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=407, Unknown=2, NotChecked=0, Total=506 [2024-02-05 10:35:19,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:21,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:23,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:24,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:29,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:33,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:36,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 81 [2024-02-05 10:35:36,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 182 transitions, 2023 flow. Second operand has 23 states, 23 states have (on average 32.82608695652174) internal successors, (755), 23 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:35:36,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:36,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 81 [2024-02-05 10:35:36,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:45,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:49,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:01,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:05,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:17,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:22,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:27,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:29,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:31,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:42,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:48,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:48,633 INFO L124 PetriNetUnfolderBase]: 70350/97477 cut-off events. [2024-02-05 10:36:48,633 INFO L125 PetriNetUnfolderBase]: For 610605/610740 co-relation queries the response was YES. [2024-02-05 10:36:49,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445501 conditions, 97477 events. 70350/97477 cut-off events. For 610605/610740 co-relation queries the response was YES. Maximal size of possible extension queue 4108. Compared 701363 event pairs, 7699 based on Foata normal form. 40/97411 useless extension candidates. Maximal degree in co-relation 445403. Up to 57969 conditions per place. [2024-02-05 10:36:49,998 INFO L140 encePairwiseOnDemand]: 64/81 looper letters, 682 selfloop transitions, 233 changer transitions 21/945 dead transitions. [2024-02-05 10:36:49,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 945 transitions, 9586 flow [2024-02-05 10:36:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-05 10:36:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-05 10:36:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1463 transitions. [2024-02-05 10:36:50,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62281822051937 [2024-02-05 10:36:50,009 INFO L175 Difference]: Start difference. First operand has 139 places, 182 transitions, 2023 flow. Second operand 29 states and 1463 transitions. [2024-02-05 10:36:50,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 945 transitions, 9586 flow [2024-02-05 10:36:51,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 945 transitions, 9411 flow, removed 82 selfloop flow, removed 2 redundant places. [2024-02-05 10:36:51,911 INFO L231 Difference]: Finished difference. Result has 180 places, 386 transitions, 5453 flow [2024-02-05 10:36:51,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1912, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5453, PETRI_PLACES=180, PETRI_TRANSITIONS=386} [2024-02-05 10:36:51,912 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 99 predicate places. [2024-02-05 10:36:51,912 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 386 transitions, 5453 flow [2024-02-05 10:36:51,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 32.82608695652174) internal successors, (755), 23 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:36:51,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:51,913 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:51,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-05 10:36:52,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:36:52,114 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:36:52,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 808600992, now seen corresponding path program 3 times [2024-02-05 10:36:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697980731] [2024-02-05 10:36:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:52,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:52,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697980731] [2024-02-05 10:36:52,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697980731] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:36:52,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898469661] [2024-02-05 10:36:52,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-05 10:36:52,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:36:52,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:36:52,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:36:52,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-05 10:36:53,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-05 10:36:53,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:36:53,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-05 10:36:53,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:55,259 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:38:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:38:42,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:39:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:39:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898469661] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:39:02,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:39:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2024-02-05 10:39:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890411985] [2024-02-05 10:39:02,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:39:02,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-05 10:39:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:39:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-05 10:39:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=521, Unknown=12, NotChecked=0, Total=650 [2024-02-05 10:39:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:11,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:12,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:16,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:21,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:25,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:26,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:30,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:34,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:37,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:37,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 81 [2024-02-05 10:39:37,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 386 transitions, 5453 flow. Second operand has 26 states, 26 states have (on average 32.42307692307692) internal successors, (843), 26 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:39:37,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:39:37,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 81 [2024-02-05 10:39:37,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:39:52,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:53,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:25,722 WARN L293 SmtUtils]: Spent 16.82s on a formula simplification. DAG size of input: 83 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:40:29,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:32,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:35,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:40,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:44,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:46,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:50,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:52,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:53,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:57,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:07,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:22,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:28,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:30,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:34,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:39,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:41,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:45,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:49,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:50,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:54,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:56,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:59,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:04,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:08,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:13,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:17,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:25,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:26,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:29,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:33,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:34,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:38,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:42,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:46,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:51,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:53,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:01,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:06,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:07,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:15,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:33,430 INFO L124 PetriNetUnfolderBase]: 93286/129284 cut-off events. [2024-02-05 10:43:33,430 INFO L125 PetriNetUnfolderBase]: For 1110135/1110270 co-relation queries the response was YES. [2024-02-05 10:43:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670207 conditions, 129284 events. 93286/129284 cut-off events. For 1110135/1110270 co-relation queries the response was YES. Maximal size of possible extension queue 5659. Compared 962711 event pairs, 8873 based on Foata normal form. 173/129351 useless extension candidates. Maximal degree in co-relation 670089. Up to 78980 conditions per place. [2024-02-05 10:43:35,628 INFO L140 encePairwiseOnDemand]: 52/81 looper letters, 689 selfloop transitions, 488 changer transitions 33/1219 dead transitions. [2024-02-05 10:43:35,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1219 transitions, 16081 flow [2024-02-05 10:43:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-05 10:43:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-05 10:43:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1380 transitions. [2024-02-05 10:43:35,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5874840357598978 [2024-02-05 10:43:35,632 INFO L175 Difference]: Start difference. First operand has 180 places, 386 transitions, 5453 flow. Second operand 29 states and 1380 transitions. [2024-02-05 10:43:35,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1219 transitions, 16081 flow [2024-02-05 10:43:45,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1219 transitions, 15404 flow, removed 333 selfloop flow, removed 2 redundant places. [2024-02-05 10:43:45,225 INFO L231 Difference]: Finished difference. Result has 215 places, 731 transitions, 12183 flow [2024-02-05 10:43:45,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=5070, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=12183, PETRI_PLACES=215, PETRI_TRANSITIONS=731} [2024-02-05 10:43:45,226 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 134 predicate places. [2024-02-05 10:43:45,226 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 731 transitions, 12183 flow [2024-02-05 10:43:45,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.42307692307692) internal successors, (843), 26 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:43:45,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:43:45,226 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:43:45,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-05 10:43:45,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:43:45,428 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-02-05 10:43:45,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:43:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 424352684, now seen corresponding path program 4 times [2024-02-05 10:43:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:43:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911722097] [2024-02-05 10:43:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:43:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:43:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:43:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:43:46,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:43:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911722097] [2024-02-05 10:43:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911722097] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:43:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521475992] [2024-02-05 10:43:46,465 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-05 10:43:46,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:43:46,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:43:46,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:43:46,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-05 10:43:47,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-05 10:43:47,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:43:47,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-05 10:43:47,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:43:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:43:57,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:43:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:43:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521475992] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:43:59,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:43:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-02-05 10:43:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711529926] [2024-02-05 10:43:59,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:43:59,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-02-05 10:43:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:43:59,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-02-05 10:43:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2024-02-05 10:44:01,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:44:09,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 81 [2024-02-05 10:44:09,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 731 transitions, 12183 flow. Second operand has 25 states, 25 states have (on average 39.56) internal successors, (989), 25 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:44:09,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:44:09,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 81 [2024-02-05 10:44:09,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:44:22,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:44:26,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:44:47,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []