./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp1x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp1x3.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-3d25acf-m [2024-01-30 14:22:37,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:22:37,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:22:37,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:22:37,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:22:37,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:22:37,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:22:37,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:22:37,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:22:37,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:22:37,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:22:37,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:22:37,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:22:37,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:22:37,140 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:22:37,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:22:37,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:22:37,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:22:37,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:22:37,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:22:37,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:22:37,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:22:37,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:22:37,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:22:37,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:22:37,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:22:37,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:22:37,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:22:37,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:22:37,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:22:37,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:22:37,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:22:37,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:37,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:22:37,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:22:37,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:22:37,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:22:37,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:22:37,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:22:37,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:22:37,148 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:22:37,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:22:37,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:22:37,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:22:37,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:22:37,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:22:37,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:22:37,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:22:37,398 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:22:37,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-01-30 14:22:38,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:22:38,790 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:22:38,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-01-30 14:22:38,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d508f41f/af3afce6465547adb3d6c7d9a26da0ab/FLAG717ed420c [2024-01-30 14:22:38,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d508f41f/af3afce6465547adb3d6c7d9a26da0ab [2024-01-30 14:22:38,810 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:22:38,810 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:22:38,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp1x3.wvr.yml/witness.yml [2024-01-30 14:22:38,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:22:38,892 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:22:38,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:38,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:22:38,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:22:38,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:38" (1/2) ... [2024-01-30 14:22:38,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68281c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:38, skipping insertion in model container [2024-01-30 14:22:38,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:38" (1/2) ... [2024-01-30 14:22:38,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d210e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:38, skipping insertion in model container [2024-01-30 14:22:38,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:38" (2/2) ... [2024-01-30 14:22:38,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68281c05 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:38, skipping insertion in model container [2024-01-30 14:22:38,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:38" (2/2) ... [2024-01-30 14:22:38,903 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:22:38,919 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:22:38,920 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L40] (unsigned long )_argptr == 0UL [2024-01-30 14:22:38,920 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] n == 0U [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((((((0LL - (long long )x1) + (long long )x2 >= 0LL) && ((long long )x1 + (long long )x2 >= 0LL)) && ((0LL - (long long )x1) - (long long )x2 >= 0LL)) && ((long long )x1 - (long long )x2 >= 0LL)) && (x1 == 0U)) && (x2 == 0U)) && (n == 0U) [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Location invariant after [L37-L43] n == 0U [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (x2 == 0U) && (n == 0U) [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L48] (unsigned long )_argptr == 0UL [2024-01-30 14:22:38,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-30 14:22:38,922 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-30 14:22:38,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:22:39,099 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1875,1888] [2024-01-30 14:22:39,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:39,111 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:22:39,173 WARN L424 MainDispatcher]: Unable to annotate void* thread1(void* _argptr) { while (x1 < n) { x1 = x1 + x1; } return 0; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:22:39,197 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1875,1888] [2024-01-30 14:22:39,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:39,210 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:22:39,210 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39 WrapperNode [2024-01-30 14:22:39,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:39,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:39,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:22:39,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:22:39,217 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 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,230 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 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,253 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-01-30 14:22:39,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:39,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:22:39,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:22:39,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:22:39,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,289 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-30 14:22:39,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:22:39,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:22:39,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:22:39,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:22:39,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:39,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:22:39,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:22:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:22:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:22:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:22:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:22:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:22:39,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:22:39,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:22:39,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:22:39,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:22:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:22:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:22:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:22:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:22:39,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:22:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:22:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:22:39,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:22:39,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:22:39,398 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:22:39,493 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:22:39,495 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:22:39,643 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:22:39,643 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:22:39,724 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:22:39,724 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-30 14:22:39,725 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:39 BoogieIcfgContainer [2024-01-30 14:22:39,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:22:39,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:22:39,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:22:39,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:22:39,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:22:38" (1/4) ... [2024-01-30 14:22:39,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424fff1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:22:39, skipping insertion in model container [2024-01-30 14:22:39,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:38" (2/4) ... [2024-01-30 14:22:39,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424fff1d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:39, skipping insertion in model container [2024-01-30 14:22:39,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (3/4) ... [2024-01-30 14:22:39,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424fff1d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:39, skipping insertion in model container [2024-01-30 14:22:39,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:39" (4/4) ... [2024-01-30 14:22:39,731 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2024-01-30 14:22:39,744 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:22:39,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-01-30 14:22:39,744 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:22:39,782 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-30 14:22:39,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 96 flow [2024-01-30 14:22:39,832 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2024-01-30 14:22:39,833 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:22:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 39 events. 2/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-01-30 14:22:39,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 41 transitions, 96 flow [2024-01-30 14:22:39,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 38 transitions, 88 flow [2024-01-30 14:22:39,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:22:39,850 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;@26a35438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:22:39,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-01-30 14:22:39,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:22:39,852 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:22:39,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:39,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:39,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:22:39,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:39,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 8268, now seen corresponding path program 1 times [2024-01-30 14:22:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51624095] [2024-01-30 14:22:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:39,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51624095] [2024-01-30 14:22:40,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51624095] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:40,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:40,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:22:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925345473] [2024-01-30 14:22:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:40,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:40,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:40,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:22:40,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:40,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:22:40,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:40,340 INFO L124 PetriNetUnfolderBase]: 116/247 cut-off events. [2024-01-30 14:22:40,340 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:22:40,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 247 events. 116/247 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1085 event pairs, 72 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 384. Up to 190 conditions per place. [2024-01-30 14:22:40,343 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 20 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2024-01-30 14:22:40,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 130 flow [2024-01-30 14:22:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-01-30 14:22:40,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-01-30 14:22:40,353 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 88 flow. Second operand 3 states and 74 transitions. [2024-01-30 14:22:40,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 130 flow [2024-01-30 14:22:40,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:22:40,358 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 82 flow [2024-01-30 14:22:40,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2024-01-30 14:22:40,361 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2024-01-30 14:22:40,361 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 82 flow [2024-01-30 14:22:40,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:40,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:22:40,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:22:40,362 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:40,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash 256537, now seen corresponding path program 1 times [2024-01-30 14:22:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105382932] [2024-01-30 14:22:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105382932] [2024-01-30 14:22:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105382932] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769341719] [2024-01-30 14:22:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:40,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:40,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-01-30 14:22:40,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:40,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-01-30 14:22:40,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:40,451 INFO L124 PetriNetUnfolderBase]: 116/246 cut-off events. [2024-01-30 14:22:40,452 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:22:40,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 246 events. 116/246 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1081 event pairs, 72 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 437. Up to 188 conditions per place. [2024-01-30 14:22:40,454 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 19 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-01-30 14:22:40,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 122 flow [2024-01-30 14:22:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-01-30 14:22:40,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6178861788617886 [2024-01-30 14:22:40,456 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 82 flow. Second operand 3 states and 76 transitions. [2024-01-30 14:22:40,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 122 flow [2024-01-30 14:22:40,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:40,457 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 80 flow [2024-01-30 14:22:40,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2024-01-30 14:22:40,458 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-01-30 14:22:40,458 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 80 flow [2024-01-30 14:22:40,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:40,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:22:40,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:22:40,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:40,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash 7952871, now seen corresponding path program 1 times [2024-01-30 14:22:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731810780] [2024-01-30 14:22:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:40,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731810780] [2024-01-30 14:22:40,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731810780] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:40,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:40,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627843871] [2024-01-30 14:22:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:40,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:40,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2024-01-30 14:22:40,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:40,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2024-01-30 14:22:40,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:40,530 INFO L124 PetriNetUnfolderBase]: 116/245 cut-off events. [2024-01-30 14:22:40,530 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:22:40,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 245 events. 116/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1099 event pairs, 72 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 433. Up to 186 conditions per place. [2024-01-30 14:22:40,532 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 18 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2024-01-30 14:22:40,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 118 flow [2024-01-30 14:22:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-01-30 14:22:40,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2024-01-30 14:22:40,534 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 80 flow. Second operand 3 states and 78 transitions. [2024-01-30 14:22:40,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 118 flow [2024-01-30 14:22:40,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:40,535 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 78 flow [2024-01-30 14:22:40,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2024-01-30 14:22:40,536 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2024-01-30 14:22:40,536 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 78 flow [2024-01-30 14:22:40,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:40,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:40,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:22:40,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:40,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 701062874, now seen corresponding path program 1 times [2024-01-30 14:22:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374649692] [2024-01-30 14:22:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:40,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374649692] [2024-01-30 14:22:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374649692] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:40,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528152671] [2024-01-30 14:22:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:40,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:40,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:22:40,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:40,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:22:40,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:40,706 INFO L124 PetriNetUnfolderBase]: 68/160 cut-off events. [2024-01-30 14:22:40,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:40,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 160 events. 68/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 688 event pairs, 3 based on Foata normal form. 20/173 useless extension candidates. Maximal degree in co-relation 279. Up to 104 conditions per place. [2024-01-30 14:22:40,710 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2024-01-30 14:22:40,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 133 flow [2024-01-30 14:22:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-01-30 14:22:40,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-01-30 14:22:40,713 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 78 flow. Second operand 4 states and 97 transitions. [2024-01-30 14:22:40,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 133 flow [2024-01-30 14:22:40,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:40,742 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 70 flow [2024-01-30 14:22:40,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-01-30 14:22:40,744 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2024-01-30 14:22:40,744 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 70 flow [2024-01-30 14:22:40,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:40,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:40,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:22:40,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:40,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash -589308369, now seen corresponding path program 1 times [2024-01-30 14:22:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:40,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126462709] [2024-01-30 14:22:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126462709] [2024-01-30 14:22:40,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126462709] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:40,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841363588] [2024-01-30 14:22:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:40,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:40,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:40,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:40,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:22:40,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:40,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:22:40,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:40,925 INFO L124 PetriNetUnfolderBase]: 82/178 cut-off events. [2024-01-30 14:22:40,925 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-30 14:22:40,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 178 events. 82/178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 679 event pairs, 9 based on Foata normal form. 20/193 useless extension candidates. Maximal degree in co-relation 308. Up to 106 conditions per place. [2024-01-30 14:22:40,931 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 26 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-01-30 14:22:40,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 137 flow [2024-01-30 14:22:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-01-30 14:22:40,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-01-30 14:22:40,933 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 70 flow. Second operand 4 states and 100 transitions. [2024-01-30 14:22:40,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 137 flow [2024-01-30 14:22:40,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:40,935 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 63 flow [2024-01-30 14:22:40,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-01-30 14:22:40,937 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -11 predicate places. [2024-01-30 14:22:40,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 63 flow [2024-01-30 14:22:40,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:40,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:40,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:40,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:22:40,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:40,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1245992271, now seen corresponding path program 1 times [2024-01-30 14:22:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268066491] [2024-01-30 14:22:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:41,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268066491] [2024-01-30 14:22:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268066491] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765072500] [2024-01-30 14:22:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:41,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:41,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 41 [2024-01-30 14:22:41,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:41,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 41 [2024-01-30 14:22:41,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:41,109 INFO L124 PetriNetUnfolderBase]: 113/240 cut-off events. [2024-01-30 14:22:41,109 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-30 14:22:41,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 240 events. 113/240 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 990 event pairs, 24 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 437. Up to 138 conditions per place. [2024-01-30 14:22:41,110 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 24 selfloop transitions, 5 changer transitions 1/39 dead transitions. [2024-01-30 14:22:41,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 152 flow [2024-01-30 14:22:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-01-30 14:22:41,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7886178861788617 [2024-01-30 14:22:41,111 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 63 flow. Second operand 3 states and 97 transitions. [2024-01-30 14:22:41,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 152 flow [2024-01-30 14:22:41,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:41,112 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 85 flow [2024-01-30 14:22:41,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2024-01-30 14:22:41,113 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -10 predicate places. [2024-01-30 14:22:41,113 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 85 flow [2024-01-30 14:22:41,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:41,113 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] [2024-01-30 14:22:41,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:22:41,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:41,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1094094752, now seen corresponding path program 1 times [2024-01-30 14:22:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:41,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435318981] [2024-01-30 14:22:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435318981] [2024-01-30 14:22:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435318981] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:41,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:41,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458920400] [2024-01-30 14:22:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:41,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:22:41,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:41,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:22:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:41,278 INFO L124 PetriNetUnfolderBase]: 175/327 cut-off events. [2024-01-30 14:22:41,278 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-01-30 14:22:41,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 327 events. 175/327 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1379 event pairs, 19 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 699. Up to 97 conditions per place. [2024-01-30 14:22:41,280 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 35 selfloop transitions, 12 changer transitions 3/57 dead transitions. [2024-01-30 14:22:41,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 256 flow [2024-01-30 14:22:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-01-30 14:22:41,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2024-01-30 14:22:41,281 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 85 flow. Second operand 5 states and 150 transitions. [2024-01-30 14:22:41,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 256 flow [2024-01-30 14:22:41,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:41,283 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 149 flow [2024-01-30 14:22:41,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2024-01-30 14:22:41,284 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-01-30 14:22:41,284 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 149 flow [2024-01-30 14:22:41,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:41,284 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] [2024-01-30 14:22:41,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:22:41,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:41,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash 972814994, now seen corresponding path program 2 times [2024-01-30 14:22:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331347758] [2024-01-30 14:22:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331347758] [2024-01-30 14:22:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331347758] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:41,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821829177] [2024-01-30 14:22:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:41,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:41,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:41,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:22:41,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:41,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:22:41,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:41,461 INFO L124 PetriNetUnfolderBase]: 161/315 cut-off events. [2024-01-30 14:22:41,461 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2024-01-30 14:22:41,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 315 events. 161/315 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1313 event pairs, 24 based on Foata normal form. 12/315 useless extension candidates. Maximal degree in co-relation 849. Up to 119 conditions per place. [2024-01-30 14:22:41,463 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 39 selfloop transitions, 15 changer transitions 4/65 dead transitions. [2024-01-30 14:22:41,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 65 transitions, 363 flow [2024-01-30 14:22:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-01-30 14:22:41,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7463414634146341 [2024-01-30 14:22:41,464 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 149 flow. Second operand 5 states and 153 transitions. [2024-01-30 14:22:41,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 65 transitions, 363 flow [2024-01-30 14:22:41,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:41,466 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 247 flow [2024-01-30 14:22:41,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-01-30 14:22:41,466 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-01-30 14:22:41,466 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 247 flow [2024-01-30 14:22:41,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:41,466 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] [2024-01-30 14:22:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:22:41,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:41,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash -610175777, now seen corresponding path program 1 times [2024-01-30 14:22:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423865069] [2024-01-30 14:22:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423865069] [2024-01-30 14:22:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423865069] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:41,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586055680] [2024-01-30 14:22:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:41,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:41,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:41,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:22:41,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:41,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:22:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:41,600 INFO L124 PetriNetUnfolderBase]: 157/311 cut-off events. [2024-01-30 14:22:41,600 INFO L125 PetriNetUnfolderBase]: For 809/817 co-relation queries the response was YES. [2024-01-30 14:22:41,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 311 events. 157/311 cut-off events. For 809/817 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1300 event pairs, 17 based on Foata normal form. 8/312 useless extension candidates. Maximal degree in co-relation 1055. Up to 143 conditions per place. [2024-01-30 14:22:41,602 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 41 selfloop transitions, 10 changer transitions 4/62 dead transitions. [2024-01-30 14:22:41,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 435 flow [2024-01-30 14:22:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-01-30 14:22:41,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7170731707317073 [2024-01-30 14:22:41,603 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 247 flow. Second operand 5 states and 147 transitions. [2024-01-30 14:22:41,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 435 flow [2024-01-30 14:22:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 433 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:41,606 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 292 flow [2024-01-30 14:22:41,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-01-30 14:22:41,607 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2024-01-30 14:22:41,607 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 292 flow [2024-01-30 14:22:41,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:41,607 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] [2024-01-30 14:22:41,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:22:41,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:41,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1989891993, now seen corresponding path program 2 times [2024-01-30 14:22:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389117026] [2024-01-30 14:22:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:41,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:41,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389117026] [2024-01-30 14:22:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389117026] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:41,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113381987] [2024-01-30 14:22:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:41,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:41,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:41,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:41,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:22:41,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:41,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:22:41,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:41,739 INFO L124 PetriNetUnfolderBase]: 133/272 cut-off events. [2024-01-30 14:22:41,739 INFO L125 PetriNetUnfolderBase]: For 898/898 co-relation queries the response was YES. [2024-01-30 14:22:41,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 272 events. 133/272 cut-off events. For 898/898 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 985 event pairs, 28 based on Foata normal form. 10/277 useless extension candidates. Maximal degree in co-relation 995. Up to 150 conditions per place. [2024-01-30 14:22:41,741 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 40 selfloop transitions, 14 changer transitions 4/65 dead transitions. [2024-01-30 14:22:41,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 510 flow [2024-01-30 14:22:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-01-30 14:22:41,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7170731707317073 [2024-01-30 14:22:41,742 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 292 flow. Second operand 5 states and 147 transitions. [2024-01-30 14:22:41,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 510 flow [2024-01-30 14:22:41,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 491 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-30 14:22:41,745 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 357 flow [2024-01-30 14:22:41,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-01-30 14:22:41,745 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-01-30 14:22:41,745 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 357 flow [2024-01-30 14:22:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:41,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:41,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:22:41,746 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:22:41,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -871232890, now seen corresponding path program 1 times [2024-01-30 14:22:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887414511] [2024-01-30 14:22:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887414511] [2024-01-30 14:22:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887414511] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565264443] [2024-01-30 14:22:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:42,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-30 14:22:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:42,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:22:42,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:50,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:52,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565264443] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:52,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:52,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-01-30 14:22:52,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069595706] [2024-01-30 14:22:52,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:52,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-30 14:22:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:52,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-30 14:22:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=194, Unknown=1, NotChecked=0, Total=272 [2024-01-30 14:22:55,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:22:57,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:22:57,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 357 flow. Second operand has 17 states, 17 states have (on average 19.58823529411765) internal successors, (333), 17 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:57,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:57,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:22:57,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:03,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:05,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:06,495 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-01-30 14:23:11,069 INFO L124 PetriNetUnfolderBase]: 483/938 cut-off events. [2024-01-30 14:23:11,069 INFO L125 PetriNetUnfolderBase]: For 4418/4418 co-relation queries the response was YES. [2024-01-30 14:23:11,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 938 events. 483/938 cut-off events. For 4418/4418 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4896 event pairs, 36 based on Foata normal form. 8/943 useless extension candidates. Maximal degree in co-relation 3877. Up to 198 conditions per place. [2024-01-30 14:23:11,075 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 112 selfloop transitions, 74 changer transitions 19/212 dead transitions. [2024-01-30 14:23:11,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 212 transitions, 1904 flow [2024-01-30 14:23:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-30 14:23:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-01-30 14:23:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 506 transitions. [2024-01-30 14:23:11,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170731707317073 [2024-01-30 14:23:11,081 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 357 flow. Second operand 20 states and 506 transitions. [2024-01-30 14:23:11,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 212 transitions, 1904 flow [2024-01-30 14:23:11,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 212 transitions, 1887 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-30 14:23:11,089 INFO L231 Difference]: Finished difference. Result has 84 places, 113 transitions, 1374 flow [2024-01-30 14:23:11,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1374, PETRI_PLACES=84, PETRI_TRANSITIONS=113} [2024-01-30 14:23:11,090 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2024-01-30 14:23:11,090 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 113 transitions, 1374 flow [2024-01-30 14:23:11,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.58823529411765) internal successors, (333), 17 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:11,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:11,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:11,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-30 14:23:11,292 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,SelfDestructingSolverStorable10 [2024-01-30 14:23:11,293 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:23:11,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1197696258, now seen corresponding path program 2 times [2024-01-30 14:23:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148774101] [2024-01-30 14:23:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148774101] [2024-01-30 14:23:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148774101] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:23:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502666745] [2024-01-30 14:23:11,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-30 14:23:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:23:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:23:11,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:23:11,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-30 14:23:11,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-30 14:23:11,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:23:11,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:23:11,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:23:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:17,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:23:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502666745] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:23:18,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:23:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-01-30 14:23:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165704211] [2024-01-30 14:23:18,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:23:18,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-30 14:23:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-30 14:23:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=197, Unknown=1, NotChecked=0, Total=272 [2024-01-30 14:23:21,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:21,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:23:21,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 113 transitions, 1374 flow. Second operand has 17 states, 17 states have (on average 19.470588235294116) internal successors, (331), 17 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:21,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:21,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:23:21,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:25,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:29,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:32,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:34,716 INFO L124 PetriNetUnfolderBase]: 857/1627 cut-off events. [2024-01-30 14:23:34,716 INFO L125 PetriNetUnfolderBase]: For 13612/13612 co-relation queries the response was YES. [2024-01-30 14:23:34,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8411 conditions, 1627 events. 857/1627 cut-off events. For 13612/13612 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9748 event pairs, 78 based on Foata normal form. 7/1631 useless extension candidates. Maximal degree in co-relation 8356. Up to 529 conditions per place. [2024-01-30 14:23:34,731 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 144 selfloop transitions, 160 changer transitions 15/326 dead transitions. [2024-01-30 14:23:34,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 326 transitions, 4123 flow [2024-01-30 14:23:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-30 14:23:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-30 14:23:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 577 transitions. [2024-01-30 14:23:34,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6118769883351007 [2024-01-30 14:23:34,737 INFO L175 Difference]: Start difference. First operand has 84 places, 113 transitions, 1374 flow. Second operand 23 states and 577 transitions. [2024-01-30 14:23:34,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 326 transitions, 4123 flow [2024-01-30 14:23:34,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 326 transitions, 3687 flow, removed 213 selfloop flow, removed 4 redundant places. [2024-01-30 14:23:34,770 INFO L231 Difference]: Finished difference. Result has 110 places, 219 transitions, 3108 flow [2024-01-30 14:23:34,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3108, PETRI_PLACES=110, PETRI_TRANSITIONS=219} [2024-01-30 14:23:34,771 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-01-30 14:23:34,771 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 219 transitions, 3108 flow [2024-01-30 14:23:34,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.470588235294116) internal successors, (331), 17 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:34,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:34,771 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:34,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-30 14:23:34,972 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,SelfDestructingSolverStorable11 [2024-01-30 14:23:34,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:23:34,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:34,974 INFO L85 PathProgramCache]: Analyzing trace with hash -334937455, now seen corresponding path program 3 times [2024-01-30 14:23:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:34,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153794406] [2024-01-30 14:23:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:35,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:35,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153794406] [2024-01-30 14:23:35,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153794406] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:23:35,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505543589] [2024-01-30 14:23:35,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-30 14:23:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:23:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:23:35,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:23:35,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-30 14:23:35,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-30 14:23:35,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:23:35,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-30 14:23:35,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:23:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:43,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:23:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:45,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505543589] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:23:45,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:23:45,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 17 [2024-01-30 14:23:45,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292274706] [2024-01-30 14:23:45,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:23:45,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-30 14:23:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:45,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-30 14:23:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-01-30 14:23:49,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:49,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:23:49,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 219 transitions, 3108 flow. Second operand has 17 states, 17 states have (on average 23.11764705882353) internal successors, (393), 17 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:49,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:49,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:23:49,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:52,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:39,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:43,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:46,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:48,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:50,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:53,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:25:01,644 INFO L124 PetriNetUnfolderBase]: 1387/2679 cut-off events. [2024-01-30 14:25:01,645 INFO L125 PetriNetUnfolderBase]: For 32029/32029 co-relation queries the response was YES. [2024-01-30 14:25:01,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14963 conditions, 2679 events. 1387/2679 cut-off events. For 32029/32029 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 17566 event pairs, 96 based on Foata normal form. 96/2772 useless extension candidates. Maximal degree in co-relation 14889. Up to 539 conditions per place. [2024-01-30 14:25:01,667 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 227 selfloop transitions, 288 changer transitions 5/527 dead transitions. [2024-01-30 14:25:01,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 527 transitions, 7246 flow [2024-01-30 14:25:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-01-30 14:25:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-01-30 14:25:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1018 transitions. [2024-01-30 14:25:01,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6710613052076466 [2024-01-30 14:25:01,670 INFO L175 Difference]: Start difference. First operand has 110 places, 219 transitions, 3108 flow. Second operand 37 states and 1018 transitions. [2024-01-30 14:25:01,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 527 transitions, 7246 flow [2024-01-30 14:25:01,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 527 transitions, 7112 flow, removed 60 selfloop flow, removed 6 redundant places. [2024-01-30 14:25:01,758 INFO L231 Difference]: Finished difference. Result has 160 places, 356 transitions, 6356 flow [2024-01-30 14:25:01,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=6356, PETRI_PLACES=160, PETRI_TRANSITIONS=356} [2024-01-30 14:25:01,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-01-30 14:25:01,760 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 356 transitions, 6356 flow [2024-01-30 14:25:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 23.11764705882353) internal successors, (393), 17 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:01,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:01,760 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:01,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-30 14:25:01,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:25:01,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:25:01,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 322041451, now seen corresponding path program 4 times [2024-01-30 14:25:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38782174] [2024-01-30 14:25:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:02,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38782174] [2024-01-30 14:25:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38782174] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:25:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500435201] [2024-01-30 14:25:02,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-30 14:25:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:25:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:25:02,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:25:02,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-30 14:25:02,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-30 14:25:02,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:25:02,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:25:02,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:25:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:02,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:25:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:03,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500435201] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:25:03,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:25:03,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-01-30 14:25:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603818976] [2024-01-30 14:25:03,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:25:03,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-30 14:25:03,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:03,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-30 14:25:03,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-01-30 14:25:03,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:25:03,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 356 transitions, 6356 flow. Second operand has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:03,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:03,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:25:03,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:05,144 INFO L124 PetriNetUnfolderBase]: 1421/2747 cut-off events. [2024-01-30 14:25:05,144 INFO L125 PetriNetUnfolderBase]: For 53537/53545 co-relation queries the response was YES. [2024-01-30 14:25:05,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18620 conditions, 2747 events. 1421/2747 cut-off events. For 53537/53545 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 17742 event pairs, 107 based on Foata normal form. 32/2774 useless extension candidates. Maximal degree in co-relation 18523. Up to 1031 conditions per place. [2024-01-30 14:25:05,171 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 288 selfloop transitions, 92 changer transitions 40/427 dead transitions. [2024-01-30 14:25:05,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 427 transitions, 8033 flow [2024-01-30 14:25:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-30 14:25:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-30 14:25:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 352 transitions. [2024-01-30 14:25:05,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5723577235772358 [2024-01-30 14:25:05,173 INFO L175 Difference]: Start difference. First operand has 160 places, 356 transitions, 6356 flow. Second operand 15 states and 352 transitions. [2024-01-30 14:25:05,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 427 transitions, 8033 flow [2024-01-30 14:25:05,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 427 transitions, 7820 flow, removed 98 selfloop flow, removed 6 redundant places. [2024-01-30 14:25:05,372 INFO L231 Difference]: Finished difference. Result has 173 places, 356 transitions, 6389 flow [2024-01-30 14:25:05,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5981, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6389, PETRI_PLACES=173, PETRI_TRANSITIONS=356} [2024-01-30 14:25:05,373 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-01-30 14:25:05,373 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 356 transitions, 6389 flow [2024-01-30 14:25:05,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:05,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:05,373 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:05,385 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-01-30 14:25:05,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:25:05,585 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:25:05,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash -693943135, now seen corresponding path program 5 times [2024-01-30 14:25:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366485446] [2024-01-30 14:25:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366485446] [2024-01-30 14:25:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366485446] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:25:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843111280] [2024-01-30 14:25:05,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-30 14:25:05,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:25:05,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:25:05,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:25:05,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-30 14:25:05,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-01-30 14:25:05,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:25:05,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-30 14:25:05,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:25:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:06,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:25:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843111280] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:25:06,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:25:06,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-01-30 14:25:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270413772] [2024-01-30 14:25:06,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:25:06,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-30 14:25:06,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:06,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-30 14:25:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-01-30 14:25:06,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:25:06,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 356 transitions, 6389 flow. Second operand has 12 states, 12 states have (on average 23.583333333333332) internal successors, (283), 12 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:06,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:06,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:25:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:08,603 INFO L124 PetriNetUnfolderBase]: 1507/2927 cut-off events. [2024-01-30 14:25:08,603 INFO L125 PetriNetUnfolderBase]: For 61823/61823 co-relation queries the response was YES. [2024-01-30 14:25:08,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20318 conditions, 2927 events. 1507/2927 cut-off events. For 61823/61823 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19258 event pairs, 190 based on Foata normal form. 47/2971 useless extension candidates. Maximal degree in co-relation 20214. Up to 1237 conditions per place. [2024-01-30 14:25:08,648 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 275 selfloop transitions, 221 changer transitions 3/506 dead transitions. [2024-01-30 14:25:08,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 506 transitions, 9326 flow [2024-01-30 14:25:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-30 14:25:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-30 14:25:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 528 transitions. [2024-01-30 14:25:08,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6777920410783055 [2024-01-30 14:25:08,661 INFO L175 Difference]: Start difference. First operand has 173 places, 356 transitions, 6389 flow. Second operand 19 states and 528 transitions. [2024-01-30 14:25:08,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 506 transitions, 9326 flow [2024-01-30 14:25:08,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 506 transitions, 9092 flow, removed 24 selfloop flow, removed 14 redundant places. [2024-01-30 14:25:08,892 INFO L231 Difference]: Finished difference. Result has 182 places, 396 transitions, 7941 flow [2024-01-30 14:25:08,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5988, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7941, PETRI_PLACES=182, PETRI_TRANSITIONS=396} [2024-01-30 14:25:08,893 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2024-01-30 14:25:08,893 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 396 transitions, 7941 flow [2024-01-30 14:25:08,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.583333333333332) internal successors, (283), 12 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:08,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:08,893 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:08,906 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-01-30 14:25:09,105 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,SelfDestructingSolverStorable14 [2024-01-30 14:25:09,105 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:25:09,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 626225265, now seen corresponding path program 6 times [2024-01-30 14:25:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005042873] [2024-01-30 14:25:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005042873] [2024-01-30 14:25:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005042873] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:25:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50738994] [2024-01-30 14:25:09,217 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-30 14:25:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:25:09,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:25:09,218 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-01-30 14:25:09,239 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-01-30 14:25:09,565 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-30 14:25:09,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:25:09,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-30 14:25:09,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:25:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:10,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:25:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50738994] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:25:10,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:25:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 18 [2024-01-30 14:25:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558905470] [2024-01-30 14:25:10,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:25:10,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-30 14:25:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-30 14:25:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-01-30 14:25:11,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:25:11,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 396 transitions, 7941 flow. Second operand has 18 states, 18 states have (on average 22.944444444444443) internal successors, (413), 18 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:11,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:25:11,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:25:11,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:25:22,276 INFO L124 PetriNetUnfolderBase]: 1727/3348 cut-off events. [2024-01-30 14:25:22,277 INFO L125 PetriNetUnfolderBase]: For 89035/89035 co-relation queries the response was YES. [2024-01-30 14:25:22,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25473 conditions, 3348 events. 1727/3348 cut-off events. For 89035/89035 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22535 event pairs, 84 based on Foata normal form. 31/3376 useless extension candidates. Maximal degree in co-relation 25366. Up to 807 conditions per place. [2024-01-30 14:25:22,306 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 174 selfloop transitions, 421 changer transitions 25/627 dead transitions. [2024-01-30 14:25:22,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 627 transitions, 12638 flow [2024-01-30 14:25:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-01-30 14:25:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-01-30 14:25:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 977 transitions. [2024-01-30 14:25:22,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6440342781806196 [2024-01-30 14:25:22,310 INFO L175 Difference]: Start difference. First operand has 182 places, 396 transitions, 7941 flow. Second operand 37 states and 977 transitions. [2024-01-30 14:25:22,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 627 transitions, 12638 flow [2024-01-30 14:25:22,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 627 transitions, 12284 flow, removed 57 selfloop flow, removed 9 redundant places. [2024-01-30 14:25:22,594 INFO L231 Difference]: Finished difference. Result has 215 places, 489 transitions, 10825 flow [2024-01-30 14:25:22,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7430, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10825, PETRI_PLACES=215, PETRI_TRANSITIONS=489} [2024-01-30 14:25:22,595 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-01-30 14:25:22,595 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 489 transitions, 10825 flow [2024-01-30 14:25:22,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 22.944444444444443) internal successors, (413), 18 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:25:22,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:25:22,596 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:25:22,610 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-01-30 14:25:22,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-30 14:25:22,807 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:25:22,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:25:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 366832866, now seen corresponding path program 7 times [2024-01-30 14:25:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:25:22,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162302174] [2024-01-30 14:25:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:25:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:25:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:25:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162302174] [2024-01-30 14:25:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162302174] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:25:22,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191839183] [2024-01-30 14:25:22,983 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-30 14:25:22,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:25:22,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:25:22,984 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-01-30 14:25:23,041 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-01-30 14:25:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:25:23,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-30 14:25:23,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:26:29,779 WARN L293 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-30 14:26:36,271 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 13 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-30 14:26:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:36,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:27:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:27:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191839183] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:27:11,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:27:11,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 20 [2024-01-30 14:27:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884846288] [2024-01-30 14:27:11,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:27:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-30 14:27:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:27:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-30 14:27:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=267, Unknown=13, NotChecked=0, Total=380 [2024-01-30 14:27:16,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:19,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:23,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:27,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:27,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-01-30 14:27:27,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 489 transitions, 10825 flow. Second operand has 20 states, 20 states have (on average 19.75) internal successors, (395), 20 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:27:27,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:27:27,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-01-30 14:27:27,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:27:33,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:36,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:42,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:46,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:49,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:52,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:56,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:59,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:28:06,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:28:21,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:28:24,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:28:33,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:28:52,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:28:56,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:29:00,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:29:03,400 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-01-30 14:29:28,071 WARN L293 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 48 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:29:38,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:29:44,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:29:45,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:30:15,573 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 50 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:30:24,329 WARN L293 SmtUtils]: Spent 7.78s on a formula simplification. DAG size of input: 54 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:30:41,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:30:47,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:30:52,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:30:56,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:30:57,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:00,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:02,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:22,384 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 42 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:31:26,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:40,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:44,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:46,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:51,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:57,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:02,896 INFO L124 PetriNetUnfolderBase]: 2419/4776 cut-off events. [2024-01-30 14:32:02,897 INFO L125 PetriNetUnfolderBase]: For 155900/155900 co-relation queries the response was YES. [2024-01-30 14:32:02,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38316 conditions, 4776 events. 2419/4776 cut-off events. For 155900/155900 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 34547 event pairs, 54 based on Foata normal form. 96/4869 useless extension candidates. Maximal degree in co-relation 38203. Up to 984 conditions per place. [2024-01-30 14:32:02,939 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 349 selfloop transitions, 534 changer transitions 17/907 dead transitions. [2024-01-30 14:32:02,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 907 transitions, 19678 flow [2024-01-30 14:32:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-01-30 14:32:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-01-30 14:32:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 1054 transitions. [2024-01-30 14:32:02,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978445830969937 [2024-01-30 14:32:02,942 INFO L175 Difference]: Start difference. First operand has 215 places, 489 transitions, 10825 flow. Second operand 43 states and 1054 transitions. [2024-01-30 14:32:02,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 907 transitions, 19678 flow [2024-01-30 14:32:03,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 907 transitions, 18608 flow, removed 403 selfloop flow, removed 14 redundant places. [2024-01-30 14:32:03,653 INFO L231 Difference]: Finished difference. Result has 261 places, 690 transitions, 17093 flow [2024-01-30 14:32:03,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9741, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=17093, PETRI_PLACES=261, PETRI_TRANSITIONS=690} [2024-01-30 14:32:03,654 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places. [2024-01-30 14:32:03,654 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 690 transitions, 17093 flow [2024-01-30 14:32:03,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 19.75) internal successors, (395), 20 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:32:03,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:32:03,654 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:32:03,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-01-30 14:32:03,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:32:03,866 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:32:03,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:32:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash 975654497, now seen corresponding path program 8 times [2024-01-30 14:32:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:32:03,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491246109] [2024-01-30 14:32:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:32:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:32:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:32:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:32:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:32:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491246109] [2024-01-30 14:32:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491246109] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:32:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077360849] [2024-01-30 14:32:04,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-30 14:32:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:32:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:32:04,329 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-01-30 14:32:04,330 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-01-30 14:32:04,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-30 14:32:04,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:32:04,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-30 14:32:04,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:32:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:32:10,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:32:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:32:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077360849] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:32:11,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:32:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-01-30 14:32:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997120710] [2024-01-30 14:32:11,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:32:11,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-30 14:32:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:32:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-30 14:32:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-01-30 14:32:14,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-01-30 14:32:14,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 690 transitions, 17093 flow. Second operand has 23 states, 23 states have (on average 22.434782608695652) internal successors, (516), 23 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:32:14,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:32:14,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-01-30 14:32:14,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:32:30,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:46,692 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 81 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:32:50,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:58,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:01,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:26,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:35,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:54,242 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 96 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:33:57,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:00,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:06,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:11,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:13,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:14,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:24,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:28,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:33,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:36,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:40,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:48,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:51,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:35:14,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:35:16,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:35:20,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:35:28,820 INFO L124 PetriNetUnfolderBase]: 3595/7092 cut-off events. [2024-01-30 14:35:28,820 INFO L125 PetriNetUnfolderBase]: For 273891/273891 co-relation queries the response was YES. [2024-01-30 14:35:28,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61929 conditions, 7092 events. 3595/7092 cut-off events. For 273891/273891 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 55522 event pairs, 346 based on Foata normal form. 21/7110 useless extension candidates. Maximal degree in co-relation 61796. Up to 2644 conditions per place. [2024-01-30 14:35:28,979 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 423 selfloop transitions, 760 changer transitions 26/1216 dead transitions. [2024-01-30 14:35:28,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1216 transitions, 29552 flow [2024-01-30 14:35:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-01-30 14:35:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2024-01-30 14:35:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1424 transitions. [2024-01-30 14:35:28,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6679174484052532 [2024-01-30 14:35:28,989 INFO L175 Difference]: Start difference. First operand has 261 places, 690 transitions, 17093 flow. Second operand 52 states and 1424 transitions. [2024-01-30 14:35:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1216 transitions, 29552 flow [2024-01-30 14:35:30,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1216 transitions, 28200 flow, removed 360 selfloop flow, removed 8 redundant places. [2024-01-30 14:35:30,890 INFO L231 Difference]: Finished difference. Result has 321 places, 951 transitions, 25575 flow [2024-01-30 14:35:30,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=16290, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=511, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=25575, PETRI_PLACES=321, PETRI_TRANSITIONS=951} [2024-01-30 14:35:30,892 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 278 predicate places. [2024-01-30 14:35:30,892 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 951 transitions, 25575 flow [2024-01-30 14:35:30,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 22.434782608695652) internal successors, (516), 23 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:35:30,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:35:30,893 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:35:30,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-30 14:35:31,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-01-30 14:35:31,100 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 19 more)] === [2024-01-30 14:35:31,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:35:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1830143226, now seen corresponding path program 9 times [2024-01-30 14:35:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:35:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811140096] [2024-01-30 14:35:31,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:35:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:35:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:35:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:35:36,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:35:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811140096] [2024-01-30 14:35:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811140096] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:35:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727640976] [2024-01-30 14:35:36,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-30 14:35:36,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:35:36,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:35:36,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:35:36,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-30 14:35:36,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-30 14:35:36,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:35:36,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-30 14:35:36,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:35:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-30 14:35:43,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:35:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:35:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727640976] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:35:47,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:35:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 10] total 23 [2024-01-30 14:35:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051395419] [2024-01-30 14:35:47,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:35:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-30 14:35:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:35:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-30 14:35:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=413, Unknown=1, NotChecked=0, Total=506 [2024-01-30 14:35:52,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:35:58,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2024-01-30 14:35:58,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 951 transitions, 25575 flow. Second operand has 23 states, 23 states have (on average 21.52173913043478) internal successors, (495), 23 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:35:58,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:35:58,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2024-01-30 14:35:58,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:36:11,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:36:46,716 WARN L293 SmtUtils]: Spent 14.85s on a formula simplification. DAG size of input: 116 DAG size of output: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:36:53,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:37:10,720 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 [] Killed by 15