./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 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-exp2x3.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.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-ab2e0ac-m [2024-01-29 14:17:22,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:17:22,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:17:22,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:17:22,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:17:22,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:17:22,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:17:22,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:17:22,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:17:22,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:17:22,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:17:22,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:17:22,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:17:22,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:17:22,238 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:17:22,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:17:22,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:17:22,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:17:22,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:17:22,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:17:22,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:17:22,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:17:22,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:17:22,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:17:22,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:17:22,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:17:22,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:17:22,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:17:22,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:17:22,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:17:22,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:17:22,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:17:22,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:22,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:17:22,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:17:22,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:17:22,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:17:22,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:17:22,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:17:22,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:17:22,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:17:22,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:17:22,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:17:22,259 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 14:17:22,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:17:22,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:17:22,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:17:22,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:17:22,473 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:17:22,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-29 14:17:23,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:17:23,628 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:17:23,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-29 14:17:23,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff5d5bb/4c7ed8e6d2304e4f9ff9529af32e6b73/FLAGa8626992e [2024-01-29 14:17:23,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff5d5bb/4c7ed8e6d2304e4f9ff9529af32e6b73 [2024-01-29 14:17:23,649 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:17:23,651 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:17:23,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml [2024-01-29 14:17:23,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:17:23,713 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:17:23,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:23,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:17:23,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:17:23,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:23" (1/2) ... [2024-01-29 14:17:23,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fdaa75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:23, skipping insertion in model container [2024-01-29 14:17:23,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:17:23" (1/2) ... [2024-01-29 14:17:23,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@767e5cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:17:23, skipping insertion in model container [2024-01-29 14:17:23,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:23" (2/2) ... [2024-01-29 14:17:23,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fdaa75 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:23, skipping insertion in model container [2024-01-29 14:17:23,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:23" (2/2) ... [2024-01-29 14:17:23,720 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:17:23,730 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:17:23,731 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,731 INFO L98 nessWitnessExtractor]: Loop invariant at [L54-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,731 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,731 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] n == 0U [2024-01-29 14:17:23,731 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,732 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,732 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,732 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x3 == 0U [2024-01-29 14:17:23,732 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x4 == 0U [2024-01-29 14:17:23,732 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x2 == 0U [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] n == 0U [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L40] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L48] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] x4 == 0U [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] n == 0U [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] x3 == 0U [2024-01-29 14:17:23,733 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,734 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,734 INFO L98 nessWitnessExtractor]: Loop invariant at [L62-L64] (unsigned long )_argptr == 0UL [2024-01-29 14:17:23,734 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )n + (long long )x1 >= 0LL [2024-01-29 14:17:23,734 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x4 == 0U [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )n) - (long long )x1 >= 0LL [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x1 == 0U [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x3 == 0U [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )n) + (long long )x1 >= 0LL [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )n - (long long )x1 >= 0LL [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x2 == 0U [2024-01-29 14:17:23,735 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] n == 0U [2024-01-29 14:17:23,736 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] n == 0U [2024-01-29 14:17:23,736 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] x4 == 0U [2024-01-29 14:17:23,736 INFO L98 nessWitnessExtractor]: Location invariant after [L37-L43] n == 0U [2024-01-29 14:17:23,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:17:23,915 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-exp2x3.wvr.c[2289,2302] [2024-01-29 14:17:23,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:23,936 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:23,970 WARN L424 MainDispatcher]: Unable to annotate void* thread1(void* _argptr) { while (x1 < n) { x1 = x1 + x1; } return 0; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:17:24,014 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-exp2x3.wvr.c[2289,2302] [2024-01-29 14:17:24,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:17:24,027 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:17:24,027 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24 WrapperNode [2024-01-29 14:17:24,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:17:24,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:24,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:17:24,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:17:24,034 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 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,051 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 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,081 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-01-29 14:17:24,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:17:24,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:17:24,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:17:24,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:17:24,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,120 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-01-29 14:17:24,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:17:24,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:17:24,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:17:24,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:17:24,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (1/1) ... [2024-01-29 14:17:24,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:17:24,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:24,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 14:17:24,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 14:17:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:17:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:17:24,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:17:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:17:24,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:17:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 14:17:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 14:17:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-29 14:17:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-29 14:17:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:17:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:17:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:17:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 14:17:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:17:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:17:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:17:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:17:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:17:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:17:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 14:17:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:17:24,239 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:17:24,345 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:17:24,347 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:17:24,681 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:17:24,682 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:17:24,832 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:17:24,832 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 14:17:24,832 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:24 BoogieIcfgContainer [2024-01-29 14:17:24,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:17:24,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:17:24,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:17:24,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:17:24,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:17:23" (1/4) ... [2024-01-29 14:17:24,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e38ea48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:17:24, skipping insertion in model container [2024-01-29 14:17:24,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:17:23" (2/4) ... [2024-01-29 14:17:24,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e38ea48 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:24, skipping insertion in model container [2024-01-29 14:17:24,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:17:24" (3/4) ... [2024-01-29 14:17:24,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e38ea48 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:17:24, skipping insertion in model container [2024-01-29 14:17:24,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:17:24" (4/4) ... [2024-01-29 14:17:24,849 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-01-29 14:17:24,861 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:17:24,861 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-01-29 14:17:24,861 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:17:24,931 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-29 14:17:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 105 transitions, 238 flow [2024-01-29 14:17:25,003 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2024-01-29 14:17:25,003 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-29 14:17:25,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 101 events. 4/101 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 191 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2024-01-29 14:17:25,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 105 transitions, 238 flow [2024-01-29 14:17:25,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 100 transitions, 224 flow [2024-01-29 14:17:25,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:17:25,033 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;@1fb1778d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:17:25,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-01-29 14:17:25,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:17:25,036 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:17:25,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:17:25,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:25,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:17:25,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:25,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 12373, now seen corresponding path program 1 times [2024-01-29 14:17:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780923853] [2024-01-29 14:17:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:25,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780923853] [2024-01-29 14:17:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780923853] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:25,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:25,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:25,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664831015] [2024-01-29 14:17:25,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:25,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:25,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:25,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2024-01-29 14:17:25,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:25,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:25,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2024-01-29 14:17:25,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:26,220 INFO L124 PetriNetUnfolderBase]: 7352/10623 cut-off events. [2024-01-29 14:17:26,220 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-01-29 14:17:26,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20239 conditions, 10623 events. 7352/10623 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64492 event pairs, 4752 based on Foata normal form. 4/7170 useless extension candidates. Maximal degree in co-relation 17346. Up to 9138 conditions per place. [2024-01-29 14:17:26,298 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 36 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 14:17:26,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 93 transitions, 286 flow [2024-01-29 14:17:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-01-29 14:17:26,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-01-29 14:17:26,309 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 224 flow. Second operand 3 states and 222 transitions. [2024-01-29 14:17:26,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 93 transitions, 286 flow [2024-01-29 14:17:26,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 270 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-29 14:17:26,325 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 198 flow [2024-01-29 14:17:26,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-01-29 14:17:26,329 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -13 predicate places. [2024-01-29 14:17:26,330 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 198 flow [2024-01-29 14:17:26,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:26,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:26,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:17:26,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:17:26,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:26,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:26,331 INFO L85 PathProgramCache]: Analyzing trace with hash 383993, now seen corresponding path program 1 times [2024-01-29 14:17:26,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:26,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953253230] [2024-01-29 14:17:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953253230] [2024-01-29 14:17:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953253230] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:26,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848010138] [2024-01-29 14:17:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:26,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:26,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2024-01-29 14:17:26,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:26,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:26,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2024-01-29 14:17:26,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:26,781 INFO L124 PetriNetUnfolderBase]: 2026/3334 cut-off events. [2024-01-29 14:17:26,782 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-29 14:17:26,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6245 conditions, 3334 events. 2026/3334 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 23043 event pairs, 1965 based on Foata normal form. 2/2935 useless extension candidates. Maximal degree in co-relation 6204. Up to 2820 conditions per place. [2024-01-29 14:17:26,812 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 32 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 14:17:26,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 262 flow [2024-01-29 14:17:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2024-01-29 14:17:26,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-01-29 14:17:26,815 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 198 flow. Second operand 3 states and 237 transitions. [2024-01-29 14:17:26,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 262 flow [2024-01-29 14:17:26,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:26,817 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 194 flow [2024-01-29 14:17:26,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-01-29 14:17:26,818 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2024-01-29 14:17:26,819 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 194 flow [2024-01-29 14:17:26,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:26,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:26,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:17:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:17:26,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:26,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 11904228, now seen corresponding path program 1 times [2024-01-29 14:17:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:26,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729847689] [2024-01-29 14:17:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729847689] [2024-01-29 14:17:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729847689] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:26,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704122947] [2024-01-29 14:17:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:26,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:26,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2024-01-29 14:17:26,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:26,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:26,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2024-01-29 14:17:26,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:27,542 INFO L124 PetriNetUnfolderBase]: 7352/10618 cut-off events. [2024-01-29 14:17:27,543 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-01-29 14:17:27,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19921 conditions, 10618 events. 7352/10618 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64554 event pairs, 4752 based on Foata normal form. 3/7169 useless extension candidates. Maximal degree in co-relation 19895. Up to 9142 conditions per place. [2024-01-29 14:17:27,589 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 36 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-01-29 14:17:27,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 88 transitions, 264 flow [2024-01-29 14:17:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2024-01-29 14:17:27,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6634920634920635 [2024-01-29 14:17:27,593 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 194 flow. Second operand 3 states and 209 transitions. [2024-01-29 14:17:27,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 88 transitions, 264 flow [2024-01-29 14:17:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:27,596 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 188 flow [2024-01-29 14:17:27,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2024-01-29 14:17:27,597 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -18 predicate places. [2024-01-29 14:17:27,598 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 188 flow [2024-01-29 14:17:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:27,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:27,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:17:27,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:17:27,598 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:27,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1444926257, now seen corresponding path program 1 times [2024-01-29 14:17:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:27,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116244235] [2024-01-29 14:17:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116244235] [2024-01-29 14:17:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116244235] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:27,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:27,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393864725] [2024-01-29 14:17:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:27,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:27,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 105 [2024-01-29 14:17:27,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:27,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:27,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 105 [2024-01-29 14:17:27,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:27,920 INFO L124 PetriNetUnfolderBase]: 2026/3328 cut-off events. [2024-01-29 14:17:27,921 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 14:17:27,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6239 conditions, 3328 events. 2026/3328 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22975 event pairs, 1965 based on Foata normal form. 2/2934 useless extension candidates. Maximal degree in co-relation 6221. Up to 2819 conditions per place. [2024-01-29 14:17:27,938 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 32 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-01-29 14:17:27,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 250 flow [2024-01-29 14:17:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-01-29 14:17:27,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2024-01-29 14:17:27,940 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 188 flow. Second operand 3 states and 235 transitions. [2024-01-29 14:17:27,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 250 flow [2024-01-29 14:17:27,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:27,943 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 182 flow [2024-01-29 14:17:27,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-01-29 14:17:27,946 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2024-01-29 14:17:27,947 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 182 flow [2024-01-29 14:17:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:27,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:27,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:27,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:17:27,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:27,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1635492258, now seen corresponding path program 1 times [2024-01-29 14:17:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322789024] [2024-01-29 14:17:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322789024] [2024-01-29 14:17:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322789024] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:28,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:28,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:17:28,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213558055] [2024-01-29 14:17:28,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:28,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:28,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:28,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2024-01-29 14:17:28,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:28,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:28,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2024-01-29 14:17:28,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:28,273 INFO L124 PetriNetUnfolderBase]: 2026/3324 cut-off events. [2024-01-29 14:17:28,273 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 14:17:28,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 3324 events. 2026/3324 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22970 event pairs, 1965 based on Foata normal form. 4/2935 useless extension candidates. Maximal degree in co-relation 6209. Up to 2818 conditions per place. [2024-01-29 14:17:28,297 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 32 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-01-29 14:17:28,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 242 flow [2024-01-29 14:17:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-01-29 14:17:28,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2024-01-29 14:17:28,299 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 182 flow. Second operand 3 states and 233 transitions. [2024-01-29 14:17:28,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 242 flow [2024-01-29 14:17:28,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:28,301 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 174 flow [2024-01-29 14:17:28,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2024-01-29 14:17:28,301 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -25 predicate places. [2024-01-29 14:17:28,301 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 174 flow [2024-01-29 14:17:28,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:28,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:28,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:28,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:17:28,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:28,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -797271507, now seen corresponding path program 1 times [2024-01-29 14:17:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413331165] [2024-01-29 14:17:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:28,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:28,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413331165] [2024-01-29 14:17:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413331165] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:28,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:28,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:28,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970015949] [2024-01-29 14:17:28,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:28,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:28,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:28,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-29 14:17:28,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:28,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:28,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-29 14:17:28,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:28,861 INFO L124 PetriNetUnfolderBase]: 3577/5646 cut-off events. [2024-01-29 14:17:28,861 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-01-29 14:17:28,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10336 conditions, 5646 events. 3577/5646 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 35739 event pairs, 1827 based on Foata normal form. 340/5690 useless extension candidates. Maximal degree in co-relation 10307. Up to 4124 conditions per place. [2024-01-29 14:17:28,890 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 49 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-29 14:17:28,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 303 flow [2024-01-29 14:17:28,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:17:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:17:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2024-01-29 14:17:28,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7404761904761905 [2024-01-29 14:17:28,892 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 174 flow. Second operand 4 states and 311 transitions. [2024-01-29 14:17:28,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 303 flow [2024-01-29 14:17:28,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 93 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:28,893 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 166 flow [2024-01-29 14:17:28,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2024-01-29 14:17:28,896 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -28 predicate places. [2024-01-29 14:17:28,896 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 166 flow [2024-01-29 14:17:28,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:28,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:28,897 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] [2024-01-29 14:17:28,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:17:28,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:28,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1674928342, now seen corresponding path program 1 times [2024-01-29 14:17:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:28,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706336241] [2024-01-29 14:17:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706336241] [2024-01-29 14:17:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706336241] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890625884] [2024-01-29 14:17:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:28,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:28,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-29 14:17:28,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:28,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:28,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-29 14:17:28,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:29,270 INFO L124 PetriNetUnfolderBase]: 3128/4716 cut-off events. [2024-01-29 14:17:29,270 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-01-29 14:17:29,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 4716 events. 3128/4716 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 29893 event pairs, 248 based on Foata normal form. 400/4951 useless extension candidates. Maximal degree in co-relation 8758. Up to 3336 conditions per place. [2024-01-29 14:17:29,298 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 52 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-29 14:17:29,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 307 flow [2024-01-29 14:17:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:17:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:17:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-01-29 14:17:29,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7476190476190476 [2024-01-29 14:17:29,302 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 166 flow. Second operand 4 states and 314 transitions. [2024-01-29 14:17:29,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 307 flow [2024-01-29 14:17:29,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 92 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:29,304 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 159 flow [2024-01-29 14:17:29,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-01-29 14:17:29,305 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -31 predicate places. [2024-01-29 14:17:29,305 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 159 flow [2024-01-29 14:17:29,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:29,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:29,306 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] [2024-01-29 14:17:29,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:17:29,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:29,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1004530611, now seen corresponding path program 1 times [2024-01-29 14:17:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791299514] [2024-01-29 14:17:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791299514] [2024-01-29 14:17:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791299514] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205708238] [2024-01-29 14:17:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:29,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:29,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:29,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-29 14:17:29,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:29,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:29,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-29 14:17:29,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:29,748 INFO L124 PetriNetUnfolderBase]: 3191/4796 cut-off events. [2024-01-29 14:17:29,748 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-01-29 14:17:29,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8935 conditions, 4796 events. 3191/4796 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 29934 event pairs, 161 based on Foata normal form. 400/5046 useless extension candidates. Maximal degree in co-relation 8901. Up to 3304 conditions per place. [2024-01-29 14:17:29,769 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 55 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 14:17:29,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 312 flow [2024-01-29 14:17:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:17:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:17:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-29 14:17:29,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7547619047619047 [2024-01-29 14:17:29,771 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 159 flow. Second operand 4 states and 317 transitions. [2024-01-29 14:17:29,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 312 flow [2024-01-29 14:17:29,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:29,773 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 152 flow [2024-01-29 14:17:29,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-01-29 14:17:29,775 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -34 predicate places. [2024-01-29 14:17:29,775 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 152 flow [2024-01-29 14:17:29,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:29,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:29,778 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] [2024-01-29 14:17:29,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:17:29,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:29,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1016395351, now seen corresponding path program 1 times [2024-01-29 14:17:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586073430] [2024-01-29 14:17:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586073430] [2024-01-29 14:17:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586073430] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:29,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227971640] [2024-01-29 14:17:29,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:29,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:29,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:29,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-29 14:17:29,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:29,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:29,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-29 14:17:29,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:30,160 INFO L124 PetriNetUnfolderBase]: 3016/4482 cut-off events. [2024-01-29 14:17:30,160 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-01-29 14:17:30,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8458 conditions, 4482 events. 3016/4482 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27079 event pairs, 357 based on Foata normal form. 340/4710 useless extension candidates. Maximal degree in co-relation 8424. Up to 2810 conditions per place. [2024-01-29 14:17:30,183 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 58 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-29 14:17:30,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 317 flow [2024-01-29 14:17:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:17:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:17:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-01-29 14:17:30,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-01-29 14:17:30,185 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 152 flow. Second operand 4 states and 320 transitions. [2024-01-29 14:17:30,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 317 flow [2024-01-29 14:17:30,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:30,186 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 145 flow [2024-01-29 14:17:30,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-01-29 14:17:30,187 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -37 predicate places. [2024-01-29 14:17:30,187 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 145 flow [2024-01-29 14:17:30,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:30,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:30,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:30,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:17:30,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:30,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1238512162, now seen corresponding path program 1 times [2024-01-29 14:17:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506989266] [2024-01-29 14:17:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:30,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506989266] [2024-01-29 14:17:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506989266] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:17:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55296111] [2024-01-29 14:17:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:30,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:17:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:17:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:17:30,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 105 [2024-01-29 14:17:30,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:30,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:30,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 105 [2024-01-29 14:17:30,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:30,729 INFO L124 PetriNetUnfolderBase]: 4381/6698 cut-off events. [2024-01-29 14:17:30,729 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-01-29 14:17:30,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12485 conditions, 6698 events. 4381/6698 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 40071 event pairs, 656 based on Foata normal form. 1/6585 useless extension candidates. Maximal degree in co-relation 12451. Up to 4604 conditions per place. [2024-01-29 14:17:30,752 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 52 selfloop transitions, 7 changer transitions 1/91 dead transitions. [2024-01-29 14:17:30,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 326 flow [2024-01-29 14:17:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:17:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:17:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2024-01-29 14:17:30,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8507936507936508 [2024-01-29 14:17:30,754 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 145 flow. Second operand 3 states and 268 transitions. [2024-01-29 14:17:30,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 326 flow [2024-01-29 14:17:30,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:17:30,755 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 181 flow [2024-01-29 14:17:30,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-01-29 14:17:30,757 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -36 predicate places. [2024-01-29 14:17:30,759 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 181 flow [2024-01-29 14:17:30,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:30,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:30,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:30,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:17:30,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:30,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1716240187, now seen corresponding path program 1 times [2024-01-29 14:17:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108032418] [2024-01-29 14:17:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108032418] [2024-01-29 14:17:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108032418] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918181329] [2024-01-29 14:17:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:30,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:30,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-29 14:17:30,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:30,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:30,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-29 14:17:30,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:31,695 INFO L124 PetriNetUnfolderBase]: 8773/12009 cut-off events. [2024-01-29 14:17:31,695 INFO L125 PetriNetUnfolderBase]: For 2452/2962 co-relation queries the response was YES. [2024-01-29 14:17:31,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26940 conditions, 12009 events. 8773/12009 cut-off events. For 2452/2962 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 69133 event pairs, 967 based on Foata normal form. 30/10602 useless extension candidates. Maximal degree in co-relation 26894. Up to 4057 conditions per place. [2024-01-29 14:17:31,743 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 97 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-01-29 14:17:31,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 596 flow [2024-01-29 14:17:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2024-01-29 14:17:31,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.758095238095238 [2024-01-29 14:17:31,745 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 181 flow. Second operand 5 states and 398 transitions. [2024-01-29 14:17:31,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 596 flow [2024-01-29 14:17:31,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 137 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:31,747 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 282 flow [2024-01-29 14:17:31,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2024-01-29 14:17:31,748 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -30 predicate places. [2024-01-29 14:17:31,748 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 282 flow [2024-01-29 14:17:31,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:31,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:31,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:31,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:17:31,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:31,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1804811123, now seen corresponding path program 2 times [2024-01-29 14:17:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806048430] [2024-01-29 14:17:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:31,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806048430] [2024-01-29 14:17:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806048430] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:31,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:31,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520416442] [2024-01-29 14:17:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:31,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:31,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-29 14:17:31,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:31,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:31,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-29 14:17:31,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:32,706 INFO L124 PetriNetUnfolderBase]: 8577/12004 cut-off events. [2024-01-29 14:17:32,706 INFO L125 PetriNetUnfolderBase]: For 7683/7731 co-relation queries the response was YES. [2024-01-29 14:17:32,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30837 conditions, 12004 events. 8577/12004 cut-off events. For 7683/7731 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 71195 event pairs, 1701 based on Foata normal form. 262/11952 useless extension candidates. Maximal degree in co-relation 30779. Up to 4123 conditions per place. [2024-01-29 14:17:32,783 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 104 selfloop transitions, 19 changer transitions 0/145 dead transitions. [2024-01-29 14:17:32,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 723 flow [2024-01-29 14:17:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2024-01-29 14:17:32,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7638095238095238 [2024-01-29 14:17:32,785 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 282 flow. Second operand 5 states and 401 transitions. [2024-01-29 14:17:32,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 145 transitions, 723 flow [2024-01-29 14:17:32,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 145 transitions, 723 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 14:17:32,791 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 399 flow [2024-01-29 14:17:32,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2024-01-29 14:17:32,792 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2024-01-29 14:17:32,792 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 399 flow [2024-01-29 14:17:32,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:32,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:32,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:32,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:17:32,793 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:32,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:32,794 INFO L85 PathProgramCache]: Analyzing trace with hash -317025146, now seen corresponding path program 1 times [2024-01-29 14:17:32,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:32,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892463255] [2024-01-29 14:17:32,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892463255] [2024-01-29 14:17:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892463255] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233663890] [2024-01-29 14:17:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:32,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:32,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:32,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:32,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-29 14:17:32,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:32,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:32,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-29 14:17:32,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:33,810 INFO L124 PetriNetUnfolderBase]: 8981/12459 cut-off events. [2024-01-29 14:17:33,810 INFO L125 PetriNetUnfolderBase]: For 22240/22760 co-relation queries the response was YES. [2024-01-29 14:17:33,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37128 conditions, 12459 events. 8981/12459 cut-off events. For 22240/22760 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 74010 event pairs, 967 based on Foata normal form. 201/12436 useless extension candidates. Maximal degree in co-relation 37056. Up to 4760 conditions per place. [2024-01-29 14:17:33,870 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 106 selfloop transitions, 16 changer transitions 0/144 dead transitions. [2024-01-29 14:17:33,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 837 flow [2024-01-29 14:17:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2024-01-29 14:17:33,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561904761904762 [2024-01-29 14:17:33,872 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 399 flow. Second operand 5 states and 397 transitions. [2024-01-29 14:17:33,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 837 flow [2024-01-29 14:17:33,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 833 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-29 14:17:33,924 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 494 flow [2024-01-29 14:17:33,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-01-29 14:17:33,925 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2024-01-29 14:17:33,925 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 494 flow [2024-01-29 14:17:33,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:33,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:33,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:33,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 14:17:33,926 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:33,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 831866104, now seen corresponding path program 2 times [2024-01-29 14:17:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109886661] [2024-01-29 14:17:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109886661] [2024-01-29 14:17:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109886661] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:34,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521009918] [2024-01-29 14:17:34,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:34,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:34,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:34,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2024-01-29 14:17:34,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 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-01-29 14:17:34,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:34,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2024-01-29 14:17:34,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:34,835 INFO L124 PetriNetUnfolderBase]: 8573/11984 cut-off events. [2024-01-29 14:17:34,836 INFO L125 PetriNetUnfolderBase]: For 26297/26392 co-relation queries the response was YES. [2024-01-29 14:17:34,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37141 conditions, 11984 events. 8573/11984 cut-off events. For 26297/26392 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 70628 event pairs, 2405 based on Foata normal form. 230/11873 useless extension candidates. Maximal degree in co-relation 37057. Up to 5169 conditions per place. [2024-01-29 14:17:34,911 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 110 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-01-29 14:17:34,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 149 transitions, 941 flow [2024-01-29 14:17:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2024-01-29 14:17:34,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2024-01-29 14:17:34,913 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 494 flow. Second operand 5 states and 402 transitions. [2024-01-29 14:17:34,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 149 transitions, 941 flow [2024-01-29 14:17:34,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 149 transitions, 932 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:34,948 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 574 flow [2024-01-29 14:17:34,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-01-29 14:17:34,948 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -9 predicate places. [2024-01-29 14:17:34,949 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 574 flow [2024-01-29 14:17:34,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 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-01-29 14:17:34,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:34,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:34,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 14:17:34,949 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:34,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2138841899, now seen corresponding path program 1 times [2024-01-29 14:17:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808651107] [2024-01-29 14:17:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:35,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808651107] [2024-01-29 14:17:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808651107] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:17:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150295328] [2024-01-29 14:17:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:35,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:17:35,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:35,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:17:35,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-29 14:17:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:35,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-29 14:17:35,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:17:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:35,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:17:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:35,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150295328] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:17:35,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:17:35,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-01-29 14:17:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754346013] [2024-01-29 14:17:35,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:17:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:17:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:35,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:17:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:17:35,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2024-01-29 14:17:35,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:35,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:35,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2024-01-29 14:17:35,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:37,009 INFO L124 PetriNetUnfolderBase]: 15260/21257 cut-off events. [2024-01-29 14:17:37,009 INFO L125 PetriNetUnfolderBase]: For 93846/98153 co-relation queries the response was YES. [2024-01-29 14:17:37,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72609 conditions, 21257 events. 15260/21257 cut-off events. For 93846/98153 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 135331 event pairs, 1803 based on Foata normal form. 1148/19625 useless extension candidates. Maximal degree in co-relation 72515. Up to 6152 conditions per place. [2024-01-29 14:17:37,168 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 243 selfloop transitions, 16 changer transitions 0/287 dead transitions. [2024-01-29 14:17:37,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 287 transitions, 2586 flow [2024-01-29 14:17:37,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-29 14:17:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-29 14:17:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 649 transitions. [2024-01-29 14:17:37,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867724867724868 [2024-01-29 14:17:37,171 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 574 flow. Second operand 9 states and 649 transitions. [2024-01-29 14:17:37,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 287 transitions, 2586 flow [2024-01-29 14:17:37,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 287 transitions, 2523 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:37,227 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 669 flow [2024-01-29 14:17:37,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=669, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-01-29 14:17:37,227 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-01-29 14:17:37,228 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 669 flow [2024-01-29 14:17:37,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:37,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:37,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:37,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-29 14:17:37,439 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,SelfDestructingSolverStorable14 [2024-01-29 14:17:37,441 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:37,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash 329252647, now seen corresponding path program 2 times [2024-01-29 14:17:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:37,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353072036] [2024-01-29 14:17:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353072036] [2024-01-29 14:17:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353072036] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237581757] [2024-01-29 14:17:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:37,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 105 [2024-01-29 14:17:37,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 669 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:37,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:37,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 105 [2024-01-29 14:17:37,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:38,917 INFO L124 PetriNetUnfolderBase]: 13356/18523 cut-off events. [2024-01-29 14:17:38,917 INFO L125 PetriNetUnfolderBase]: For 92769/96866 co-relation queries the response was YES. [2024-01-29 14:17:39,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74286 conditions, 18523 events. 13356/18523 cut-off events. For 92769/96866 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 113824 event pairs, 1285 based on Foata normal form. 1209/18858 useless extension candidates. Maximal degree in co-relation 74186. Up to 6257 conditions per place. [2024-01-29 14:17:39,078 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 154 selfloop transitions, 19 changer transitions 0/203 dead transitions. [2024-01-29 14:17:39,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1826 flow [2024-01-29 14:17:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2024-01-29 14:17:39,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7676190476190476 [2024-01-29 14:17:39,080 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 669 flow. Second operand 5 states and 403 transitions. [2024-01-29 14:17:39,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1826 flow [2024-01-29 14:17:39,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 203 transitions, 1824 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:39,178 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 817 flow [2024-01-29 14:17:39,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=817, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-01-29 14:17:39,179 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-01-29 14:17:39,179 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 817 flow [2024-01-29 14:17:39,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:39,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:39,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 14:17:39,179 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:39,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1071503040, now seen corresponding path program 1 times [2024-01-29 14:17:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:39,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848094520] [2024-01-29 14:17:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848094520] [2024-01-29 14:17:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848094520] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842937193] [2024-01-29 14:17:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:39,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 105 [2024-01-29 14:17:39,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 817 flow. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:39,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:39,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 105 [2024-01-29 14:17:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:40,763 INFO L124 PetriNetUnfolderBase]: 13188/18133 cut-off events. [2024-01-29 14:17:40,763 INFO L125 PetriNetUnfolderBase]: For 107156/111511 co-relation queries the response was YES. [2024-01-29 14:17:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78357 conditions, 18133 events. 13188/18133 cut-off events. For 107156/111511 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 108492 event pairs, 1177 based on Foata normal form. 1261/18520 useless extension candidates. Maximal degree in co-relation 78248. Up to 8801 conditions per place. [2024-01-29 14:17:40,930 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 160 selfloop transitions, 12 changer transitions 0/203 dead transitions. [2024-01-29 14:17:40,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 203 transitions, 1897 flow [2024-01-29 14:17:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2024-01-29 14:17:40,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-01-29 14:17:40,931 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 817 flow. Second operand 5 states and 406 transitions. [2024-01-29 14:17:40,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 203 transitions, 1897 flow [2024-01-29 14:17:41,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 203 transitions, 1887 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-01-29 14:17:41,167 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 852 flow [2024-01-29 14:17:41,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=852, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-01-29 14:17:41,167 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2024-01-29 14:17:41,167 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 852 flow [2024-01-29 14:17:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:41,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:41,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:41,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 14:17:41,168 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:41,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1226179184, now seen corresponding path program 2 times [2024-01-29 14:17:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:41,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272167553] [2024-01-29 14:17:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272167553] [2024-01-29 14:17:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272167553] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:17:41,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:17:41,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:17:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215112112] [2024-01-29 14:17:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:17:41,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:17:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:17:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:17:41,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 105 [2024-01-29 14:17:41,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 852 flow. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:41,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:41,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 105 [2024-01-29 14:17:41,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:17:42,814 INFO L124 PetriNetUnfolderBase]: 13304/18697 cut-off events. [2024-01-29 14:17:42,815 INFO L125 PetriNetUnfolderBase]: For 121179/125162 co-relation queries the response was YES. [2024-01-29 14:17:42,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82778 conditions, 18697 events. 13304/18697 cut-off events. For 121179/125162 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 116906 event pairs, 2143 based on Foata normal form. 1348/19230 useless extension candidates. Maximal degree in co-relation 82660. Up to 8589 conditions per place. [2024-01-29 14:17:43,002 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 164 selfloop transitions, 16 changer transitions 0/211 dead transitions. [2024-01-29 14:17:43,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 211 transitions, 2019 flow [2024-01-29 14:17:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:17:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:17:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2024-01-29 14:17:43,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7771428571428571 [2024-01-29 14:17:43,003 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 852 flow. Second operand 5 states and 408 transitions. [2024-01-29 14:17:43,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 211 transitions, 2019 flow [2024-01-29 14:17:43,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 211 transitions, 2000 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-29 14:17:43,544 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 950 flow [2024-01-29 14:17:43,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=950, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-01-29 14:17:43,545 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places. [2024-01-29 14:17:43,545 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 950 flow [2024-01-29 14:17:43,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:43,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:17:43,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:17:43,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 14:17:43,546 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:17:43,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:17:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash 552374191, now seen corresponding path program 1 times [2024-01-29 14:17:43,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:17:43,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240856701] [2024-01-29 14:17:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:43,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:17:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:17:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240856701] [2024-01-29 14:17:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240856701] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:17:44,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124116683] [2024-01-29 14:17:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:17:44,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:17:44,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:17:44,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:17:44,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-29 14:17:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:17:44,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 14:17:44,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:17:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:47,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:17:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:17:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124116683] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:17:48,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:17:48,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-29 14:17:48,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130757585] [2024-01-29 14:17:48,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:17:48,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-29 14:17:48,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:17:48,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-29 14:17:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-01-29 14:17:50,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2024-01-29 14:17:50,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 950 flow. Second operand has 19 states, 19 states have (on average 48.26315789473684) internal successors, (917), 19 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:17:50,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:17:50,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2024-01-29 14:17:50,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:02,319 INFO L124 PetriNetUnfolderBase]: 29934/42370 cut-off events. [2024-01-29 14:18:02,320 INFO L125 PetriNetUnfolderBase]: For 296105/304566 co-relation queries the response was YES. [2024-01-29 14:18:02,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199650 conditions, 42370 events. 29934/42370 cut-off events. For 296105/304566 co-relation queries the response was YES. Maximal size of possible extension queue 2028. Compared 286445 event pairs, 3228 based on Foata normal form. 1423/42472 useless extension candidates. Maximal degree in co-relation 199519. Up to 19557 conditions per place. [2024-01-29 14:18:02,878 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 390 selfloop transitions, 198 changer transitions 29/641 dead transitions. [2024-01-29 14:18:02,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 641 transitions, 6183 flow [2024-01-29 14:18:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-29 14:18:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-29 14:18:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1411 transitions. [2024-01-29 14:18:02,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842650103519669 [2024-01-29 14:18:02,882 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 950 flow. Second operand 23 states and 1411 transitions. [2024-01-29 14:18:02,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 641 transitions, 6183 flow [2024-01-29 14:18:03,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 641 transitions, 6124 flow, removed 26 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:03,735 INFO L231 Difference]: Finished difference. Result has 163 places, 309 transitions, 4027 flow [2024-01-29 14:18:03,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4027, PETRI_PLACES=163, PETRI_TRANSITIONS=309} [2024-01-29 14:18:03,735 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 54 predicate places. [2024-01-29 14:18:03,736 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 309 transitions, 4027 flow [2024-01-29 14:18:03,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 48.26315789473684) internal successors, (917), 19 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:03,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:03,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:03,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-29 14:18:03,937 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-01-29 14:18:03,938 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:18:03,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2046979469, now seen corresponding path program 2 times [2024-01-29 14:18:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:03,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229012653] [2024-01-29 14:18:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:18:04,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:04,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229012653] [2024-01-29 14:18:04,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229012653] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:18:04,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611635358] [2024-01-29 14:18:04,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-29 14:18:04,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:18:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:18:04,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:18:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-29 14:18:04,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-29 14:18:04,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 14:18:04,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 14:18:04,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:19:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:13,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:19:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:19:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611635358] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:19:21,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:19:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-29 14:19:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710245693] [2024-01-29 14:19:21,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:19:21,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-29 14:19:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:19:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-29 14:19:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=246, Unknown=6, NotChecked=0, Total=342 [2024-01-29 14:19:25,149 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-01-29 14:19:29,200 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-01-29 14:19:33,269 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-01-29 14:19:35,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:19:39,179 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-01-29 14:19:43,233 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-01-29 14:19:46,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:19:50,331 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-01-29 14:19:53,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:19:58,068 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-01-29 14:20:02,120 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-01-29 14:20:02,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2024-01-29 14:20:02,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 309 transitions, 4027 flow. Second operand has 19 states, 19 states have (on average 38.31578947368421) internal successors, (728), 19 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:20:02,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:20:02,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2024-01-29 14:20:02,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:20:13,102 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 71 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 14:20:16,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:20:20,481 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-01-29 14:20:23,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:20:27,882 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-01-29 14:20:46,611 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 62 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 14:20:50,619 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-01-29 14:20:55,280 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-01-29 14:20:59,292 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-01-29 14:21:01,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:21:20,306 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-01-29 14:21:24,309 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-01-29 14:21:28,317 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-01-29 14:21:29,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:21:31,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:21:37,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:21:41,132 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-01-29 14:21:45,987 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-01-29 14:21:50,251 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-01-29 14:21:54,404 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-01-29 14:21:58,426 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-01-29 14:22:02,724 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-01-29 14:22:06,816 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-01-29 14:22:09,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:22:13,408 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-01-29 14:22:16,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:22:20,309 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-01-29 14:22:22,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:22:30,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 14:22:34,143 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-01-29 14:22:38,822 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-01-29 14:22:42,831 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-01-29 14:22:47,138 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-01-29 14:22:49,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:22:51,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:22:55,766 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-01-29 14:23:07,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 14:23:12,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 14:23:16,065 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-01-29 14:23:21,192 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-01-29 14:23:27,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:23:31,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:23:32,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:23:34,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-29 14:23:41,540 INFO L124 PetriNetUnfolderBase]: 57210/79488 cut-off events. [2024-01-29 14:23:41,540 INFO L125 PetriNetUnfolderBase]: For 732363/732410 co-relation queries the response was YES. [2024-01-29 14:23:42,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430681 conditions, 79488 events. 57210/79488 cut-off events. For 732363/732410 co-relation queries the response was YES. Maximal size of possible extension queue 4131. Compared 558293 event pairs, 6535 based on Foata normal form. 85/79453 useless extension candidates. Maximal degree in co-relation 430533. Up to 40961 conditions per place. [2024-01-29 14:23:42,631 INFO L140 encePairwiseOnDemand]: 79/105 looper letters, 587 selfloop transitions, 373 changer transitions 44/1017 dead transitions. [2024-01-29 14:23:42,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1017 transitions, 12969 flow [2024-01-29 14:23:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-29 14:23:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-29 14:23:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1288 transitions. [2024-01-29 14:23:42,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-01-29 14:23:42,635 INFO L175 Difference]: Start difference. First operand has 163 places, 309 transitions, 4027 flow. Second operand 24 states and 1288 transitions. [2024-01-29 14:23:42,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1017 transitions, 12969 flow [2024-01-29 14:23:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1017 transitions, 12234 flow, removed 362 selfloop flow, removed 2 redundant places. [2024-01-29 14:23:48,988 INFO L231 Difference]: Finished difference. Result has 197 places, 570 transitions, 9050 flow [2024-01-29 14:23:48,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3692, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=9050, PETRI_PLACES=197, PETRI_TRANSITIONS=570} [2024-01-29 14:23:48,989 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 88 predicate places. [2024-01-29 14:23:48,989 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 570 transitions, 9050 flow [2024-01-29 14:23:48,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 38.31578947368421) internal successors, (728), 19 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:23:48,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:23:48,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:23:49,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-29 14:23:49,192 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-01-29 14:23:49,193 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:23:49,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:23:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1090393331, now seen corresponding path program 1 times [2024-01-29 14:23:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:23:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527976098] [2024-01-29 14:23:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:23:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:23:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:23:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:23:49,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:23:49,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527976098] [2024-01-29 14:23:49,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527976098] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:23:49,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524578684] [2024-01-29 14:23:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:23:49,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:23:49,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:23:49,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:23:49,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-29 14:23:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:23:49,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 14:23:49,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:23:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:23:51,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:23:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:23:52,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524578684] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:23:52,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:23:52,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-29 14:23:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284275021] [2024-01-29 14:23:52,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:23:52,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-29 14:23:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:23:52,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-29 14:23:52,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-01-29 14:23:56,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2024-01-29 14:23:56,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 570 transitions, 9050 flow. Second operand has 19 states, 19 states have (on average 47.05263157894737) internal successors, (894), 19 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:23:56,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:23:56,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2024-01-29 14:23:56,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:24:26,109 INFO L124 PetriNetUnfolderBase]: 84715/117171 cut-off events. [2024-01-29 14:24:26,110 INFO L125 PetriNetUnfolderBase]: For 1929746/1967998 co-relation queries the response was YES. [2024-01-29 14:24:27,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809888 conditions, 117171 events. 84715/117171 cut-off events. For 1929746/1967998 co-relation queries the response was YES. Maximal size of possible extension queue 6174. Compared 850077 event pairs, 4664 based on Foata normal form. 14150/127588 useless extension candidates. Maximal degree in co-relation 809723. Up to 70391 conditions per place. [2024-01-29 14:24:28,222 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 827 selfloop transitions, 1293 changer transitions 19/2240 dead transitions. [2024-01-29 14:24:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2240 transitions, 38767 flow [2024-01-29 14:24:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-29 14:24:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-29 14:24:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1398 transitions. [2024-01-29 14:24:28,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5788819875776398 [2024-01-29 14:24:28,225 INFO L175 Difference]: Start difference. First operand has 197 places, 570 transitions, 9050 flow. Second operand 23 states and 1398 transitions. [2024-01-29 14:24:28,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2240 transitions, 38767 flow [2024-01-29 14:24:47,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 2240 transitions, 38174 flow, removed 290 selfloop flow, removed 2 redundant places. [2024-01-29 14:24:47,200 INFO L231 Difference]: Finished difference. Result has 227 places, 1819 transitions, 35917 flow [2024-01-29 14:24:47,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=8849, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=35917, PETRI_PLACES=227, PETRI_TRANSITIONS=1819} [2024-01-29 14:24:47,201 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 118 predicate places. [2024-01-29 14:24:47,202 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 1819 transitions, 35917 flow [2024-01-29 14:24:47,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 47.05263157894737) internal successors, (894), 19 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:24:47,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:24:47,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:24:47,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-29 14:24:47,402 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-01-29 14:24:47,403 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-29 14:24:47,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:24:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1520524187, now seen corresponding path program 2 times [2024-01-29 14:24:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:24:47,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736515982] [2024-01-29 14:24:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:24:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:24:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:24:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:24:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:24:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736515982] [2024-01-29 14:24:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736515982] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:24:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376300760] [2024-01-29 14:24:47,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-29 14:24:47,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:24:47,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:24:47,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:24:47,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-29 14:24:48,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-29 14:24:48,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-29 14:24:48,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-29 14:24:48,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:26:29,306 WARN L293 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 14:27:33,803 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 33 DAG size of output: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 14:27:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:27:39,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:28:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:28:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376300760] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:28:19,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:28:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2024-01-29 14:28:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237340692] [2024-01-29 14:28:19,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:28:19,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-29 14:28:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:28:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-29 14:28:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=271, Unknown=26, NotChecked=0, Total=380 [2024-01-29 14:28:23,218 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-01-29 14:28:27,304 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-01-29 14:28:31,752 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-01-29 14:28:35,831 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-01-29 14:28:39,938 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-01-29 14:28:44,502 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-01-29 14:28:49,004 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-01-29 14:28:50,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:28:54,528 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-01-29 14:28:58,591 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-01-29 14:29:03,485 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-01-29 14:29:07,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-01-29 14:29:07,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2024-01-29 14:29:07,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1819 transitions, 35917 flow. Second operand has 20 states, 20 states have (on average 37.85) internal successors, (757), 20 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:29:07,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:29:07,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2024-01-29 14:29:07,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:29:22,883 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-01-29 14:29:39,623 WARN L293 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 59 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 14:29:44,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-01-29 14:29:48,144 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-01-29 14:29:53,633 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-01-29 14:30:06,448 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-01-29 14:30:08,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:30:12,935 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-01-29 14:30:17,187 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-01-29 14:30:21,795 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-01-29 14:30:25,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-29 14:30:29,334 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-01-29 14:30:37,498 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 39 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-29 14:30:46,835 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-01-29 14:30:50,880 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 []