./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:28:24,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:28:24,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:28:24,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:28:24,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:28:24,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:28:24,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:28:24,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:28:24,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:28:24,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:28:24,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:28:24,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:28:24,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:28:24,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:28:24,822 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:28:24,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:28:24,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:28:24,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:28:24,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:28:24,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:28:24,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:28:24,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:28:24,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:28:24,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:28:24,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:28:24,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:28:24,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:28:24,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:28:24,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:28:24,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:28:24,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:28:24,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:28:24,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:24,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:28:24,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:28:24,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:28:24,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:28:24,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:28:24,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:28:24,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:28:24,829 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:28:24,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:28:24,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:28:24,830 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-07 14:28:25,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:28:25,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:28:25,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:28:25,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:28:25,083 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:28:25,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-02-07 14:28:26,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:28:26,326 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:28:26,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-02-07 14:28:26,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad95dad0c/ec1b9c79d6e445c28ec0486762bfb21c/FLAGfc470cca1 [2024-02-07 14:28:26,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad95dad0c/ec1b9c79d6e445c28ec0486762bfb21c [2024-02-07 14:28:26,357 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:28:26,358 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:28:26,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.yml/witness.yml [2024-02-07 14:28:26,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:28:26,456 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:28:26,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:26,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:28:26,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:28:26,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:26" (1/2) ... [2024-02-07 14:28:26,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b59f9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:26, skipping insertion in model container [2024-02-07 14:28:26,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:26" (1/2) ... [2024-02-07 14:28:26,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b55f3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:26, skipping insertion in model container [2024-02-07 14:28:26,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:26" (2/2) ... [2024-02-07 14:28:26,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b59f9cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26, skipping insertion in model container [2024-02-07 14:28:26,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:26" (2/2) ... [2024-02-07 14:28:26,479 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:28:26,499 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:28:26,500 INFO L76 edCorrectnessWitness]: Location invariant before [L77-L77] ((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL) [2024-02-07 14:28:26,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:28:26,718 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-02-07 14:28:26,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:26,729 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:28:26,765 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-02-07 14:28:26,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:26,788 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:28:26,789 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26 WrapperNode [2024-02-07 14:28:26,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:26,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:26,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:28:26,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:28:26,796 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 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,802 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 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,820 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-02-07 14:28:26,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:26,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:28:26,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:28:26,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:28:26,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,852 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-07 14:28:26,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:28:26,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:28:26,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:28:26,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:28:26,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (1/1) ... [2024-02-07 14:28:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:26,888 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-07 14:28:26,894 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-07 14:28:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:28:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:28:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:28:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:28:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:28:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 14:28:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 14:28:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 14:28:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 14:28:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:28:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:28:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:28:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:28:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:28:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:28:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:28:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:28:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:28:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:28:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:28:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:28:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:28:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:28:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:28:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:28:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:28:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:28:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:28:26,928 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:28:27,111 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:28:27,114 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:28:27,292 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:28:27,299 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:28:27,427 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:28:27,428 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 14:28:27,428 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:27 BoogieIcfgContainer [2024-02-07 14:28:27,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:28:27,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:28:27,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:28:27,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:28:27,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:28:26" (1/4) ... [2024-02-07 14:28:27,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4834dbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:27, skipping insertion in model container [2024-02-07 14:28:27,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:26" (2/4) ... [2024-02-07 14:28:27,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4834dbed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:27, skipping insertion in model container [2024-02-07 14:28:27,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:26" (3/4) ... [2024-02-07 14:28:27,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4834dbed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:27, skipping insertion in model container [2024-02-07 14:28:27,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:27" (4/4) ... [2024-02-07 14:28:27,436 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-02-07 14:28:27,449 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:28:27,450 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 14:28:27,450 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:28:27,506 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-07 14:28:27,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 14:28:27,582 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-02-07 14:28:27,582 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 14:28:27,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 18 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-02-07 14:28:27,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 102 flow [2024-02-07 14:28:27,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2024-02-07 14:28:27,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:28:27,602 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;@b2a0763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:28:27,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-07 14:28:27,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:28:27,607 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:28:27,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:28:27,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:27,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:28:27,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:27,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash 10573, now seen corresponding path program 1 times [2024-02-07 14:28:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:27,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282091017] [2024-02-07 14:28:27,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282091017] [2024-02-07 14:28:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282091017] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:28:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931816049] [2024-02-07 14:28:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:27,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:27,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:28:27,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-07 14:28:27,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:27,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:28:27,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:28,211 INFO L124 PetriNetUnfolderBase]: 1132/1455 cut-off events. [2024-02-07 14:28:28,211 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-02-07 14:28:28,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 1455 events. 1132/1455 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4753 event pairs, 522 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 2240. Up to 1418 conditions per place. [2024-02-07 14:28:28,225 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-02-07 14:28:28,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 138 flow [2024-02-07 14:28:28,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-02-07 14:28:28,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-02-07 14:28:28,237 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 88 flow. Second operand 3 states and 54 transitions. [2024-02-07 14:28:28,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 138 flow [2024-02-07 14:28:28,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-02-07 14:28:28,245 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 74 flow [2024-02-07 14:28:28,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, 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=74, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2024-02-07 14:28:28,249 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2024-02-07 14:28:28,250 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 74 flow [2024-02-07 14:28:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-07 14:28:28,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:28,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:28,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:28:28,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:28,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 809585423, now seen corresponding path program 1 times [2024-02-07 14:28:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:28,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578474384] [2024-02-07 14:28:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,434 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-07 14:28:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578474384] [2024-02-07 14:28:28,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578474384] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:28,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:28,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34446853] [2024-02-07 14:28:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:28,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:28,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:28,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-07 14:28:28,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:28,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:28,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:28,657 INFO L124 PetriNetUnfolderBase]: 1537/1956 cut-off events. [2024-02-07 14:28:28,657 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-07 14:28:28,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 1956 events. 1537/1956 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6391 event pairs, 141 based on Foata normal form. 1/1130 useless extension candidates. Maximal degree in co-relation 3943. Up to 1733 conditions per place. [2024-02-07 14:28:28,668 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 42 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2024-02-07 14:28:28,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 221 flow [2024-02-07 14:28:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 14:28:28,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2024-02-07 14:28:28,674 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-02-07 14:28:28,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 221 flow [2024-02-07 14:28:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:28,682 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 103 flow [2024-02-07 14:28:28,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2024-02-07 14:28:28,683 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2024-02-07 14:28:28,683 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 103 flow [2024-02-07 14:28:28,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-07 14:28:28,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:28,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:28,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:28:28,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:28,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1264495030, now seen corresponding path program 1 times [2024-02-07 14:28:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101666747] [2024-02-07 14:28:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101666747] [2024-02-07 14:28:28,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101666747] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:28,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:28,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123256601] [2024-02-07 14:28:28,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:28,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:28,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:28,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:28,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:28,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:28,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:28,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:28,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:28,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,009 INFO L124 PetriNetUnfolderBase]: 1837/2363 cut-off events. [2024-02-07 14:28:29,036 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2024-02-07 14:28:29,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5860 conditions, 2363 events. 1837/2363 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8378 event pairs, 98 based on Foata normal form. 34/2385 useless extension candidates. Maximal degree in co-relation 1437. Up to 964 conditions per place. [2024-02-07 14:28:29,046 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-02-07 14:28:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 88 transitions, 419 flow [2024-02-07 14:28:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 14:28:29,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 14:28:29,048 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 103 flow. Second operand 5 states and 127 transitions. [2024-02-07 14:28:29,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 88 transitions, 419 flow [2024-02-07 14:28:29,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 88 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:29,050 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 167 flow [2024-02-07 14:28:29,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2024-02-07 14:28:29,051 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-02-07 14:28:29,051 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 167 flow [2024-02-07 14:28:29,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:29,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:28:29,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:29,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1224936498, now seen corresponding path program 2 times [2024-02-07 14:28:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80922967] [2024-02-07 14:28:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80922967] [2024-02-07 14:28:29,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80922967] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777257646] [2024-02-07 14:28:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,318 INFO L124 PetriNetUnfolderBase]: 1743/2279 cut-off events. [2024-02-07 14:28:29,319 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2024-02-07 14:28:29,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 2279 events. 1743/2279 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8547 event pairs, 365 based on Foata normal form. 70/2311 useless extension candidates. Maximal degree in co-relation 1731. Up to 1211 conditions per place. [2024-02-07 14:28:29,351 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 73 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2024-02-07 14:28:29,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 474 flow [2024-02-07 14:28:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-02-07 14:28:29,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-02-07 14:28:29,353 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 167 flow. Second operand 5 states and 127 transitions. [2024-02-07 14:28:29,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 474 flow [2024-02-07 14:28:29,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 88 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:28:29,356 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 221 flow [2024-02-07 14:28:29,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-02-07 14:28:29,357 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-02-07 14:28:29,357 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 221 flow [2024-02-07 14:28:29,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:29,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:28:29,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:29,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1668584551, now seen corresponding path program 1 times [2024-02-07 14:28:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704498033] [2024-02-07 14:28:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704498033] [2024-02-07 14:28:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704498033] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588637529] [2024-02-07 14:28:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:29,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:29,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:29,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:29,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:29,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:29,636 INFO L124 PetriNetUnfolderBase]: 1709/2235 cut-off events. [2024-02-07 14:28:29,636 INFO L125 PetriNetUnfolderBase]: For 3477/3477 co-relation queries the response was YES. [2024-02-07 14:28:29,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7387 conditions, 2235 events. 1709/2235 cut-off events. For 3477/3477 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8380 event pairs, 118 based on Foata normal form. 58/2281 useless extension candidates. Maximal degree in co-relation 3826. Up to 906 conditions per place. [2024-02-07 14:28:29,675 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2024-02-07 14:28:29,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 510 flow [2024-02-07 14:28:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-07 14:28:29,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2024-02-07 14:28:29,678 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 221 flow. Second operand 5 states and 126 transitions. [2024-02-07 14:28:29,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 510 flow [2024-02-07 14:28:29,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 501 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:29,687 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 228 flow [2024-02-07 14:28:29,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-02-07 14:28:29,690 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-02-07 14:28:29,691 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 228 flow [2024-02-07 14:28:29,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:29,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:29,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:29,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:28:29,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:29,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1993052358, now seen corresponding path program 1 times [2024-02-07 14:28:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416440451] [2024-02-07 14:28:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416440451] [2024-02-07 14:28:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416440451] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835691409] [2024-02-07 14:28:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:29,809 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-07 14:28:29,828 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-07 14:28:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:29,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:29,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:30,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:30,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835691409] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:30,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:30,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879624586] [2024-02-07 14:28:30,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:30,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:30,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-07 14:28:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:30,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:30,385 INFO L124 PetriNetUnfolderBase]: 2045/2783 cut-off events. [2024-02-07 14:28:30,385 INFO L125 PetriNetUnfolderBase]: For 7066/7066 co-relation queries the response was YES. [2024-02-07 14:28:30,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2783 events. 2045/2783 cut-off events. For 7066/7066 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11738 event pairs, 323 based on Foata normal form. 80/2809 useless extension candidates. Maximal degree in co-relation 5006. Up to 1205 conditions per place. [2024-02-07 14:28:30,424 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 102 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2024-02-07 14:28:30,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 116 transitions, 865 flow [2024-02-07 14:28:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-02-07 14:28:30,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-02-07 14:28:30,426 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 228 flow. Second operand 6 states and 135 transitions. [2024-02-07 14:28:30,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 116 transitions, 865 flow [2024-02-07 14:28:30,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 830 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:30,431 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 272 flow [2024-02-07 14:28:30,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-02-07 14:28:30,434 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2024-02-07 14:28:30,434 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 272 flow [2024-02-07 14:28:30,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-07 14:28:30,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:30,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:30,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 14:28:30,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-07 14:28:30,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:30,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1019249255, now seen corresponding path program 1 times [2024-02-07 14:28:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:30,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111365568] [2024-02-07 14:28:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111365568] [2024-02-07 14:28:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111365568] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213870376] [2024-02-07 14:28:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:30,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:30,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:30,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:30,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:30,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:30,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:30,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:30,985 INFO L124 PetriNetUnfolderBase]: 2003/2729 cut-off events. [2024-02-07 14:28:30,985 INFO L125 PetriNetUnfolderBase]: For 7676/7676 co-relation queries the response was YES. [2024-02-07 14:28:30,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11210 conditions, 2729 events. 2003/2729 cut-off events. For 7676/7676 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11124 event pairs, 75 based on Foata normal form. 42/2741 useless extension candidates. Maximal degree in co-relation 6896. Up to 1137 conditions per place. [2024-02-07 14:28:31,004 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 104 selfloop transitions, 11 changer transitions 0/120 dead transitions. [2024-02-07 14:28:31,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 914 flow [2024-02-07 14:28:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-02-07 14:28:31,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648648648648648 [2024-02-07 14:28:31,006 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 272 flow. Second operand 5 states and 123 transitions. [2024-02-07 14:28:31,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 914 flow [2024-02-07 14:28:31,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:31,014 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 335 flow [2024-02-07 14:28:31,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-02-07 14:28:31,015 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-02-07 14:28:31,015 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 335 flow [2024-02-07 14:28:31,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:31,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:31,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:28:31,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:31,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash -691303410, now seen corresponding path program 2 times [2024-02-07 14:28:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204890750] [2024-02-07 14:28:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:31,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204890750] [2024-02-07 14:28:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204890750] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:31,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386920274] [2024-02-07 14:28:31,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:31,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:31,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:31,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:31,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:31,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:31,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:31,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:31,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:31,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:31,325 INFO L124 PetriNetUnfolderBase]: 1801/2441 cut-off events. [2024-02-07 14:28:31,325 INFO L125 PetriNetUnfolderBase]: For 7812/7812 co-relation queries the response was YES. [2024-02-07 14:28:31,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 2441 events. 1801/2441 cut-off events. For 7812/7812 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9503 event pairs, 99 based on Foata normal form. 38/2449 useless extension candidates. Maximal degree in co-relation 6631. Up to 987 conditions per place. [2024-02-07 14:28:31,339 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 98 selfloop transitions, 10 changer transitions 4/117 dead transitions. [2024-02-07 14:28:31,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 919 flow [2024-02-07 14:28:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-02-07 14:28:31,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2024-02-07 14:28:31,341 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 335 flow. Second operand 5 states and 122 transitions. [2024-02-07 14:28:31,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 919 flow [2024-02-07 14:28:31,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 906 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:31,350 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 337 flow [2024-02-07 14:28:31,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 14:28:31,352 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2024-02-07 14:28:31,352 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 337 flow [2024-02-07 14:28:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:31,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:31,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:28:31,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:31,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 371198481, now seen corresponding path program 2 times [2024-02-07 14:28:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776115290] [2024-02-07 14:28:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:31,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776115290] [2024-02-07 14:28:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776115290] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214322338] [2024-02-07 14:28:31,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:28:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:31,461 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-07 14:28:31,462 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-07 14:28:31,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:28:31,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:28:31,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:31,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:31,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214322338] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:31,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699331547] [2024-02-07 14:28:31,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:31,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:31,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:31,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:31,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:31,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:31,985 INFO L124 PetriNetUnfolderBase]: 1725/2377 cut-off events. [2024-02-07 14:28:31,985 INFO L125 PetriNetUnfolderBase]: For 8081/8081 co-relation queries the response was YES. [2024-02-07 14:28:31,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10790 conditions, 2377 events. 1725/2377 cut-off events. For 8081/8081 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9822 event pairs, 293 based on Foata normal form. 76/2411 useless extension candidates. Maximal degree in co-relation 6791. Up to 1307 conditions per place. [2024-02-07 14:28:31,997 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 101 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2024-02-07 14:28:31,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 115 transitions, 933 flow [2024-02-07 14:28:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-02-07 14:28:31,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-02-07 14:28:31,999 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 337 flow. Second operand 6 states and 129 transitions. [2024-02-07 14:28:31,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 115 transitions, 933 flow [2024-02-07 14:28:32,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 920 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:32,004 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 376 flow [2024-02-07 14:28:32,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-02-07 14:28:32,005 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-02-07 14:28:32,005 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 376 flow [2024-02-07 14:28:32,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:28:32,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:32,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:32,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-07 14:28:32,216 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,SelfDestructingSolverStorable8 [2024-02-07 14:28:32,217 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:32,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash 289831469, now seen corresponding path program 2 times [2024-02-07 14:28:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:32,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132298966] [2024-02-07 14:28:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132298966] [2024-02-07 14:28:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132298966] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178249173] [2024-02-07 14:28:32,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:28:32,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:32,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:32,285 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-07 14:28:32,312 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-07 14:28:32,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:28:32,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:28:32,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:32,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:32,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178249173] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:32,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521798998] [2024-02-07 14:28:32,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:32,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:32,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:32,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:28:32,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-07 14:28:32,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:32,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:28:32,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:32,745 INFO L124 PetriNetUnfolderBase]: 1657/2292 cut-off events. [2024-02-07 14:28:32,746 INFO L125 PetriNetUnfolderBase]: For 8514/8538 co-relation queries the response was YES. [2024-02-07 14:28:32,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 2292 events. 1657/2292 cut-off events. For 8514/8538 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9685 event pairs, 481 based on Foata normal form. 72/2343 useless extension candidates. Maximal degree in co-relation 9644. Up to 1331 conditions per place. [2024-02-07 14:28:32,758 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 117 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2024-02-07 14:28:32,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 131 transitions, 1120 flow [2024-02-07 14:28:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-02-07 14:28:32,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2024-02-07 14:28:32,759 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 376 flow. Second operand 6 states and 133 transitions. [2024-02-07 14:28:32,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 131 transitions, 1120 flow [2024-02-07 14:28:32,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 1060 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-02-07 14:28:32,767 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 413 flow [2024-02-07 14:28:32,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=413, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-02-07 14:28:32,767 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-02-07 14:28:32,767 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 413 flow [2024-02-07 14:28:32,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-07 14:28:32,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:32,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:32,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 14:28:32,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:32,982 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:28:32,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1127101050, now seen corresponding path program 1 times [2024-02-07 14:28:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276584254] [2024-02-07 14:28:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276584254] [2024-02-07 14:28:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276584254] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631663827] [2024-02-07 14:28:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:33,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:33,433 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-07 14:28:33,461 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-07 14:28:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:33,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-07 14:28:33,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:29:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:29:54,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:30:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:30:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631663827] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:30:03,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:30:03,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-02-07 14:30:03,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661304400] [2024-02-07 14:30:03,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:30:03,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-07 14:30:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:30:03,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-07 14:30:03,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=136, Unknown=4, NotChecked=0, Total=182 [2024-02-07 14:30:07,164 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-07 14:30:07,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:30:07,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 413 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 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-07 14:30:07,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:30:07,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:30:07,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:30:12,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:19,639 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-07 14:30:25,130 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 75 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:30:29,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:33,714 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-07 14:30:38,202 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-07 14:30:42,239 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-07 14:30:46,329 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-07 14:30:50,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:51,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:55,499 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-07 14:30:59,504 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-07 14:31:03,512 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-07 14:31:07,517 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-07 14:31:09,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:20,922 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-07 14:31:22,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:25,191 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-07 14:31:29,541 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-07 14:31:33,582 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-07 14:31:37,597 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-07 14:31:41,663 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-07 14:31:42,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:47,436 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-07 14:31:51,442 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-07 14:31:55,509 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-07 14:31:59,980 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-07 14:32:04,007 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-07 14:32:08,013 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-07 14:32:12,083 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-07 14:32:17,335 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-07 14:32:18,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:21,541 INFO L124 PetriNetUnfolderBase]: 2399/3336 cut-off events. [2024-02-07 14:32:21,541 INFO L125 PetriNetUnfolderBase]: For 11964/11964 co-relation queries the response was YES. [2024-02-07 14:32:21,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15950 conditions, 3336 events. 2399/3336 cut-off events. For 11964/11964 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15014 event pairs, 357 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 14655. Up to 2259 conditions per place. [2024-02-07 14:32:21,564 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 154 selfloop transitions, 39 changer transitions 5/203 dead transitions. [2024-02-07 14:32:21,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 203 transitions, 1568 flow [2024-02-07 14:32:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-07 14:32:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-07 14:32:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 254 transitions. [2024-02-07 14:32:21,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6240786240786241 [2024-02-07 14:32:21,566 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 413 flow. Second operand 11 states and 254 transitions. [2024-02-07 14:32:21,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 203 transitions, 1568 flow [2024-02-07 14:32:21,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 203 transitions, 1539 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-07 14:32:21,578 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 836 flow [2024-02-07 14:32:21,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=836, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2024-02-07 14:32:21,579 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-02-07 14:32:21,579 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 836 flow [2024-02-07 14:32:21,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 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-07 14:32:21,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:21,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:21,594 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-07 14:32:21,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:21,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:32:21,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1763719860, now seen corresponding path program 2 times [2024-02-07 14:32:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438399913] [2024-02-07 14:32:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:22,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:22,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438399913] [2024-02-07 14:32:22,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438399913] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:22,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231239494] [2024-02-07 14:32:22,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:32:22,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:22,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:22,175 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-07 14:32:22,176 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-07 14:32:22,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:32:22,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:32:22,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:32:22,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:25,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:32:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:26,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231239494] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:32:26,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:32:26,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 14:32:26,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570561741] [2024-02-07 14:32:26,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:32:26,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:32:26,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:32:26,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2024-02-07 14:32:26,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:32:26,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 836 flow. Second operand has 16 states, 16 states have (on average 14.125) internal successors, (226), 16 states have internal predecessors, (226), 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-07 14:32:26,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:26,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:32:26,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:31,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:41,099 INFO L124 PetriNetUnfolderBase]: 4471/6303 cut-off events. [2024-02-07 14:32:41,099 INFO L125 PetriNetUnfolderBase]: For 27040/27040 co-relation queries the response was YES. [2024-02-07 14:32:41,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33227 conditions, 6303 events. 4471/6303 cut-off events. For 27040/27040 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 31871 event pairs, 382 based on Foata normal form. 35/6321 useless extension candidates. Maximal degree in co-relation 32634. Up to 3507 conditions per place. [2024-02-07 14:32:41,193 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 300 selfloop transitions, 140 changer transitions 19/464 dead transitions. [2024-02-07 14:32:41,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 464 transitions, 4289 flow [2024-02-07 14:32:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-07 14:32:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-07 14:32:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 524 transitions. [2024-02-07 14:32:41,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6743886743886743 [2024-02-07 14:32:41,195 INFO L175 Difference]: Start difference. First operand has 87 places, 92 transitions, 836 flow. Second operand 21 states and 524 transitions. [2024-02-07 14:32:41,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 464 transitions, 4289 flow [2024-02-07 14:32:41,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 464 transitions, 4220 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-02-07 14:32:41,243 INFO L231 Difference]: Finished difference. Result has 117 places, 222 transitions, 2595 flow [2024-02-07 14:32:41,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2595, PETRI_PLACES=117, PETRI_TRANSITIONS=222} [2024-02-07 14:32:41,244 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2024-02-07 14:32:41,244 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 222 transitions, 2595 flow [2024-02-07 14:32:41,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.125) internal successors, (226), 16 states have internal predecessors, (226), 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-07 14:32:41,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:41,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:41,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-07 14:32:41,456 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,SelfDestructingSolverStorable11 [2024-02-07 14:32:41,457 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:32:41,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1705712328, now seen corresponding path program 1 times [2024-02-07 14:32:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:41,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86037359] [2024-02-07 14:32:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86037359] [2024-02-07 14:32:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86037359] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098108205] [2024-02-07 14:32:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:41,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:41,778 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-07 14:32:41,779 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-07 14:32:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:41,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:32:41,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:43,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:32:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098108205] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:32:44,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:32:44,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-02-07 14:32:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683204029] [2024-02-07 14:32:44,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:32:44,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:32:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:32:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:32:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-02-07 14:32:44,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-02-07 14:32:44,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 222 transitions, 2595 flow. Second operand has 16 states, 16 states have (on average 13.875) internal successors, (222), 16 states have internal predecessors, (222), 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-07 14:32:44,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:32:44,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-02-07 14:32:44,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:32:56,929 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-07 14:32:57,608 INFO L124 PetriNetUnfolderBase]: 6383/8989 cut-off events. [2024-02-07 14:32:57,609 INFO L125 PetriNetUnfolderBase]: For 59560/59560 co-relation queries the response was YES. [2024-02-07 14:32:57,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54528 conditions, 8989 events. 6383/8989 cut-off events. For 59560/59560 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 48223 event pairs, 379 based on Foata normal form. 25/8997 useless extension candidates. Maximal degree in co-relation 53814. Up to 6624 conditions per place. [2024-02-07 14:32:57,723 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 405 selfloop transitions, 101 changer transitions 18/529 dead transitions. [2024-02-07 14:32:57,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 529 transitions, 5744 flow [2024-02-07 14:32:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 14:32:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 14:32:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 423 transitions. [2024-02-07 14:32:57,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.714527027027027 [2024-02-07 14:32:57,728 INFO L175 Difference]: Start difference. First operand has 117 places, 222 transitions, 2595 flow. Second operand 16 states and 423 transitions. [2024-02-07 14:32:57,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 529 transitions, 5744 flow [2024-02-07 14:32:57,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 529 transitions, 5389 flow, removed 175 selfloop flow, removed 1 redundant places. [2024-02-07 14:32:57,913 INFO L231 Difference]: Finished difference. Result has 141 places, 320 transitions, 3696 flow [2024-02-07 14:32:57,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3696, PETRI_PLACES=141, PETRI_TRANSITIONS=320} [2024-02-07 14:32:57,914 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-02-07 14:32:57,914 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 320 transitions, 3696 flow [2024-02-07 14:32:57,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.875) internal successors, (222), 16 states have internal predecessors, (222), 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-07 14:32:57,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:32:57,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:32:57,929 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-07 14:32:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:58,118 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:32:58,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:32:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 884207542, now seen corresponding path program 2 times [2024-02-07 14:32:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:32:58,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294238654] [2024-02-07 14:32:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:32:58,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:32:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:32:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:32:58,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:32:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294238654] [2024-02-07 14:32:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294238654] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:32:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536089317] [2024-02-07 14:32:58,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:32:58,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:32:58,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:32:58,529 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-07 14:32:58,530 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-07 14:32:58,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:32:58,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:32:58,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:32:58,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:34:09,306 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:35:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:35:28,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:35:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:35:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536089317] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:35:37,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:35:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2024-02-07 14:35:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674125594] [2024-02-07 14:35:37,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:35:37,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-07 14:35:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:35:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-07 14:35:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=174, Unknown=9, NotChecked=0, Total=272 [2024-02-07 14:35:38,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:35:38,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 320 transitions, 3696 flow. Second operand has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 17 states have internal predecessors, (215), 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-07 14:35:38,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:35:38,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:35:38,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:37:00,001 WARN L293 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 86 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:37:03,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:08,217 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-07 14:37:12,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:16,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-07 14:37:20,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:24,234 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-07 14:37:28,238 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-07 14:37:32,245 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-07 14:37:34,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:38,152 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-07 14:37:42,156 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-07 14:37:44,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:54,444 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-07 14:37:58,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:00,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:04,894 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-07 14:38:08,932 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-07 14:38:12,946 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-07 14:38:21,218 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-07 14:38:25,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:28,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:32,600 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-07 14:38:43,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:45,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:47,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:48,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:50,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:54,978 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-07 14:38:58,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:02,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-07 14:39:07,002 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-07 14:39:13,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:17,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-07 14:39:19,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:23,295 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-07 14:39:27,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:31,536 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-07 14:39:35,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-07 14:39:39,763 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-07 14:39:43,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:56,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:00,631 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-07 14:40:04,634 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-07 14:40:08,701 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-07 14:40:12,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:15,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:20,131 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-07 14:40:24,864 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-07 14:40:29,011 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-07 14:40:33,014 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-07 14:40:37,570 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-07 14:40:41,573 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-07 14:40:45,977 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-07 14:40:50,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:54,862 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-07 14:40:58,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:02,668 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-07 14:41:06,674 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-07 14:41:08,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:12,524 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-07 14:41:16,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:19,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:21,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:25,452 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-07 14:41:29,610 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-07 14:41:36,046 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-07 14:41:38,120 INFO L124 PetriNetUnfolderBase]: 8893/12653 cut-off events. [2024-02-07 14:41:38,120 INFO L125 PetriNetUnfolderBase]: For 102911/102911 co-relation queries the response was YES. [2024-02-07 14:41:38,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79516 conditions, 12653 events. 8893/12653 cut-off events. For 102911/102911 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 73127 event pairs, 546 based on Foata normal form. 68/12704 useless extension candidates. Maximal degree in co-relation 78631. Up to 8824 conditions per place. [2024-02-07 14:41:38,269 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 503 selfloop transitions, 165 changer transitions 19/692 dead transitions. [2024-02-07 14:41:38,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 692 transitions, 8117 flow [2024-02-07 14:41:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-07 14:41:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-07 14:41:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 459 transitions. [2024-02-07 14:41:38,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6891891891891891 [2024-02-07 14:41:38,274 INFO L175 Difference]: Start difference. First operand has 141 places, 320 transitions, 3696 flow. Second operand 18 states and 459 transitions. [2024-02-07 14:41:38,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 692 transitions, 8117 flow [2024-02-07 14:41:38,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 692 transitions, 7586 flow, removed 263 selfloop flow, removed 1 redundant places. [2024-02-07 14:41:38,559 INFO L231 Difference]: Finished difference. Result has 169 places, 454 transitions, 5609 flow [2024-02-07 14:41:38,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3243, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5609, PETRI_PLACES=169, PETRI_TRANSITIONS=454} [2024-02-07 14:41:38,560 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-02-07 14:41:38,560 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 454 transitions, 5609 flow [2024-02-07 14:41:38,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 17 states have internal predecessors, (215), 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-07 14:41:38,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:41:38,560 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:41:38,572 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-07 14:41:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:41:38,772 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-07 14:41:38,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:41:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1925323033, now seen corresponding path program 3 times [2024-02-07 14:41:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:41:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079729322] [2024-02-07 14:41:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:41:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:41:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:41:38,918 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-07 14:41:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:41:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079729322] [2024-02-07 14:41:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079729322] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:41:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104976883] [2024-02-07 14:41:38,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:41:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:41:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:41:38,920 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-07 14:41:38,921 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-07 14:41:39,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-07 14:41:39,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:41:39,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:41:39,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:42:00,576 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-07 14:42:00,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:42:29,822 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-07 14:42:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104976883] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:42:29,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:42:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 16 [2024-02-07 14:42:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005900709] [2024-02-07 14:42:29,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:42:29,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:42:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:42:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:42:29,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2024-02-07 14:42:33,873 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-07 14:42:33,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-02-07 14:42:33,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 454 transitions, 5609 flow. Second operand has 16 states, 16 states have (on average 13.0) internal successors, (208), 16 states have internal predecessors, (208), 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-07 14:42:33,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:42:33,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-02-07 14:42:33,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:42:41,533 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-07 14:42:46,339 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-07 14:42:51,664 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 44 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15