./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bench-exp1x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bench-exp1x3.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-d8006e4-m [2024-02-05 10:31:38,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:31:38,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:31:38,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:31:38,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:31:38,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:31:38,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:31:38,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:31:38,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:31:38,755 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:31:38,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:31:38,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:31:38,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:31:38,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:31:38,756 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:31:38,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:31:38,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:31:38,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:31:38,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:31:38,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:31:38,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:31:38,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:31:38,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:31:38,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:31:38,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:31:38,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:31:38,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:31:38,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:31:38,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:31:38,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:31:38,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:31:38,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:31:38,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:31:38,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:31:38,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:31:38,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:31:38,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:31:38,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:31:38,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:31:38,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:31:38,772 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:31:38,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:31:38,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:31:38,773 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-05 10:31:39,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:31:39,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:31:39,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:31:39,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:31:39,204 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:31:39,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-05 10:31:40,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:31:40,392 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:31:40,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-05 10:31:40,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b7df018/d834a2ab85cb4174806abb0e68c08a92/FLAG2cdd0c25e [2024-02-05 10:31:40,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b7df018/d834a2ab85cb4174806abb0e68c08a92 [2024-02-05 10:31:40,409 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:31:40,409 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:31:40,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bench-exp1x3.wvr.yml/witness.yml [2024-02-05 10:31:40,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:31:40,490 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:31:40,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:31:40,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:31:40,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:31:40,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:40" (1/2) ... [2024-02-05 10:31:40,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4439dc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:40, skipping insertion in model container [2024-02-05 10:31:40,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:40" (1/2) ... [2024-02-05 10:31:40,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54d8a658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:40, skipping insertion in model container [2024-02-05 10:31:40,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:31:40" (2/2) ... [2024-02-05 10:31:40,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4439dc9c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40, skipping insertion in model container [2024-02-05 10:31:40,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:31:40" (2/2) ... [2024-02-05 10:31:40,499 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:31:40,517 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:31:40,519 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (((((((0LL - (long long )x1) + (long long )x2 >= 0LL) && ((long long )x1 + (long long )x2 >= 0LL)) && ((0LL - (long long )x1) - (long long )x2 >= 0LL)) && ((long long )x1 - (long long )x2 >= 0LL)) && (x1 == 0U)) && (x2 == 0U)) && (n == 0U) [2024-02-05 10:31:40,519 INFO L101 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-02-05 10:31:40,519 INFO L101 nessWitnessExtractor]: Loop invariant at [L46-L46] (unsigned long )_argptr == 0UL [2024-02-05 10:31:40,519 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-02-05 10:31:40,519 INFO L101 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-02-05 10:31:40,520 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (x2 == 0U) && (n == 0U) [2024-02-05 10:31:40,520 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-02-05 10:31:40,520 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] n == 0U [2024-02-05 10:31:40,520 INFO L101 nessWitnessExtractor]: Loop invariant at [L38-L38] (unsigned long )_argptr == 0UL [2024-02-05 10:31:40,537 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:31:40,711 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-exp1x3.wvr.c[1875,1888] [2024-02-05 10:31:40,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:31:40,722 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-05 10:31:40,762 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-exp1x3.wvr.c[1875,1888] [2024-02-05 10:31:40,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:31:40,783 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:31:40,783 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40 WrapperNode [2024-02-05 10:31:40,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:31:40,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:31:40,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:31:40,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:31:40,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,822 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-02-05 10:31:40,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:31:40,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:31:40,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:31:40,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:31:40,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,846 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-05 10:31:40,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:31:40,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:31:40,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:31:40,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:31:40,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (1/1) ... [2024-02-05 10:31:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:31:40,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:40,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-05 10:31:40,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-05 10:31:40,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:31:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:31:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:31:40,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:31:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:31:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:31:40,926 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:31:41,014 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:31:41,017 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:31:41,202 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:31:41,202 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:31:41,280 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:31:41,280 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-05 10:31:41,280 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:31:41 BoogieIcfgContainer [2024-02-05 10:31:41,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:31:41,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:31:41,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:31:41,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:31:41,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:31:40" (1/4) ... [2024-02-05 10:31:41,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557c52e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:31:41, skipping insertion in model container [2024-02-05 10:31:41,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:31:40" (2/4) ... [2024-02-05 10:31:41,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557c52e8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:31:41, skipping insertion in model container [2024-02-05 10:31:41,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:31:40" (3/4) ... [2024-02-05 10:31:41,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557c52e8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:31:41, skipping insertion in model container [2024-02-05 10:31:41,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:31:41" (4/4) ... [2024-02-05 10:31:41,286 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2024-02-05 10:31:41,299 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:31:41,299 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-02-05 10:31:41,299 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:31:41,341 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-05 10:31:41,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 92 flow [2024-02-05 10:31:41,414 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-02-05 10:31:41,415 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:31:41,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 37 events. 4/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-05 10:31:41,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 92 flow [2024-02-05 10:31:41,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 84 flow [2024-02-05 10:31:41,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:31:41,434 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;@5387569b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:31:41,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-02-05 10:31:41,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:31:41,436 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:31:41,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:31:41,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:41,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:31:41,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:41,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 8016, now seen corresponding path program 1 times [2024-02-05 10:31:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:41,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910421271] [2024-02-05 10:31:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:41,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910421271] [2024-02-05 10:31:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910421271] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:31:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763518258] [2024-02-05 10:31:41,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:41,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:41,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:41,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-02-05 10:31:41,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:41,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:41,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-02-05 10:31:41,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,014 INFO L124 PetriNetUnfolderBase]: 74/199 cut-off events. [2024-02-05 10:31:42,014 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-02-05 10:31:42,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 199 events. 74/199 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 918 event pairs, 38 based on Foata normal form. 35/200 useless extension candidates. Maximal degree in co-relation 278. Up to 126 conditions per place. [2024-02-05 10:31:42,017 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 18 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-02-05 10:31:42,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 118 flow [2024-02-05 10:31:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-02-05 10:31:42,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2024-02-05 10:31:42,027 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 84 flow. Second operand 3 states and 68 transitions. [2024-02-05 10:31:42,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 118 flow [2024-02-05 10:31:42,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:31:42,031 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 74 flow [2024-02-05 10:31:42,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2024-02-05 10:31:42,036 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2024-02-05 10:31:42,036 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 74 flow [2024-02-05 10:31:42,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-05 10:31:42,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:31:42,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 248721, now seen corresponding path program 1 times [2024-02-05 10:31:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287279158] [2024-02-05 10:31:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287279158] [2024-02-05 10:31:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287279158] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:31:42,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688199438] [2024-02-05 10:31:42,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:42,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:42,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:42,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:42,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:42,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,166 INFO L124 PetriNetUnfolderBase]: 74/198 cut-off events. [2024-02-05 10:31:42,166 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-05 10:31:42,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 198 events. 74/198 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 919 event pairs, 38 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 324. Up to 124 conditions per place. [2024-02-05 10:31:42,169 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 17 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2024-02-05 10:31:42,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 110 flow [2024-02-05 10:31:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-02-05 10:31:42,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2024-02-05 10:31:42,175 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 74 flow. Second operand 3 states and 68 transitions. [2024-02-05 10:31:42,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 110 flow [2024-02-05 10:31:42,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:42,176 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 72 flow [2024-02-05 10:31:42,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2024-02-05 10:31:42,177 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2024-02-05 10:31:42,177 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 72 flow [2024-02-05 10:31:42,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-05 10:31:42,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:31:42,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash 7710571, now seen corresponding path program 1 times [2024-02-05 10:31:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002167985] [2024-02-05 10:31:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002167985] [2024-02-05 10:31:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002167985] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:31:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979121701] [2024-02-05 10:31:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:42,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:42,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-02-05 10:31:42,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:42,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-02-05 10:31:42,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,248 INFO L124 PetriNetUnfolderBase]: 74/197 cut-off events. [2024-02-05 10:31:42,249 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-05 10:31:42,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 197 events. 74/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 922 event pairs, 38 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 320. Up to 122 conditions per place. [2024-02-05 10:31:42,250 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 16 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-02-05 10:31:42,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 106 flow [2024-02-05 10:31:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-05 10:31:42,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2024-02-05 10:31:42,251 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 72 flow. Second operand 3 states and 70 transitions. [2024-02-05 10:31:42,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 106 flow [2024-02-05 10:31:42,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:42,252 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 70 flow [2024-02-05 10:31:42,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2024-02-05 10:31:42,253 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2024-02-05 10:31:42,253 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 70 flow [2024-02-05 10:31:42,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:42,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:31:42,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2072626378, now seen corresponding path program 1 times [2024-02-05 10:31:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585386907] [2024-02-05 10:31:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585386907] [2024-02-05 10:31:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585386907] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391946970] [2024-02-05 10:31:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:42,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:42,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:42,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:42,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:42,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,411 INFO L124 PetriNetUnfolderBase]: 45/130 cut-off events. [2024-02-05 10:31:42,411 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:31:42,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 130 events. 45/130 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 470 event pairs, 9 based on Foata normal form. 8/116 useless extension candidates. Maximal degree in co-relation 206. Up to 65 conditions per place. [2024-02-05 10:31:42,412 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 20 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-02-05 10:31:42,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 119 flow [2024-02-05 10:31:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:31:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:31:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-02-05 10:31:42,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2024-02-05 10:31:42,414 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 70 flow. Second operand 4 states and 89 transitions. [2024-02-05 10:31:42,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 119 flow [2024-02-05 10:31:42,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 115 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:42,415 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 64 flow [2024-02-05 10:31:42,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2024-02-05 10:31:42,416 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2024-02-05 10:31:42,416 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 64 flow [2024-02-05 10:31:42,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:31:42,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1071622021, now seen corresponding path program 1 times [2024-02-05 10:31:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890269043] [2024-02-05 10:31:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890269043] [2024-02-05 10:31:42,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890269043] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:42,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:42,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723617893] [2024-02-05 10:31:42,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:42,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:42,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:42,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:42,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:42,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:42,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:42,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,543 INFO L124 PetriNetUnfolderBase]: 46/113 cut-off events. [2024-02-05 10:31:42,543 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:31:42,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 113 events. 46/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 393 event pairs, 1 based on Foata normal form. 8/105 useless extension candidates. Maximal degree in co-relation 186. Up to 52 conditions per place. [2024-02-05 10:31:42,544 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 22 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2024-02-05 10:31:42,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 121 flow [2024-02-05 10:31:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:31:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:31:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-02-05 10:31:42,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-05 10:31:42,546 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 64 flow. Second operand 4 states and 91 transitions. [2024-02-05 10:31:42,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 121 flow [2024-02-05 10:31:42,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:42,547 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 59 flow [2024-02-05 10:31:42,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-02-05 10:31:42,548 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -9 predicate places. [2024-02-05 10:31:42,548 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 59 flow [2024-02-05 10:31:42,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,548 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] [2024-02-05 10:31:42,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:31:42,549 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash -846247140, now seen corresponding path program 1 times [2024-02-05 10:31:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126802944] [2024-02-05 10:31:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126802944] [2024-02-05 10:31:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126802944] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:42,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:31:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129031203] [2024-02-05 10:31:42,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:42,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:31:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:31:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:31:42,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 39 [2024-02-05 10:31:42,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:42,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 39 [2024-02-05 10:31:42,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,651 INFO L124 PetriNetUnfolderBase]: 65/169 cut-off events. [2024-02-05 10:31:42,651 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:31:42,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 169 events. 65/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 692 event pairs, 9 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 282. Up to 87 conditions per place. [2024-02-05 10:31:42,653 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 20 selfloop transitions, 5 changer transitions 1/35 dead transitions. [2024-02-05 10:31:42,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 136 flow [2024-02-05 10:31:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:31:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:31:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-05 10:31:42,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-02-05 10:31:42,654 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 59 flow. Second operand 3 states and 87 transitions. [2024-02-05 10:31:42,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 136 flow [2024-02-05 10:31:42,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:42,655 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 81 flow [2024-02-05 10:31:42,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2024-02-05 10:31:42,656 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2024-02-05 10:31:42,656 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 81 flow [2024-02-05 10:31:42,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:42,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:31:42,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash 577933996, now seen corresponding path program 1 times [2024-02-05 10:31:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662603318] [2024-02-05 10:31:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662603318] [2024-02-05 10:31:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662603318] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:31:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119788868] [2024-02-05 10:31:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:42,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:42,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:42,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:42,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:42,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:42,867 INFO L124 PetriNetUnfolderBase]: 175/327 cut-off events. [2024-02-05 10:31:42,867 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-02-05 10:31:42,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 327 events. 175/327 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1396 event pairs, 19 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 699. Up to 97 conditions per place. [2024-02-05 10:31:42,869 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 35 selfloop transitions, 12 changer transitions 3/55 dead transitions. [2024-02-05 10:31:42,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 55 transitions, 252 flow [2024-02-05 10:31:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:31:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:31:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-02-05 10:31:42,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-05 10:31:42,870 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 81 flow. Second operand 5 states and 130 transitions. [2024-02-05 10:31:42,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 55 transitions, 252 flow [2024-02-05 10:31:42,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:31:42,871 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 145 flow [2024-02-05 10:31:42,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2024-02-05 10:31:42,872 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-02-05 10:31:42,872 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 145 flow [2024-02-05 10:31:42,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:42,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:42,872 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:42,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:31:42,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:42,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1513742636, now seen corresponding path program 2 times [2024-02-05 10:31:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677527439] [2024-02-05 10:31:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:42,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:42,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677527439] [2024-02-05 10:31:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677527439] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:31:42,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510137921] [2024-02-05 10:31:42,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:31:42,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:42,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:31:42,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-05 10:31:43,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:31:43,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:31:43,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-05 10:31:43,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:31:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:43,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:31:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510137921] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:31:43,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:31:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-05 10:31:43,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223055223] [2024-02-05 10:31:43,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:31:43,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-05 10:31:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-05 10:31:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-05 10:31:43,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:43,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:43,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:43,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:43,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:43,429 INFO L124 PetriNetUnfolderBase]: 173/337 cut-off events. [2024-02-05 10:31:43,429 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-02-05 10:31:43,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 337 events. 173/337 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1387 event pairs, 24 based on Foata normal form. 14/341 useless extension candidates. Maximal degree in co-relation 915. Up to 129 conditions per place. [2024-02-05 10:31:43,431 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 51 selfloop transitions, 18 changer transitions 4/78 dead transitions. [2024-02-05 10:31:43,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 433 flow [2024-02-05 10:31:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-05 10:31:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-05 10:31:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-02-05 10:31:43,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-02-05 10:31:43,433 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 145 flow. Second operand 9 states and 216 transitions. [2024-02-05 10:31:43,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 433 flow [2024-02-05 10:31:43,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-05 10:31:43,438 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 265 flow [2024-02-05 10:31:43,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=265, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-02-05 10:31:43,440 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2024-02-05 10:31:43,440 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 265 flow [2024-02-05 10:31:43,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:43,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:43,440 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:43,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-05 10:31:43,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:43,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:43,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -452985044, now seen corresponding path program 1 times [2024-02-05 10:31:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:43,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055706666] [2024-02-05 10:31:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055706666] [2024-02-05 10:31:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055706666] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:31:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685132472] [2024-02-05 10:31:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:43,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:43,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:43,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:43,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:43,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:43,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:43,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:43,873 INFO L124 PetriNetUnfolderBase]: 163/313 cut-off events. [2024-02-05 10:31:43,873 INFO L125 PetriNetUnfolderBase]: For 761/764 co-relation queries the response was YES. [2024-02-05 10:31:43,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 313 events. 163/313 cut-off events. For 761/764 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1264 event pairs, 23 based on Foata normal form. 8/315 useless extension candidates. Maximal degree in co-relation 1067. Up to 161 conditions per place. [2024-02-05 10:31:43,876 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 41 selfloop transitions, 8 changer transitions 8/62 dead transitions. [2024-02-05 10:31:43,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 445 flow [2024-02-05 10:31:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:31:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:31:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-05 10:31:43,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-02-05 10:31:43,877 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 265 flow. Second operand 5 states and 126 transitions. [2024-02-05 10:31:43,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 445 flow [2024-02-05 10:31:43,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 428 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-02-05 10:31:43,883 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 269 flow [2024-02-05 10:31:43,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-02-05 10:31:43,884 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2024-02-05 10:31:43,884 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 269 flow [2024-02-05 10:31:43,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:43,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:43,884 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:43,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:31:43,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:43,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 207141536, now seen corresponding path program 2 times [2024-02-05 10:31:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083026784] [2024-02-05 10:31:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083026784] [2024-02-05 10:31:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083026784] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:31:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:31:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-05 10:31:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763071257] [2024-02-05 10:31:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:31:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:31:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:31:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:31:43,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:43,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:43,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:43,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:43,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:44,054 INFO L124 PetriNetUnfolderBase]: 141/277 cut-off events. [2024-02-05 10:31:44,055 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2024-02-05 10:31:44,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 277 events. 141/277 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 980 event pairs, 22 based on Foata normal form. 8/282 useless extension candidates. Maximal degree in co-relation 1005. Up to 169 conditions per place. [2024-02-05 10:31:44,057 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 44 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2024-02-05 10:31:44,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 503 flow [2024-02-05 10:31:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-05 10:31:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-05 10:31:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-05 10:31:44,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2024-02-05 10:31:44,058 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 269 flow. Second operand 5 states and 123 transitions. [2024-02-05 10:31:44,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 503 flow [2024-02-05 10:31:44,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 476 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-02-05 10:31:44,062 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 348 flow [2024-02-05 10:31:44,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-05 10:31:44,062 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-02-05 10:31:44,063 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 348 flow [2024-02-05 10:31:44,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:44,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:44,063 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:44,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:31:44,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:44,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash -151870266, now seen corresponding path program 1 times [2024-02-05 10:31:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043970605] [2024-02-05 10:31:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043970605] [2024-02-05 10:31:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043970605] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:31:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449369894] [2024-02-05 10:31:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:44,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:31:44,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-05 10:31:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:44,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:31:44,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:31:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:45,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:31:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449369894] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:31:46,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:31:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-02-05 10:31:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093245418] [2024-02-05 10:31:46,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:31:46,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-05 10:31:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-05 10:31:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-02-05 10:31:47,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:31:48,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:48,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 348 flow. Second operand has 17 states, 17 states have (on average 18.529411764705884) internal successors, (315), 17 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:48,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:48,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:48,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:50,623 INFO L124 PetriNetUnfolderBase]: 522/1007 cut-off events. [2024-02-05 10:31:50,624 INFO L125 PetriNetUnfolderBase]: For 3900/3900 co-relation queries the response was YES. [2024-02-05 10:31:50,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 1007 events. 522/1007 cut-off events. For 3900/3900 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5328 event pairs, 36 based on Foata normal form. 8/1012 useless extension candidates. Maximal degree in co-relation 3931. Up to 220 conditions per place. [2024-02-05 10:31:50,630 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 116 selfloop transitions, 80 changer transitions 19/220 dead transitions. [2024-02-05 10:31:50,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 220 transitions, 1907 flow [2024-02-05 10:31:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-05 10:31:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-05 10:31:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 486 transitions. [2024-02-05 10:31:50,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-02-05 10:31:50,632 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 348 flow. Second operand 20 states and 486 transitions. [2024-02-05 10:31:50,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 220 transitions, 1907 flow [2024-02-05 10:31:50,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 220 transitions, 1890 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-02-05 10:31:50,640 INFO L231 Difference]: Finished difference. Result has 84 places, 120 transitions, 1388 flow [2024-02-05 10:31:50,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1388, PETRI_PLACES=84, PETRI_TRANSITIONS=120} [2024-02-05 10:31:50,640 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2024-02-05 10:31:50,641 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 120 transitions, 1388 flow [2024-02-05 10:31:50,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.529411764705884) internal successors, (315), 17 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:50,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:50,641 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:50,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-05 10:31:50,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-05 10:31:50,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:50,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1439129122, now seen corresponding path program 2 times [2024-02-05 10:31:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:50,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275854690] [2024-02-05 10:31:50,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:50,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275854690] [2024-02-05 10:31:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275854690] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:31:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139006420] [2024-02-05 10:31:51,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:31:51,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:51,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:31:51,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-05 10:31:51,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:31:51,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:31:51,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:31:51,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:31:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:53,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:31:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139006420] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:31:53,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:31:53,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-02-05 10:31:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184612048] [2024-02-05 10:31:53,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:31:53,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-05 10:31:53,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:31:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-05 10:31:53,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-02-05 10:31:54,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:31:54,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 120 transitions, 1388 flow. Second operand has 17 states, 17 states have (on average 18.470588235294116) internal successors, (314), 17 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:54,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:31:54,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:31:54,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:31:57,778 INFO L124 PetriNetUnfolderBase]: 896/1695 cut-off events. [2024-02-05 10:31:57,779 INFO L125 PetriNetUnfolderBase]: For 11979/11979 co-relation queries the response was YES. [2024-02-05 10:31:57,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 1695 events. 896/1695 cut-off events. For 11979/11979 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10263 event pairs, 78 based on Foata normal form. 7/1699 useless extension candidates. Maximal degree in co-relation 8256. Up to 570 conditions per place. [2024-02-05 10:31:57,791 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 149 selfloop transitions, 166 changer transitions 15/335 dead transitions. [2024-02-05 10:31:57,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 335 transitions, 4073 flow [2024-02-05 10:31:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-05 10:31:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-05 10:31:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 554 transitions. [2024-02-05 10:31:57,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6176142697881828 [2024-02-05 10:31:57,795 INFO L175 Difference]: Start difference. First operand has 84 places, 120 transitions, 1388 flow. Second operand 23 states and 554 transitions. [2024-02-05 10:31:57,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 335 transitions, 4073 flow [2024-02-05 10:31:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 335 transitions, 3684 flow, removed 190 selfloop flow, removed 4 redundant places. [2024-02-05 10:31:57,827 INFO L231 Difference]: Finished difference. Result has 110 places, 227 transitions, 3110 flow [2024-02-05 10:31:57,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3110, PETRI_PLACES=110, PETRI_TRANSITIONS=227} [2024-02-05 10:31:57,829 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 71 predicate places. [2024-02-05 10:31:57,829 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 227 transitions, 3110 flow [2024-02-05 10:31:57,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.470588235294116) internal successors, (314), 17 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:31:57,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:31:57,829 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:31:57,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-05 10:31:58,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:58,041 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:31:58,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:31:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2073012134, now seen corresponding path program 3 times [2024-02-05 10:31:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:31:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840826226] [2024-02-05 10:31:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:31:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:31:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:31:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:31:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840826226] [2024-02-05 10:31:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840826226] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:31:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520966683] [2024-02-05 10:31:58,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-05 10:31:58,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:31:58,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:31:58,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:31:58,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-05 10:31:58,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-05 10:31:58,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:31:58,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:31:58,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:31:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:31:59,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:32:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:32:00,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520966683] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:32:00,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:32:00,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 14 [2024-02-05 10:32:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443915833] [2024-02-05 10:32:00,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:32:00,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-05 10:32:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:32:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-05 10:32:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-02-05 10:32:04,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:08,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:08,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-02-05 10:32:08,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 227 transitions, 3110 flow. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:32:08,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:32:08,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-02-05 10:32:08,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:32:20,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:24,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:28,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:32,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:36,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:40,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:48,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:52,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:32:54,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:00,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-02-05 10:33:07,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:10,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:14,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-02-05 10:33:18,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:28,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:33:28,733 INFO L124 PetriNetUnfolderBase]: 1220/2325 cut-off events. [2024-02-05 10:33:28,733 INFO L125 PetriNetUnfolderBase]: For 25729/25729 co-relation queries the response was YES. [2024-02-05 10:33:28,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12641 conditions, 2325 events. 1220/2325 cut-off events. For 25729/25729 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14176 event pairs, 120 based on Foata normal form. 119/2441 useless extension candidates. Maximal degree in co-relation 12568. Up to 638 conditions per place. [2024-02-05 10:33:28,748 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 236 selfloop transitions, 182 changer transitions 1/424 dead transitions. [2024-02-05 10:33:28,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 424 transitions, 6043 flow [2024-02-05 10:33:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-05 10:33:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-05 10:33:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 513 transitions. [2024-02-05 10:33:28,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5719063545150501 [2024-02-05 10:33:28,752 INFO L175 Difference]: Start difference. First operand has 110 places, 227 transitions, 3110 flow. Second operand 23 states and 513 transitions. [2024-02-05 10:33:28,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 424 transitions, 6043 flow [2024-02-05 10:33:28,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 424 transitions, 5931 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-02-05 10:33:28,814 INFO L231 Difference]: Finished difference. Result has 136 places, 292 transitions, 4708 flow [2024-02-05 10:33:28,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2825, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4708, PETRI_PLACES=136, PETRI_TRANSITIONS=292} [2024-02-05 10:33:28,815 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2024-02-05 10:33:28,815 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 292 transitions, 4708 flow [2024-02-05 10:33:28,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:28,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:33:28,815 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:33:28,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-05 10:33:29,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:33:29,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:33:29,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:33:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash -131805650, now seen corresponding path program 4 times [2024-02-05 10:33:29,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:33:29,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691014446] [2024-02-05 10:33:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:33:29,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:33:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:33:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:33:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691014446] [2024-02-05 10:33:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691014446] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:33:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735621036] [2024-02-05 10:33:29,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-05 10:33:29,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:33:29,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:33:29,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:33:29,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-05 10:33:29,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-05 10:33:29,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:33:29,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:33:29,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:33:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:29,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:33:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735621036] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:33:29,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:33:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-02-05 10:33:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235174445] [2024-02-05 10:33:29,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:33:29,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-05 10:33:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:33:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-05 10:33:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-02-05 10:33:30,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-02-05 10:33:30,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 292 transitions, 4708 flow. Second operand has 15 states, 15 states have (on average 16.533333333333335) internal successors, (248), 15 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:30,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:33:30,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-02-05 10:33:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:33:31,436 INFO L124 PetriNetUnfolderBase]: 1116/2127 cut-off events. [2024-02-05 10:33:31,437 INFO L125 PetriNetUnfolderBase]: For 33934/33937 co-relation queries the response was YES. [2024-02-05 10:33:31,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13516 conditions, 2127 events. 1116/2127 cut-off events. For 33934/33937 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12910 event pairs, 49 based on Foata normal form. 32/2155 useless extension candidates. Maximal degree in co-relation 13430. Up to 672 conditions per place. [2024-02-05 10:33:31,451 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 207 selfloop transitions, 82 changer transitions 43/337 dead transitions. [2024-02-05 10:33:31,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 337 transitions, 5639 flow [2024-02-05 10:33:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-05 10:33:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-05 10:33:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 292 transitions. [2024-02-05 10:33:31,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49914529914529915 [2024-02-05 10:33:31,453 INFO L175 Difference]: Start difference. First operand has 136 places, 292 transitions, 4708 flow. Second operand 15 states and 292 transitions. [2024-02-05 10:33:31,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 337 transitions, 5639 flow [2024-02-05 10:33:31,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 337 transitions, 5532 flow, removed 31 selfloop flow, removed 10 redundant places. [2024-02-05 10:33:31,537 INFO L231 Difference]: Finished difference. Result has 142 places, 268 transitions, 4340 flow [2024-02-05 10:33:31,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4309, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4340, PETRI_PLACES=142, PETRI_TRANSITIONS=268} [2024-02-05 10:33:31,538 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 103 predicate places. [2024-02-05 10:33:31,538 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 268 transitions, 4340 flow [2024-02-05 10:33:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.533333333333335) internal successors, (248), 15 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:31,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:33:31,538 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:33:31,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-02-05 10:33:31,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-05 10:33:31,767 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:33:31,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:33:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash 873072412, now seen corresponding path program 5 times [2024-02-05 10:33:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:33:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87348978] [2024-02-05 10:33:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:33:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:33:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:33:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:33:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87348978] [2024-02-05 10:33:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87348978] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:33:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752379495] [2024-02-05 10:33:31,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-05 10:33:31,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:33:31,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:33:31,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:33:31,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-05 10:33:32,041 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-05 10:33:32,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:33:32,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:33:32,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:33:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:32,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:33:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752379495] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:33:32,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:33:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-02-05 10:33:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191015720] [2024-02-05 10:33:32,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:33:32,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-05 10:33:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:33:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-05 10:33:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-02-05 10:33:32,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:33:32,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 268 transitions, 4340 flow. Second operand has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:32,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:33:32,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:33:32,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:33:34,109 INFO L124 PetriNetUnfolderBase]: 1202/2307 cut-off events. [2024-02-05 10:33:34,109 INFO L125 PetriNetUnfolderBase]: For 41324/41324 co-relation queries the response was YES. [2024-02-05 10:33:34,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15111 conditions, 2307 events. 1202/2307 cut-off events. For 41324/41324 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14191 event pairs, 112 based on Foata normal form. 47/2351 useless extension candidates. Maximal degree in co-relation 15023. Up to 745 conditions per place. [2024-02-05 10:33:34,132 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 212 selfloop transitions, 193 changer transitions 3/413 dead transitions. [2024-02-05 10:33:34,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 413 transitions, 6858 flow [2024-02-05 10:33:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-05 10:33:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-05 10:33:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 452 transitions. [2024-02-05 10:33:34,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6099865047233468 [2024-02-05 10:33:34,137 INFO L175 Difference]: Start difference. First operand has 142 places, 268 transitions, 4340 flow. Second operand 19 states and 452 transitions. [2024-02-05 10:33:34,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 413 transitions, 6858 flow [2024-02-05 10:33:34,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 413 transitions, 6640 flow, removed 21 selfloop flow, removed 11 redundant places. [2024-02-05 10:33:34,237 INFO L231 Difference]: Finished difference. Result has 154 places, 308 transitions, 5725 flow [2024-02-05 10:33:34,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3994, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5725, PETRI_PLACES=154, PETRI_TRANSITIONS=308} [2024-02-05 10:33:34,238 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 115 predicate places. [2024-02-05 10:33:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 308 transitions, 5725 flow [2024-02-05 10:33:34,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:34,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:33:34,239 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:33:34,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-05 10:33:34,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-05 10:33:34,439 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:33:34,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:33:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1238051418, now seen corresponding path program 6 times [2024-02-05 10:33:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:33:34,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498053303] [2024-02-05 10:33:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:33:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:33:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:33:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:33:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498053303] [2024-02-05 10:33:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498053303] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:33:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314763196] [2024-02-05 10:33:34,535 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-05 10:33:34,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:33:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:33:34,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:33:34,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-05 10:33:34,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-05 10:33:34,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:33:34,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-05 10:33:34,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:33:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:35,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:33:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:35,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314763196] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:33:35,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:33:35,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 17 [2024-02-05 10:33:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271132321] [2024-02-05 10:33:35,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:33:35,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-05 10:33:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:33:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-05 10:33:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-02-05 10:33:36,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:33:36,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 308 transitions, 5725 flow. Second operand has 17 states, 17 states have (on average 19.11764705882353) internal successors, (325), 17 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:36,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:33:36,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:33:36,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:33:41,867 INFO L124 PetriNetUnfolderBase]: 1276/2456 cut-off events. [2024-02-05 10:33:41,867 INFO L125 PetriNetUnfolderBase]: For 52342/52342 co-relation queries the response was YES. [2024-02-05 10:33:41,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17646 conditions, 2456 events. 1276/2456 cut-off events. For 52342/52342 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15082 event pairs, 28 based on Foata normal form. 31/2484 useless extension candidates. Maximal degree in co-relation 17551. Up to 545 conditions per place. [2024-02-05 10:33:41,883 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 178 selfloop transitions, 273 changer transitions 36/492 dead transitions. [2024-02-05 10:33:41,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 492 transitions, 8878 flow [2024-02-05 10:33:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-02-05 10:33:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-02-05 10:33:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 824 transitions. [2024-02-05 10:33:41,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560053981106613 [2024-02-05 10:33:41,885 INFO L175 Difference]: Start difference. First operand has 154 places, 308 transitions, 5725 flow. Second operand 38 states and 824 transitions. [2024-02-05 10:33:41,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 492 transitions, 8878 flow [2024-02-05 10:33:42,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 492 transitions, 8713 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-02-05 10:33:42,023 INFO L231 Difference]: Finished difference. Result has 194 places, 363 transitions, 7806 flow [2024-02-05 10:33:42,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=5405, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=7806, PETRI_PLACES=194, PETRI_TRANSITIONS=363} [2024-02-05 10:33:42,024 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 155 predicate places. [2024-02-05 10:33:42,024 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 363 transitions, 7806 flow [2024-02-05 10:33:42,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.11764705882353) internal successors, (325), 17 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:33:42,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:33:42,024 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:33:42,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-02-05 10:33:42,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:33:42,225 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:33:42,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:33:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 480226138, now seen corresponding path program 7 times [2024-02-05 10:33:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:33:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832483171] [2024-02-05 10:33:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:33:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:33:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:33:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:33:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832483171] [2024-02-05 10:33:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832483171] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:33:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663108301] [2024-02-05 10:33:42,339 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-05 10:33:42,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:33:42,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:33:42,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:33:42,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-05 10:33:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:33:42,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:33:42,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:33:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:33:55,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:34:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:34:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663108301] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:34:07,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:34:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 16 [2024-02-05 10:34:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344428709] [2024-02-05 10:34:07,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:34:07,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-05 10:34:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:34:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-05 10:34:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=181, Unknown=6, NotChecked=0, Total=240 [2024-02-05 10:34:11,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:16,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:20,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:20,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-02-05 10:34:20,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 363 transitions, 7806 flow. Second operand has 16 states, 16 states have (on average 16.4375) internal successors, (263), 16 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:34:20,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:34:20,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-02-05 10:34:20,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:34:24,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:28,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:36,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:40,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:44,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:34:54,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:00,906 INFO L124 PetriNetUnfolderBase]: 1228/2349 cut-off events. [2024-02-05 10:35:00,906 INFO L125 PetriNetUnfolderBase]: For 54806/54806 co-relation queries the response was YES. [2024-02-05 10:35:00,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18709 conditions, 2349 events. 1228/2349 cut-off events. For 54806/54806 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14257 event pairs, 106 based on Foata normal form. 16/2362 useless extension candidates. Maximal degree in co-relation 18610. Up to 1413 conditions per place. [2024-02-05 10:35:00,934 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 263 selfloop transitions, 160 changer transitions 0/428 dead transitions. [2024-02-05 10:35:00,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 428 transitions, 9666 flow [2024-02-05 10:35:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-05 10:35:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-05 10:35:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 315 transitions. [2024-02-05 10:35:00,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751131221719457 [2024-02-05 10:35:00,936 INFO L175 Difference]: Start difference. First operand has 194 places, 363 transitions, 7806 flow. Second operand 17 states and 315 transitions. [2024-02-05 10:35:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 428 transitions, 9666 flow [2024-02-05 10:35:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 428 transitions, 8851 flow, removed 309 selfloop flow, removed 17 redundant places. [2024-02-05 10:35:01,240 INFO L231 Difference]: Finished difference. Result has 194 places, 377 transitions, 7952 flow [2024-02-05 10:35:01,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7073, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7952, PETRI_PLACES=194, PETRI_TRANSITIONS=377} [2024-02-05 10:35:01,241 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 155 predicate places. [2024-02-05 10:35:01,241 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 377 transitions, 7952 flow [2024-02-05 10:35:01,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.4375) internal successors, (263), 16 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:35:01,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:01,241 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:35:01,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-02-05 10:35:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-02-05 10:35:01,448 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:35:01,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1225089114, now seen corresponding path program 8 times [2024-02-05 10:35:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681533135] [2024-02-05 10:35:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:01,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:01,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:01,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681533135] [2024-02-05 10:35:01,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681533135] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:35:01,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742765039] [2024-02-05 10:35:01,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:35:01,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:35:01,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:35:01,603 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:35:01,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-05 10:35:01,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:35:01,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:35:01,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-05 10:35:01,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:35:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:02,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:35:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742765039] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:35:02,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:35:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 15 [2024-02-05 10:35:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455937887] [2024-02-05 10:35:02,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:35:02,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-05 10:35:02,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-05 10:35:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-02-05 10:35:03,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:35:03,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 377 transitions, 7952 flow. Second operand has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:35:03,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:03,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:35:03,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:07,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-02-05 10:35:18,106 INFO L124 PetriNetUnfolderBase]: 1393/2653 cut-off events. [2024-02-05 10:35:18,106 INFO L125 PetriNetUnfolderBase]: For 59561/59561 co-relation queries the response was YES. [2024-02-05 10:35:18,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21277 conditions, 2653 events. 1393/2653 cut-off events. For 59561/59561 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16595 event pairs, 104 based on Foata normal form. 76/2726 useless extension candidates. Maximal degree in co-relation 21170. Up to 1211 conditions per place. [2024-02-05 10:35:18,137 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 310 selfloop transitions, 210 changer transitions 0/525 dead transitions. [2024-02-05 10:35:18,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 525 transitions, 11770 flow [2024-02-05 10:35:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-05 10:35:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-05 10:35:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 524 transitions. [2024-02-05 10:35:18,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5598290598290598 [2024-02-05 10:35:18,140 INFO L175 Difference]: Start difference. First operand has 194 places, 377 transitions, 7952 flow. Second operand 24 states and 524 transitions. [2024-02-05 10:35:18,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 525 transitions, 11770 flow [2024-02-05 10:35:18,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 525 transitions, 11347 flow, removed 112 selfloop flow, removed 17 redundant places. [2024-02-05 10:35:18,426 INFO L231 Difference]: Finished difference. Result has 204 places, 433 transitions, 9690 flow [2024-02-05 10:35:18,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7417, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=9690, PETRI_PLACES=204, PETRI_TRANSITIONS=433} [2024-02-05 10:35:18,427 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 165 predicate places. [2024-02-05 10:35:18,427 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 433 transitions, 9690 flow [2024-02-05 10:35:18,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:35:18,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:35:18,428 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:35:18,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-05 10:35:18,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-02-05 10:35:18,631 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:35:18,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:35:18,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1573537208, now seen corresponding path program 9 times [2024-02-05 10:35:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:35:18,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966840501] [2024-02-05 10:35:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:35:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:35:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:35:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:35:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966840501] [2024-02-05 10:35:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966840501] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:35:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302296285] [2024-02-05 10:35:20,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-05 10:35:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:35:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:35:20,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:35:20,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-05 10:35:20,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-02-05 10:35:20,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:35:20,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-05 10:35:20,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:35:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:23,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:35:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:35:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302296285] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:35:24,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:35:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2024-02-05 10:35:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791217602] [2024-02-05 10:35:24,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:35:24,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-05 10:35:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:35:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-05 10:35:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-02-05 10:35:32,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-02-05 10:35:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 433 transitions, 9690 flow. Second operand has 19 states, 19 states have (on average 19.05263157894737) internal successors, (362), 19 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:35:32,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:35:32,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-02-05 10:35:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:35:45,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:49,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:52,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:53,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:35:58,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:01,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:05,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:09,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:23,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:29,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:35,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:38,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:42,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:47,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:48,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:52,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:56,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:36:58,116 INFO L124 PetriNetUnfolderBase]: 1930/3671 cut-off events. [2024-02-05 10:36:58,117 INFO L125 PetriNetUnfolderBase]: For 92524/92524 co-relation queries the response was YES. [2024-02-05 10:36:58,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30860 conditions, 3671 events. 1930/3671 cut-off events. For 92524/92524 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24570 event pairs, 162 based on Foata normal form. 3/3671 useless extension candidates. Maximal degree in co-relation 30746. Up to 2057 conditions per place. [2024-02-05 10:36:58,147 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 498 selfloop transitions, 144 changer transitions 7/654 dead transitions. [2024-02-05 10:36:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 654 transitions, 15211 flow [2024-02-05 10:36:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-05 10:36:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-05 10:36:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 433 transitions. [2024-02-05 10:36:58,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6168091168091168 [2024-02-05 10:36:58,150 INFO L175 Difference]: Start difference. First operand has 204 places, 433 transitions, 9690 flow. Second operand 18 states and 433 transitions. [2024-02-05 10:36:58,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 654 transitions, 15211 flow [2024-02-05 10:36:58,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 654 transitions, 14696 flow, removed 113 selfloop flow, removed 7 redundant places. [2024-02-05 10:36:58,570 INFO L231 Difference]: Finished difference. Result has 220 places, 512 transitions, 11716 flow [2024-02-05 10:36:58,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=9263, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11716, PETRI_PLACES=220, PETRI_TRANSITIONS=512} [2024-02-05 10:36:58,571 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 181 predicate places. [2024-02-05 10:36:58,571 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 512 transitions, 11716 flow [2024-02-05 10:36:58,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.05263157894737) internal successors, (362), 19 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:36:58,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:36:58,572 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:36:58,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-05 10:36:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:36:58,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:36:58,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:36:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash -507983430, now seen corresponding path program 10 times [2024-02-05 10:36:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:36:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584579311] [2024-02-05 10:36:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:36:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:36:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:36:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:36:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:36:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584579311] [2024-02-05 10:36:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584579311] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:36:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515003584] [2024-02-05 10:36:59,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-05 10:36:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:36:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:36:59,899 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:36:59,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-05 10:37:00,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-05 10:37:00,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:37:00,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-05 10:37:00,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:37:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:37:23,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:37:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:37:42,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515003584] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:37:42,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:37:42,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2024-02-05 10:37:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920206672] [2024-02-05 10:37:42,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:37:42,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-05 10:37:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-05 10:37:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=489, Unknown=4, NotChecked=0, Total=650 [2024-02-05 10:37:43,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:37:48,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:37:55,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:38:00,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:38:00,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-02-05 10:38:00,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 512 transitions, 11716 flow. Second operand has 26 states, 26 states have (on average 15.076923076923077) internal successors, (392), 26 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:38:00,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:38:00,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-02-05 10:38:00,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:38:29,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:38:33,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:38:56,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:34,616 WARN L293 SmtUtils]: Spent 28.13s on a formula simplification. DAG size of input: 98 DAG size of output: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:39:47,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:50,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:51,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:39:59,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:07,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:11,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-02-05 10:40:12,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:16,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:22,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:27,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:31,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:36,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:40:47,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:12,947 WARN L293 SmtUtils]: Spent 13.87s on a formula simplification. DAG size of input: 124 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:41:17,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:28,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:36,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:38,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:48,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:49,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:41:53,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:02,540 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:42:07,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:12,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:17,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:21,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:23,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:24,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:28,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:42:45,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:11,664 WARN L293 SmtUtils]: Spent 24.52s on a formula simplification. DAG size of input: 117 DAG size of output: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:43:17,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:22,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:27,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:30,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:33,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:38,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:41,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:47,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:49,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:43:52,682 INFO L124 PetriNetUnfolderBase]: 2988/5770 cut-off events. [2024-02-05 10:43:52,683 INFO L125 PetriNetUnfolderBase]: For 151582/151582 co-relation queries the response was YES. [2024-02-05 10:43:52,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47347 conditions, 5770 events. 2988/5770 cut-off events. For 151582/151582 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 43207 event pairs, 34 based on Foata normal form. 8/5775 useless extension candidates. Maximal degree in co-relation 47228. Up to 1481 conditions per place. [2024-02-05 10:43:52,735 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 295 selfloop transitions, 691 changer transitions 27/1018 dead transitions. [2024-02-05 10:43:52,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1018 transitions, 22048 flow [2024-02-05 10:43:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-02-05 10:43:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-02-05 10:43:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 1093 transitions. [2024-02-05 10:43:52,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095571095571095 [2024-02-05 10:43:52,738 INFO L175 Difference]: Start difference. First operand has 220 places, 512 transitions, 11716 flow. Second operand 55 states and 1093 transitions. [2024-02-05 10:43:52,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1018 transitions, 22048 flow [2024-02-05 10:43:53,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 1018 transitions, 21871 flow, removed 81 selfloop flow, removed 5 redundant places. [2024-02-05 10:43:53,617 INFO L231 Difference]: Finished difference. Result has 286 places, 802 transitions, 21175 flow [2024-02-05 10:43:53,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11619, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=436, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=21175, PETRI_PLACES=286, PETRI_TRANSITIONS=802} [2024-02-05 10:43:53,618 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 247 predicate places. [2024-02-05 10:43:53,618 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 802 transitions, 21175 flow [2024-02-05 10:43:53,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 15.076923076923077) internal successors, (392), 26 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:43:53,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:43:53,619 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:43:53,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-05 10:43:53,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:43:53,821 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-05 10:43:53,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:43:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1901557788, now seen corresponding path program 11 times [2024-02-05 10:43:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:43:53,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221782331] [2024-02-05 10:43:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:43:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:43:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:43:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:43:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:43:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221782331] [2024-02-05 10:43:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221782331] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:43:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197381918] [2024-02-05 10:43:59,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-05 10:43:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:43:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:43:59,516 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:43:59,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-05 10:43:59,738 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-05 10:43:59,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:43:59,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-05 10:43:59,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:44:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:44:30,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:44:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:44:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197381918] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:44:53,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:44:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2024-02-05 10:44:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715207932] [2024-02-05 10:44:53,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:44:53,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-05 10:44:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:44:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-05 10:44:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=511, Unknown=9, NotChecked=0, Total=650 [2024-02-05 10:44:58,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:45:00,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:45:04,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:45:05,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:45:07,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-05 10:45:07,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-02-05 10:45:07,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 802 transitions, 21175 flow. Second operand has 26 states, 26 states have (on average 15.153846153846153) internal successors, (394), 26 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:45:07,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:45:07,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-02-05 10:45:07,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:45:40,361 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 74 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-05 10:45:44,377 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 [] Killed by 15