./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7faf759f4f4392e84815a483ab24e4497f918cd291dc733acf407d398902eccf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:11:11,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:11:11,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:11:11,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:11:11,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:11:11,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:11:11,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:11:11,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:11:11,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:11:11,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:11:11,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:11:11,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:11:11,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:11:11,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:11:11,907 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:11:11,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:11:11,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:11:11,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:11:11,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:11:11,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:11:11,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:11:11,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:11:11,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:11:11,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:11:11,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:11:11,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:11:11,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:11:11,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:11:11,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:11:11,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:11:11,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:11:11,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:11:11,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:11:11,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:11:11,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:11:11,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:11:11,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:11:11,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:11:11,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:11:11,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:11:11,915 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:11:11,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:11:11,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:11:11,915 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7faf759f4f4392e84815a483ab24e4497f918cd291dc733acf407d398902eccf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:11:12,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:11:12,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:11:12,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:11:12,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:11:12,208 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:11:12,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-02-19 15:11:13,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:11:13,693 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:11:13,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-02-19 15:11:13,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3341c3baa/6137b5c2ce8443afa73136dba0719457/FLAG873637162 [2024-02-19 15:11:13,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3341c3baa/6137b5c2ce8443afa73136dba0719457 [2024-02-19 15:11:13,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:11:13,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:11:13,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:11:13,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:11:13,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:11:13,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:11:13" (1/1) ... [2024-02-19 15:11:13,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f024e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:13, skipping insertion in model container [2024-02-19 15:11:13,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:11:13" (1/1) ... [2024-02-19 15:11:13,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:11:13,965 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/popl20-mult-equiv.wvr.c[2591,2604] [2024-02-19 15:11:13,972 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:11:13,984 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:11:14,022 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/popl20-mult-equiv.wvr.c[2591,2604] [2024-02-19 15:11:14,024 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:11:14,038 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:11:14,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14 WrapperNode [2024-02-19 15:11:14,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:11:14,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:11:14,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:11:14,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:11:14,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,088 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-02-19 15:11:14,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:11:14,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:11:14,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:11:14,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:11:14,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,130 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-19 15:11:14,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:11:14,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:11:14,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:11:14,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:11:14,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (1/1) ... [2024-02-19 15:11:14,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:11:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:11:14,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:11:14,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:11:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:11:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:11:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:11:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:11:14,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:11:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:11:14,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:11:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:11:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:11:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:11:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:11:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:11:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:11:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:11:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:11:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:11:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:11:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:11:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:11:14,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:11:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:11:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:11:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:11:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:11:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:11:14,238 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:11:14,333 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:11:14,335 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:11:14,564 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:11:14,564 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:11:14,739 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:11:14,739 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:11:14,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:11:14 BoogieIcfgContainer [2024-02-19 15:11:14,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:11:14,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:11:14,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:11:14,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:11:14,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:11:13" (1/3) ... [2024-02-19 15:11:14,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414641b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:11:14, skipping insertion in model container [2024-02-19 15:11:14,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:11:14" (2/3) ... [2024-02-19 15:11:14,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414641b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:11:14, skipping insertion in model container [2024-02-19 15:11:14,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:11:14" (3/3) ... [2024-02-19 15:11:14,750 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-02-19 15:11:14,766 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:11:14,766 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:11:14,766 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:11:14,811 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:11:14,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 83 flow [2024-02-19 15:11:14,900 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2024-02-19 15:11:14,900 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:11:14,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-02-19 15:11:14,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 83 flow [2024-02-19 15:11:14,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2024-02-19 15:11:14,921 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:11:14,928 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6cc25429, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:11:14,928 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:11:14,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:11:14,943 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2024-02-19 15:11:14,943 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:11:14,943 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:14,944 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:11:14,945 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:14,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2003150636, now seen corresponding path program 1 times [2024-02-19 15:11:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:14,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546366973] [2024-02-19 15:11:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546366973] [2024-02-19 15:11:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546366973] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:15,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:11:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486724236] [2024-02-19 15:11:15,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:15,599 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:11:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:11:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:11:15,632 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2024-02-19 15:11:15,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:15,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:15,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2024-02-19 15:11:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:15,822 INFO L124 PetriNetUnfolderBase]: 271/484 cut-off events. [2024-02-19 15:11:15,823 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-02-19 15:11:15,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 484 events. 271/484 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2100 event pairs, 37 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 718. Up to 309 conditions per place. [2024-02-19 15:11:15,831 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-02-19 15:11:15,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 189 flow [2024-02-19 15:11:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:11:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:11:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-02-19 15:11:15,843 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-02-19 15:11:15,847 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-02-19 15:11:15,848 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 189 flow [2024-02-19 15:11:15,848 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:15,848 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:15,848 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:11:15,849 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:11:15,849 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:15,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash -32365614, now seen corresponding path program 1 times [2024-02-19 15:11:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155039695] [2024-02-19 15:11:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155039695] [2024-02-19 15:11:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155039695] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:16,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926785018] [2024-02-19 15:11:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:16,132 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:11:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:11:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:11:16,173 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:11:16,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:16,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:16,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:11:16,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:16,395 INFO L124 PetriNetUnfolderBase]: 532/882 cut-off events. [2024-02-19 15:11:16,395 INFO L125 PetriNetUnfolderBase]: For 295/349 co-relation queries the response was YES. [2024-02-19 15:11:16,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 882 events. 532/882 cut-off events. For 295/349 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4212 event pairs, 13 based on Foata normal form. 20/886 useless extension candidates. Maximal degree in co-relation 2213. Up to 550 conditions per place. [2024-02-19 15:11:16,403 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 80 selfloop transitions, 14 changer transitions 1/100 dead transitions. [2024-02-19 15:11:16,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 100 transitions, 623 flow [2024-02-19 15:11:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:11:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:11:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-02-19 15:11:16,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6221198156682027 [2024-02-19 15:11:16,410 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2024-02-19 15:11:16,410 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 100 transitions, 623 flow [2024-02-19 15:11:16,410 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:16,410 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:16,410 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:11:16,411 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:11:16,412 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:16,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -828873082, now seen corresponding path program 2 times [2024-02-19 15:11:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343678020] [2024-02-19 15:11:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:16,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343678020] [2024-02-19 15:11:16,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343678020] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:16,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:16,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108822519] [2024-02-19 15:11:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:16,668 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:11:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:11:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:11:16,692 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:11:16,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 100 transitions, 623 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:16,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:16,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:11:16,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:16,913 INFO L124 PetriNetUnfolderBase]: 644/1036 cut-off events. [2024-02-19 15:11:16,913 INFO L125 PetriNetUnfolderBase]: For 600/787 co-relation queries the response was YES. [2024-02-19 15:11:16,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 1036 events. 644/1036 cut-off events. For 600/787 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4933 event pairs, 27 based on Foata normal form. 22/1036 useless extension candidates. Maximal degree in co-relation 3518. Up to 668 conditions per place. [2024-02-19 15:11:16,921 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 105 selfloop transitions, 22 changer transitions 3/135 dead transitions. [2024-02-19 15:11:16,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 135 transitions, 1089 flow [2024-02-19 15:11:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:11:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:11:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-02-19 15:11:16,925 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-02-19 15:11:16,926 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2024-02-19 15:11:16,926 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 135 transitions, 1089 flow [2024-02-19 15:11:16,926 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:16,926 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:16,927 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:11:16,927 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:11:16,927 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:16,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -972562222, now seen corresponding path program 3 times [2024-02-19 15:11:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400524405] [2024-02-19 15:11:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400524405] [2024-02-19 15:11:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400524405] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282252037] [2024-02-19 15:11:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:17,195 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:11:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:11:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:11:17,215 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:11:17,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 135 transitions, 1089 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:17,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:17,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:11:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:17,612 INFO L124 PetriNetUnfolderBase]: 1368/2101 cut-off events. [2024-02-19 15:11:17,612 INFO L125 PetriNetUnfolderBase]: For 2520/3112 co-relation queries the response was YES. [2024-02-19 15:11:17,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9541 conditions, 2101 events. 1368/2101 cut-off events. For 2520/3112 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 10909 event pairs, 91 based on Foata normal form. 57/2120 useless extension candidates. Maximal degree in co-relation 9038. Up to 1432 conditions per place. [2024-02-19 15:11:17,632 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 200 selfloop transitions, 49 changer transitions 3/256 dead transitions. [2024-02-19 15:11:17,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 256 transitions, 2549 flow [2024-02-19 15:11:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:11:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:11:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-02-19 15:11:17,635 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6415770609318996 [2024-02-19 15:11:17,636 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2024-02-19 15:11:17,637 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 256 transitions, 2549 flow [2024-02-19 15:11:17,637 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:17,637 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:17,637 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:11:17,637 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:11:17,638 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:17,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -606593834, now seen corresponding path program 4 times [2024-02-19 15:11:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:17,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928369] [2024-02-19 15:11:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:17,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:17,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928369] [2024-02-19 15:11:17,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928369] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603264417] [2024-02-19 15:11:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:17,798 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:11:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:17,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:11:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:11:17,818 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:11:17,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 256 transitions, 2549 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:17,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:17,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:11:17,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:18,163 INFO L124 PetriNetUnfolderBase]: 1601/2444 cut-off events. [2024-02-19 15:11:18,164 INFO L125 PetriNetUnfolderBase]: For 4574/5360 co-relation queries the response was YES. [2024-02-19 15:11:18,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13238 conditions, 2444 events. 1601/2444 cut-off events. For 4574/5360 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 13092 event pairs, 85 based on Foata normal form. 41/2445 useless extension candidates. Maximal degree in co-relation 12643. Up to 1675 conditions per place. [2024-02-19 15:11:18,187 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 245 selfloop transitions, 53 changer transitions 3/311 dead transitions. [2024-02-19 15:11:18,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 311 transitions, 3683 flow [2024-02-19 15:11:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:11:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:11:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-02-19 15:11:18,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5604838709677419 [2024-02-19 15:11:18,190 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2024-02-19 15:11:18,190 INFO L507 AbstractCegarLoop]: Abstraction has has 62 places, 311 transitions, 3683 flow [2024-02-19 15:11:18,190 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:18,191 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:18,191 INFO L234 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] [2024-02-19 15:11:18,191 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:11:18,191 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:18,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1029844522, now seen corresponding path program 1 times [2024-02-19 15:11:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059501977] [2024-02-19 15:11:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059501977] [2024-02-19 15:11:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059501977] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:11:18,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471255909] [2024-02-19 15:11:18,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:18,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:11:18,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:11:18,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:11:18,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:11:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:18,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-19 15:11:18,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:11:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:18,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:11:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471255909] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:11:19,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:11:19,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 18 [2024-02-19 15:11:19,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837495143] [2024-02-19 15:11:19,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:11:19,270 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-19 15:11:19,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:19,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-19 15:11:19,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-02-19 15:11:19,365 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:11:19,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 311 transitions, 3683 flow. Second operand has 19 states, 19 states have (on average 10.052631578947368) internal successors, (191), 19 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:19,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:19,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:11:19,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:21,099 INFO L124 PetriNetUnfolderBase]: 4019/6306 cut-off events. [2024-02-19 15:11:21,100 INFO L125 PetriNetUnfolderBase]: For 15144/17394 co-relation queries the response was YES. [2024-02-19 15:11:21,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40208 conditions, 6306 events. 4019/6306 cut-off events. For 15144/17394 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 40406 event pairs, 49 based on Foata normal form. 193/6462 useless extension candidates. Maximal degree in co-relation 38235. Up to 4866 conditions per place. [2024-02-19 15:11:21,218 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 782 selfloop transitions, 292 changer transitions 17/1095 dead transitions. [2024-02-19 15:11:21,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 1095 transitions, 15277 flow [2024-02-19 15:11:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-02-19 15:11:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-02-19 15:11:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 507 transitions. [2024-02-19 15:11:21,223 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6057347670250897 [2024-02-19 15:11:21,224 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2024-02-19 15:11:21,224 INFO L507 AbstractCegarLoop]: Abstraction has has 88 places, 1095 transitions, 15277 flow [2024-02-19 15:11:21,224 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.052631578947368) internal successors, (191), 19 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:21,224 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:21,224 INFO L234 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] [2024-02-19 15:11:21,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 15:11:21,431 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 15:11:21,432 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:21,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2038745999, now seen corresponding path program 1 times [2024-02-19 15:11:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:21,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530167104] [2024-02-19 15:11:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530167104] [2024-02-19 15:11:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530167104] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:21,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985642603] [2024-02-19 15:11:21,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:21,662 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:11:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:11:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:11:21,681 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:11:21,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 1095 transitions, 15277 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:21,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:21,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:11:21,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:24,118 INFO L124 PetriNetUnfolderBase]: 7813/12241 cut-off events. [2024-02-19 15:11:24,119 INFO L125 PetriNetUnfolderBase]: For 48281/48818 co-relation queries the response was YES. [2024-02-19 15:11:24,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82797 conditions, 12241 events. 7813/12241 cut-off events. For 48281/48818 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 79394 event pairs, 599 based on Foata normal form. 205/12337 useless extension candidates. Maximal degree in co-relation 78845. Up to 8678 conditions per place. [2024-02-19 15:11:24,301 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1256 selfloop transitions, 224 changer transitions 70/1630 dead transitions. [2024-02-19 15:11:24,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 1630 transitions, 26230 flow [2024-02-19 15:11:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:11:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:11:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-02-19 15:11:24,303 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6387096774193548 [2024-02-19 15:11:24,304 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2024-02-19 15:11:24,304 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 1630 transitions, 26230 flow [2024-02-19 15:11:24,305 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:24,305 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:24,305 INFO L234 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] [2024-02-19 15:11:24,305 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 15:11:24,305 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:24,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -219670889, now seen corresponding path program 2 times [2024-02-19 15:11:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811871264] [2024-02-19 15:11:24,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:24,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811871264] [2024-02-19 15:11:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811871264] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:24,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147344432] [2024-02-19 15:11:24,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:24,505 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:11:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:24,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:11:24,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:11:24,513 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:11:24,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1630 transitions, 26230 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:24,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:24,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:11:24,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:27,868 INFO L124 PetriNetUnfolderBase]: 10508/16274 cut-off events. [2024-02-19 15:11:27,868 INFO L125 PetriNetUnfolderBase]: For 104000/106556 co-relation queries the response was YES. [2024-02-19 15:11:27,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126297 conditions, 16274 events. 10508/16274 cut-off events. For 104000/106556 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 110727 event pairs, 40 based on Foata normal form. 398/16630 useless extension candidates. Maximal degree in co-relation 120843. Up to 11938 conditions per place. [2024-02-19 15:11:28,020 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 2711 selfloop transitions, 614 changer transitions 91/3496 dead transitions. [2024-02-19 15:11:28,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 3496 transitions, 63269 flow [2024-02-19 15:11:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:11:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:11:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-02-19 15:11:28,022 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5870967741935483 [2024-02-19 15:11:28,023 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 62 predicate places. [2024-02-19 15:11:28,023 INFO L507 AbstractCegarLoop]: Abstraction has has 96 places, 3496 transitions, 63269 flow [2024-02-19 15:11:28,023 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:28,023 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:28,023 INFO L234 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] [2024-02-19 15:11:28,024 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 15:11:28,024 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:28,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 46061672, now seen corresponding path program 2 times [2024-02-19 15:11:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817345217] [2024-02-19 15:11:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:28,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817345217] [2024-02-19 15:11:28,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817345217] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:11:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329470447] [2024-02-19 15:11:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:28,214 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:11:28,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:11:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:11:28,246 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:11:28,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 3496 transitions, 63269 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:28,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:28,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:11:28,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:34,731 INFO L124 PetriNetUnfolderBase]: 10585/16444 cut-off events. [2024-02-19 15:11:34,732 INFO L125 PetriNetUnfolderBase]: For 125174/127453 co-relation queries the response was YES. [2024-02-19 15:11:34,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140703 conditions, 16444 events. 10585/16444 cut-off events. For 125174/127453 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 112223 event pairs, 36 based on Foata normal form. 94/16506 useless extension candidates. Maximal degree in co-relation 134588. Up to 12620 conditions per place. [2024-02-19 15:11:34,886 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 3333 selfloop transitions, 66 changer transitions 93/3557 dead transitions. [2024-02-19 15:11:34,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 3557 transitions, 71396 flow [2024-02-19 15:11:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:11:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:11:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-02-19 15:11:34,888 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-02-19 15:11:34,888 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 66 predicate places. [2024-02-19 15:11:34,888 INFO L507 AbstractCegarLoop]: Abstraction has has 100 places, 3557 transitions, 71396 flow [2024-02-19 15:11:34,889 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:34,889 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:34,889 INFO L234 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] [2024-02-19 15:11:34,889 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 15:11:34,890 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:34,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:34,891 INFO L85 PathProgramCache]: Analyzing trace with hash -604381231, now seen corresponding path program 3 times [2024-02-19 15:11:34,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:34,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576170081] [2024-02-19 15:11:34,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:34,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:35,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576170081] [2024-02-19 15:11:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576170081] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:35,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:35,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 15:11:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282120723] [2024-02-19 15:11:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:35,088 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:11:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:35,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:11:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:11:35,107 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:11:35,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 3557 transitions, 71396 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:35,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:35,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:11:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:11:47,356 INFO L124 PetriNetUnfolderBase]: 16240/25269 cut-off events. [2024-02-19 15:11:47,357 INFO L125 PetriNetUnfolderBase]: For 210708/212271 co-relation queries the response was YES. [2024-02-19 15:11:47,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234665 conditions, 25269 events. 16240/25269 cut-off events. For 210708/212271 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 181623 event pairs, 288 based on Foata normal form. 521/25767 useless extension candidates. Maximal degree in co-relation 224629. Up to 19141 conditions per place. [2024-02-19 15:11:47,735 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 4754 selfloop transitions, 1103 changer transitions 139/6049 dead transitions. [2024-02-19 15:11:47,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 6049 transitions, 133118 flow [2024-02-19 15:11:47,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:11:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:11:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-02-19 15:11:47,737 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6589861751152074 [2024-02-19 15:11:47,737 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2024-02-19 15:11:47,737 INFO L507 AbstractCegarLoop]: Abstraction has has 106 places, 6049 transitions, 133118 flow [2024-02-19 15:11:47,738 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:47,738 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:11:47,738 INFO L234 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] [2024-02-19 15:11:47,738 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 15:11:47,738 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:11:47,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:11:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 129389799, now seen corresponding path program 4 times [2024-02-19 15:11:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:11:47,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881696738] [2024-02-19 15:11:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:11:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:11:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:11:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:11:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:11:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881696738] [2024-02-19 15:11:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881696738] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:11:47,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:11:47,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:11:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229478899] [2024-02-19 15:11:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:11:47,966 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:11:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:11:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:11:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:11:47,981 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:11:47,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 6049 transitions, 133118 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:11:47,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:11:47,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:11:47,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:07,120 INFO L124 PetriNetUnfolderBase]: 15598/24117 cut-off events. [2024-02-19 15:12:07,121 INFO L125 PetriNetUnfolderBase]: For 220085/221958 co-relation queries the response was YES. [2024-02-19 15:12:07,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244557 conditions, 24117 events. 15598/24117 cut-off events. For 220085/221958 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 170503 event pairs, 278 based on Foata normal form. 373/24477 useless extension candidates. Maximal degree in co-relation 234825. Up to 18398 conditions per place. [2024-02-19 15:12:07,320 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 4338 selfloop transitions, 1052 changer transitions 149/5678 dead transitions. [2024-02-19 15:12:07,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 5678 transitions, 135723 flow [2024-02-19 15:12:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:12:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:12:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-02-19 15:12:07,321 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2024-02-19 15:12:07,322 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2024-02-19 15:12:07,322 INFO L507 AbstractCegarLoop]: Abstraction has has 110 places, 5678 transitions, 135723 flow [2024-02-19 15:12:07,322 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:07,322 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:12:07,322 INFO L234 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] [2024-02-19 15:12:07,322 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 15:12:07,323 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:12:07,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:12:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1373734558, now seen corresponding path program 3 times [2024-02-19 15:12:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:12:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962905021] [2024-02-19 15:12:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:12:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:12:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:12:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:12:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962905021] [2024-02-19 15:12:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962905021] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:12:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:12:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:12:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984358819] [2024-02-19 15:12:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:12:07,449 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:12:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:12:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:12:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:12:07,475 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:12:07,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 5678 transitions, 135723 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:07,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:12:07,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:12:07,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:21,472 INFO L124 PetriNetUnfolderBase]: 14499/22271 cut-off events. [2024-02-19 15:12:21,473 INFO L125 PetriNetUnfolderBase]: For 239948/241265 co-relation queries the response was YES. [2024-02-19 15:12:21,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243439 conditions, 22271 events. 14499/22271 cut-off events. For 239948/241265 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 153766 event pairs, 226 based on Foata normal form. 168/22428 useless extension candidates. Maximal degree in co-relation 233725. Up to 16781 conditions per place. [2024-02-19 15:12:21,663 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 4870 selfloop transitions, 80 changer transitions 225/5251 dead transitions. [2024-02-19 15:12:21,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 5251 transitions, 135804 flow [2024-02-19 15:12:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:12:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:12:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-02-19 15:12:21,665 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2024-02-19 15:12:21,665 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2024-02-19 15:12:21,665 INFO L507 AbstractCegarLoop]: Abstraction has has 114 places, 5251 transitions, 135804 flow [2024-02-19 15:12:21,666 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:21,666 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:12:21,666 INFO L234 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] [2024-02-19 15:12:21,666 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 15:12:21,666 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:12:21,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:12:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 764271913, now seen corresponding path program 5 times [2024-02-19 15:12:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:12:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837471066] [2024-02-19 15:12:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:12:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:12:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:12:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:12:21,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837471066] [2024-02-19 15:12:21,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837471066] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:12:21,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:12:21,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 15:12:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461876358] [2024-02-19 15:12:21,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:12:21,827 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:12:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:12:21,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:12:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:12:21,842 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:12:21,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 5251 transitions, 135804 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-02-19 15:12:21,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:12:21,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:12:21,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:12:42,454 INFO L124 PetriNetUnfolderBase]: 18456/28046 cut-off events. [2024-02-19 15:12:42,455 INFO L125 PetriNetUnfolderBase]: For 343438/345271 co-relation queries the response was YES. [2024-02-19 15:12:42,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330923 conditions, 28046 events. 18456/28046 cut-off events. For 343438/345271 co-relation queries the response was YES. Maximal size of possible extension queue 1509. Compared 197231 event pairs, 360 based on Foata normal form. 551/28574 useless extension candidates. Maximal degree in co-relation 320538. Up to 21334 conditions per place. [2024-02-19 15:12:42,751 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 4615 selfloop transitions, 1288 changer transitions 262/6304 dead transitions. [2024-02-19 15:12:42,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 6304 transitions, 175196 flow [2024-02-19 15:12:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:12:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:12:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-02-19 15:12:42,752 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5604838709677419 [2024-02-19 15:12:42,753 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 87 predicate places. [2024-02-19 15:12:42,753 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 6304 transitions, 175196 flow [2024-02-19 15:12:42,753 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-02-19 15:12:42,753 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:12:42,753 INFO L234 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] [2024-02-19 15:12:42,754 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 15:12:42,754 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:12:42,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:12:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1703025113, now seen corresponding path program 6 times [2024-02-19 15:12:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:12:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257953007] [2024-02-19 15:12:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:12:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:12:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:12:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:12:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:12:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257953007] [2024-02-19 15:12:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257953007] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:12:42,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:12:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:12:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945136734] [2024-02-19 15:12:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:12:42,873 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:12:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:12:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:12:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:12:42,896 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:12:42,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 6304 transitions, 175196 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:12:42,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:12:42,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:12:42,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:07,705 INFO L124 PetriNetUnfolderBase]: 18223/27528 cut-off events. [2024-02-19 15:13:07,706 INFO L125 PetriNetUnfolderBase]: For 376064/377889 co-relation queries the response was YES. [2024-02-19 15:13:07,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346480 conditions, 27528 events. 18223/27528 cut-off events. For 376064/377889 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 190732 event pairs, 380 based on Foata normal form. 116/27623 useless extension candidates. Maximal degree in co-relation 335921. Up to 21042 conditions per place. [2024-02-19 15:13:07,981 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 5249 selfloop transitions, 74 changer transitions 247/6125 dead transitions. [2024-02-19 15:13:07,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 6125 transitions, 180843 flow [2024-02-19 15:13:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:13:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:13:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-02-19 15:13:07,982 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2024-02-19 15:13:07,983 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 91 predicate places. [2024-02-19 15:13:07,983 INFO L507 AbstractCegarLoop]: Abstraction has has 125 places, 6125 transitions, 180843 flow [2024-02-19 15:13:07,983 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:13:07,983 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:07,983 INFO L234 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] [2024-02-19 15:13:07,983 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-19 15:13:07,984 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:07,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -300503759, now seen corresponding path program 7 times [2024-02-19 15:13:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:13:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18396763] [2024-02-19 15:13:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:13:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:13:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:13:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:13:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:13:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18396763] [2024-02-19 15:13:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18396763] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:13:08,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:13:08,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:13:08,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820528806] [2024-02-19 15:13:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:13:08,145 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:13:08,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:13:08,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:13:08,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:13:08,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-02-19 15:13:08,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 6125 transitions, 180843 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:13:08,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:08,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-02-19 15:13:08,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:37,549 INFO L124 PetriNetUnfolderBase]: 18372/27941 cut-off events. [2024-02-19 15:13:37,549 INFO L125 PetriNetUnfolderBase]: For 424495/426958 co-relation queries the response was YES. [2024-02-19 15:13:37,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376366 conditions, 27941 events. 18372/27941 cut-off events. For 424495/426958 co-relation queries the response was YES. Maximal size of possible extension queue 1459. Compared 196179 event pairs, 382 based on Foata normal form. 435/28355 useless extension candidates. Maximal degree in co-relation 364105. Up to 21426 conditions per place. [2024-02-19 15:13:38,057 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 4575 selfloop transitions, 1300 changer transitions 275/6289 dead transitions. [2024-02-19 15:13:38,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 6289 transitions, 198260 flow [2024-02-19 15:13:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:13:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:13:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-19 15:13:38,059 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6258064516129033 [2024-02-19 15:13:38,059 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2024-02-19 15:13:38,059 INFO L507 AbstractCegarLoop]: Abstraction has has 129 places, 6289 transitions, 198260 flow [2024-02-19 15:13:38,060 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:13:38,060 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:38,060 INFO L234 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] [2024-02-19 15:13:38,060 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-19 15:13:38,061 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:38,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1177686845, now seen corresponding path program 8 times [2024-02-19 15:13:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:13:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217010788] [2024-02-19 15:13:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:13:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:13:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:13:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:13:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:13:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217010788] [2024-02-19 15:13:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217010788] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:13:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:13:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:13:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71726962] [2024-02-19 15:13:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:13:38,219 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:13:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:13:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:13:38,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:13:38,233 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:13:38,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 6289 transitions, 198260 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:13:38,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:38,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:13:38,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:14:05,735 INFO L124 PetriNetUnfolderBase]: 17752/26864 cut-off events. [2024-02-19 15:14:05,735 INFO L125 PetriNetUnfolderBase]: For 396600/398605 co-relation queries the response was YES. [2024-02-19 15:14:05,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386322 conditions, 26864 events. 17752/26864 cut-off events. For 396600/398605 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 186402 event pairs, 8 based on Foata normal form. 314/27173 useless extension candidates. Maximal degree in co-relation 374741. Up to 20742 conditions per place. [2024-02-19 15:14:06,040 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 4401 selfloop transitions, 1285 changer transitions 249/5988 dead transitions. [2024-02-19 15:14:06,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 5988 transitions, 198895 flow [2024-02-19 15:14:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:14:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:14:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-02-19 15:14:06,042 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2024-02-19 15:14:06,043 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 99 predicate places. [2024-02-19 15:14:06,043 INFO L507 AbstractCegarLoop]: Abstraction has has 133 places, 5988 transitions, 198895 flow [2024-02-19 15:14:06,043 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:06,043 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:06,043 INFO L234 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] [2024-02-19 15:14:06,043 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-19 15:14:06,044 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:14:06,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -38368611, now seen corresponding path program 9 times [2024-02-19 15:14:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:14:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793620762] [2024-02-19 15:14:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:14:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:14:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:14:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:14:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793620762] [2024-02-19 15:14:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793620762] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:14:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:14:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 15:14:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442787002] [2024-02-19 15:14:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:14:06,240 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:14:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:14:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:14:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:14:06,262 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 15:14:06,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 5988 transitions, 198895 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:06,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:14:06,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 15:14:06,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:14:37,207 INFO L124 PetriNetUnfolderBase]: 20312/30551 cut-off events. [2024-02-19 15:14:37,207 INFO L125 PetriNetUnfolderBase]: For 460448/463170 co-relation queries the response was YES. [2024-02-19 15:14:37,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468241 conditions, 30551 events. 20312/30551 cut-off events. For 460448/463170 co-relation queries the response was YES. Maximal size of possible extension queue 1576. Compared 213379 event pairs, 24 based on Foata normal form. 500/31036 useless extension candidates. Maximal degree in co-relation 456723. Up to 23747 conditions per place. [2024-02-19 15:14:37,741 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 4744 selfloop transitions, 1591 changer transitions 263/6650 dead transitions. [2024-02-19 15:14:37,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 6650 transitions, 233432 flow [2024-02-19 15:14:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:14:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:14:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-02-19 15:14:37,742 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5990783410138248 [2024-02-19 15:14:37,742 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2024-02-19 15:14:37,743 INFO L507 AbstractCegarLoop]: Abstraction has has 139 places, 6650 transitions, 233432 flow [2024-02-19 15:14:37,743 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:37,743 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:37,743 INFO L234 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] [2024-02-19 15:14:37,743 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-19 15:14:37,743 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:14:37,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:37,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1892538125, now seen corresponding path program 10 times [2024-02-19 15:14:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:14:37,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745127288] [2024-02-19 15:14:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:14:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:14:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:14:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:14:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:14:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745127288] [2024-02-19 15:14:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745127288] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:14:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:14:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:14:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764570960] [2024-02-19 15:14:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:14:37,886 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:14:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:14:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:14:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:14:37,900 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:14:37,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 6650 transitions, 233432 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:14:37,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:14:37,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:14:37,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:18,140 INFO L124 PetriNetUnfolderBase]: 20300/30531 cut-off events. [2024-02-19 15:15:18,140 INFO L125 PetriNetUnfolderBase]: For 493067/495479 co-relation queries the response was YES. [2024-02-19 15:15:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491121 conditions, 30531 events. 20300/30531 cut-off events. For 493067/495479 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 213167 event pairs, 16 based on Foata normal form. 98/30624 useless extension candidates. Maximal degree in co-relation 479021. Up to 23739 conditions per place. [2024-02-19 15:15:18,566 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 5539 selfloop transitions, 74 changer transitions 255/6641 dead transitions. [2024-02-19 15:15:18,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 6641 transitions, 244838 flow [2024-02-19 15:15:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:15:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:15:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-02-19 15:15:18,567 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2024-02-19 15:15:18,568 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 109 predicate places. [2024-02-19 15:15:18,568 INFO L507 AbstractCegarLoop]: Abstraction has has 143 places, 6641 transitions, 244838 flow [2024-02-19 15:15:18,568 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:18,568 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:18,569 INFO L234 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] [2024-02-19 15:15:18,569 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-19 15:15:18,569 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:18,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1785702899, now seen corresponding path program 11 times [2024-02-19 15:15:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165046378] [2024-02-19 15:15:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:15:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165046378] [2024-02-19 15:15:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165046378] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:15:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406699877] [2024-02-19 15:15:18,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:18,873 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:15:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:15:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:15:18,898 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-02-19 15:15:18,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 6641 transitions, 244838 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:18,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:18,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-02-19 15:15:18,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:16:06,392 INFO L124 PetriNetUnfolderBase]: 20902/31596 cut-off events. [2024-02-19 15:16:06,392 INFO L125 PetriNetUnfolderBase]: For 554156/557097 co-relation queries the response was YES. [2024-02-19 15:16:06,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531569 conditions, 31596 events. 20902/31596 cut-off events. For 554156/557097 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 223663 event pairs, 20 based on Foata normal form. 71/31662 useless extension candidates. Maximal degree in co-relation 517255. Up to 24660 conditions per place. [2024-02-19 15:16:06,889 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 6010 selfloop transitions, 96 changer transitions 283/7160 dead transitions. [2024-02-19 15:16:06,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 7160 transitions, 277706 flow [2024-02-19 15:16:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:16:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:16:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-02-19 15:16:06,891 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6505376344086021 [2024-02-19 15:16:06,891 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 114 predicate places. [2024-02-19 15:16:06,891 INFO L507 AbstractCegarLoop]: Abstraction has has 148 places, 7160 transitions, 277706 flow [2024-02-19 15:16:06,892 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:16:06,892 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:16:06,892 INFO L234 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-02-19 15:16:06,892 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-19 15:16:06,892 INFO L432 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:16:06,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:16:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1115533970, now seen corresponding path program 1 times [2024-02-19 15:16:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:16:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770985957] [2024-02-19 15:16:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:16:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:16:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:16:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770985957] [2024-02-19 15:16:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770985957] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:16:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159252251] [2024-02-19 15:16:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:16:07,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:16:07,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:16:07,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 15:16:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:07,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-19 15:16:07,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:16:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:16:07,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:16:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:16:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159252251] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:16:07,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:16:07,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-02-19 15:16:07,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260490799] [2024-02-19 15:16:07,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:16:07,840 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 15:16:07,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:16:07,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 15:16:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:16:07,884 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-02-19 15:16:07,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 7160 transitions, 277706 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:16:07,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:16:07,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-02-19 15:16:07,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:17:21,465 INFO L124 PetriNetUnfolderBase]: 26737/41743 cut-off events. [2024-02-19 15:17:21,465 INFO L125 PetriNetUnfolderBase]: For 854229/857663 co-relation queries the response was YES. [2024-02-19 15:17:21,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735403 conditions, 41743 events. 26737/41743 cut-off events. For 854229/857663 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 322596 event pairs, 42 based on Foata normal form. 43/41759 useless extension candidates. Maximal degree in co-relation 713723. Up to 33036 conditions per place. [2024-02-19 15:17:22,266 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 6667 selfloop transitions, 1948 changer transitions 355/9732 dead transitions. [2024-02-19 15:17:22,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 9732 transitions, 399122 flow [2024-02-19 15:17:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:17:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:17:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2024-02-19 15:17:22,267 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6891495601173021 [2024-02-19 15:17:22,268 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 124 predicate places. [2024-02-19 15:17:22,268 INFO L507 AbstractCegarLoop]: Abstraction has has 158 places, 9732 transitions, 399122 flow [2024-02-19 15:17:22,268 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:17:22,268 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:17:22,269 INFO L234 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-02-19 15:17:22,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-19 15:17:22,476 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-02-19 15:17:22,476 INFO L432 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:17:22,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:17:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1917500712, now seen corresponding path program 2 times [2024-02-19 15:17:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:17:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434883784] [2024-02-19 15:17:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:17:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:17:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:17:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:17:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:17:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434883784] [2024-02-19 15:17:22,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434883784] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:17:22,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748798560] [2024-02-19 15:17:22,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:17:22,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:17:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:17:22,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:17:22,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 15:17:22,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:17:22,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:17:22,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-19 15:17:22,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:17:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:17:22,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:17:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:17:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748798560] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:17:23,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:17:23,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-02-19 15:17:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134841445] [2024-02-19 15:17:23,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:17:23,329 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 15:17:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:17:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 15:17:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-02-19 15:17:23,375 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:17:23,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 9732 transitions, 399122 flow. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:17:23,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:17:23,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:17:23,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:19:12,608 INFO L124 PetriNetUnfolderBase]: 26823/41804 cut-off events. [2024-02-19 15:19:12,608 INFO L125 PetriNetUnfolderBase]: For 977497/982746 co-relation queries the response was YES. [2024-02-19 15:19:12,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773241 conditions, 41804 events. 26823/41804 cut-off events. For 977497/982746 co-relation queries the response was YES. Maximal size of possible extension queue 2116. Compared 322666 event pairs, 36 based on Foata normal form. 95/41882 useless extension candidates. Maximal degree in co-relation 750700. Up to 33136 conditions per place. [2024-02-19 15:19:13,253 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 7902 selfloop transitions, 1511 changer transitions 427/9883 dead transitions. [2024-02-19 15:19:13,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 9883 transitions, 422740 flow [2024-02-19 15:19:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 15:19:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 15:19:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-02-19 15:19:13,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6225806451612903 [2024-02-19 15:19:13,254 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 133 predicate places. [2024-02-19 15:19:13,255 INFO L507 AbstractCegarLoop]: Abstraction has has 167 places, 9883 transitions, 422740 flow [2024-02-19 15:19:13,255 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:19:13,255 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:19:13,255 INFO L234 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-02-19 15:19:13,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:19:13,468 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:19:13,468 INFO L432 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:19:13,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:19:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -264701744, now seen corresponding path program 3 times [2024-02-19 15:19:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:19:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836619552] [2024-02-19 15:19:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:19:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:19:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:19:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:19:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:19:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836619552] [2024-02-19 15:19:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836619552] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:19:13,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120427611] [2024-02-19 15:19:13,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:19:13,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:19:13,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:19:13,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:19:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 15:19:13,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:19:13,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:19:13,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:19:13,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:19:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:19:13,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:19:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:19:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120427611] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:19:14,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:19:14,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-02-19 15:19:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678949739] [2024-02-19 15:19:14,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:19:14,528 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:19:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:19:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:19:14,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:19:14,583 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-02-19 15:19:14,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 9883 transitions, 422740 flow. Second operand has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:19:14,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:19:14,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-02-19 15:19:14,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:06,447 INFO L124 PetriNetUnfolderBase]: 40754/63895 cut-off events. [2024-02-19 15:22:06,447 INFO L125 PetriNetUnfolderBase]: For 1581812/1585121 co-relation queries the response was YES. [2024-02-19 15:22:06,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232825 conditions, 63895 events. 40754/63895 cut-off events. For 1581812/1585121 co-relation queries the response was YES. Maximal size of possible extension queue 3696. Compared 528819 event pairs, 68 based on Foata normal form. 206/64084 useless extension candidates. Maximal degree in co-relation 1196066. Up to 50651 conditions per place. [2024-02-19 15:22:07,563 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 12039 selfloop transitions, 3228 changer transitions 778/16088 dead transitions. [2024-02-19 15:22:07,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 16088 transitions, 717592 flow [2024-02-19 15:22:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 15:22:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 15:22:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 346 transitions. [2024-02-19 15:22:07,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6200716845878136 [2024-02-19 15:22:07,566 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 150 predicate places. [2024-02-19 15:22:07,566 INFO L507 AbstractCegarLoop]: Abstraction has has 184 places, 16088 transitions, 717592 flow [2024-02-19 15:22:07,566 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:07,566 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:07,566 INFO L234 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-02-19 15:22:07,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:07,781 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:22:07,782 INFO L432 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:07,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:07,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1335349937, now seen corresponding path program 1 times [2024-02-19 15:22:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:22:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135563256] [2024-02-19 15:22:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:22:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:22:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:22:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135563256] [2024-02-19 15:22:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135563256] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:22:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943145579] [2024-02-19 15:22:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:07,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:22:07,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:22:07,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:22:07,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 15:22:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:08,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-19 15:22:08,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:22:08,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:22:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:22:08,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943145579] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:22:08,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:22:08,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2024-02-19 15:22:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611012542] [2024-02-19 15:22:08,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:22:08,395 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:22:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:22:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:22:08,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:22:08,593 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-02-19 15:22:08,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 16088 transitions, 717592 flow. Second operand has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:08,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:08,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-02-19 15:22:08,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:15,424 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 [] Killed by 15