./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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-more-buffer-series2.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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:54:48,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:54:48,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:54:48,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:54:48,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:54:48,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:54:48,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:54:48,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:54:48,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:54:48,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:54:48,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:54:48,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:54:48,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:54:48,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:54:48,476 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:54:48,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:54:48,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:54:48,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:54:48,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:54:48,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:54:48,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:54:48,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:54:48,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:54:48,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:54:48,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:54:48,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:54:48,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:54:48,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:54:48,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:54:48,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:54:48,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:54:48,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:54:48,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:54:48,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:54:48,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:54:48,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:54:48,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:54:48,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:54:48,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:54:48,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:54:48,483 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:54:48,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:54:48,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:54:48,484 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2024-06-27 16:54:48,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:54:48,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:54:48,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:54:48,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:54:48,715 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:54:48,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-27 16:54:49,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:54:49,872 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:54:49,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-27 16:54:49,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9067bc6e/90156436a700403c8f432484bf4139f4/FLAGa2bc8cd7a [2024-06-27 16:54:49,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9067bc6e/90156436a700403c8f432484bf4139f4 [2024-06-27 16:54:49,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:54:49,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:54:49,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:54:49,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:54:49,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:54:49,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:54:49" (1/1) ... [2024-06-27 16:54:49,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a47f82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:49, skipping insertion in model container [2024-06-27 16:54:49,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:54:49" (1/1) ... [2024-06-27 16:54:49,937 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:54:50,064 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 16:54:50,075 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:54:50,090 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:54:50,130 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 16:54:50,139 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:54:50,162 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:54:50,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50 WrapperNode [2024-06-27 16:54:50,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:54:50,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:54:50,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:54:50,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:54:50,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,209 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 336 [2024-06-27 16:54:50,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:54:50,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:54:50,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:54:50,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:54:50,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,244 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 16:54:50,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:54:50,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:54:50,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:54:50,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:54:50,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (1/1) ... [2024-06-27 16:54:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:54:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:54:50,305 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-06-27 16:54:50,316 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-06-27 16:54:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:54:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:54:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:54:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:54:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:54:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:54:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:54:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:54:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 16:54:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 16:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:54:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:54:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:54:50,357 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:54:50,514 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:54:50,534 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:54:50,916 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:54:50,916 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:54:51,172 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:54:51,172 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-06-27 16:54:51,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:54:51 BoogieIcfgContainer [2024-06-27 16:54:51,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:54:51,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:54:51,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:54:51,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:54:51,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:54:49" (1/3) ... [2024-06-27 16:54:51,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21589681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:54:51, skipping insertion in model container [2024-06-27 16:54:51,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:54:50" (2/3) ... [2024-06-27 16:54:51,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21589681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:54:51, skipping insertion in model container [2024-06-27 16:54:51,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:54:51" (3/3) ... [2024-06-27 16:54:51,181 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-06-27 16:54:51,187 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:54:51,194 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:54:51,194 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:54:51,194 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:54:51,255 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 16:54:51,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 128 flow [2024-06-27 16:54:51,315 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-06-27 16:54:51,316 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:54:51,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 7/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 16:54:51,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 128 flow [2024-06-27 16:54:51,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 114 flow [2024-06-27 16:54:51,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:54:51,338 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d80688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:54:51,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:54:51,356 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:54:51,356 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-06-27 16:54:51,357 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:54:51,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:51,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:51,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:51,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2021043820, now seen corresponding path program 1 times [2024-06-27 16:54:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708061451] [2024-06-27 16:54:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:54:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708061451] [2024-06-27 16:54:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708061451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:51,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:51,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:54:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899127018] [2024-06-27 16:54:51,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:51,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:51,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:51,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 16:54:51,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06-27 16:54:51,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:51,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 16:54:51,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:52,036 INFO L124 PetriNetUnfolderBase]: 1030/1754 cut-off events. [2024-06-27 16:54:52,036 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-06-27 16:54:52,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 1754 events. 1030/1754 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10426 event pairs, 252 based on Foata normal form. 1/1665 useless extension candidates. Maximal degree in co-relation 2793. Up to 989 conditions per place. [2024-06-27 16:54:52,049 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 39 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2024-06-27 16:54:52,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 245 flow [2024-06-27 16:54:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-27 16:54:52,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-06-27 16:54:52,060 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 114 flow. Second operand 3 states and 107 transitions. [2024-06-27 16:54:52,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 245 flow [2024-06-27 16:54:52,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 219 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 16:54:52,070 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 117 flow [2024-06-27 16:54:52,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-06-27 16:54:52,075 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-06-27 16:54:52,075 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 117 flow [2024-06-27 16:54:52,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06-27 16:54:52,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:52,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:52,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:54:52,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:52,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1903436439, now seen corresponding path program 1 times [2024-06-27 16:54:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58113703] [2024-06-27 16:54:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:54:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:52,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58113703] [2024-06-27 16:54:52,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58113703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:52,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:54:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878376759] [2024-06-27 16:54:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:52,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:52,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:52,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:52,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 16:54:52,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06-27 16:54:52,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:52,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 16:54:52,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:52,414 INFO L124 PetriNetUnfolderBase]: 1204/1956 cut-off events. [2024-06-27 16:54:52,414 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2024-06-27 16:54:52,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4088 conditions, 1956 events. 1204/1956 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11296 event pairs, 362 based on Foata normal form. 64/1928 useless extension candidates. Maximal degree in co-relation 1456. Up to 1131 conditions per place. [2024-06-27 16:54:52,425 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-06-27 16:54:52,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 271 flow [2024-06-27 16:54:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-06-27 16:54:52,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.74 [2024-06-27 16:54:52,427 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 117 flow. Second operand 3 states and 111 transitions. [2024-06-27 16:54:52,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 271 flow [2024-06-27 16:54:52,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:52,428 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 128 flow [2024-06-27 16:54:52,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-06-27 16:54:52,429 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-06-27 16:54:52,429 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 128 flow [2024-06-27 16:54:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06-27 16:54:52,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:52,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:52,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:54:52,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:52,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash 764626461, now seen corresponding path program 1 times [2024-06-27 16:54:52,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:52,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494365294] [2024-06-27 16:54:52,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:52,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:54:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494365294] [2024-06-27 16:54:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494365294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:52,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:52,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:54:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708533806] [2024-06-27 16:54:52,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:52,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:54:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:54:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:54:52,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 16:54:52,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06-27 16:54:52,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:52,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 16:54:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:52,747 INFO L124 PetriNetUnfolderBase]: 1425/2334 cut-off events. [2024-06-27 16:54:52,747 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2024-06-27 16:54:52,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2334 events. 1425/2334 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13350 event pairs, 399 based on Foata normal form. 33/2273 useless extension candidates. Maximal degree in co-relation 3352. Up to 1290 conditions per place. [2024-06-27 16:54:52,759 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-06-27 16:54:52,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 287 flow [2024-06-27 16:54:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:54:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:54:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-06-27 16:54:52,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7266666666666667 [2024-06-27 16:54:52,761 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 128 flow. Second operand 3 states and 109 transitions. [2024-06-27 16:54:52,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 287 flow [2024-06-27 16:54:52,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:52,763 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 140 flow [2024-06-27 16:54:52,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-27 16:54:52,763 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-06-27 16:54:52,764 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 140 flow [2024-06-27 16:54:52,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06-27 16:54:52,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:52,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:54:52,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:52,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -673420964, now seen corresponding path program 1 times [2024-06-27 16:54:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107819095] [2024-06-27 16:54:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:54:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:52,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107819095] [2024-06-27 16:54:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107819095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:52,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:52,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:54:52,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128305565] [2024-06-27 16:54:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:54:52,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:54:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:54:52,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 16:54:52,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 16:54:52,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:52,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 16:54:52,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:53,151 INFO L124 PetriNetUnfolderBase]: 1783/2862 cut-off events. [2024-06-27 16:54:53,151 INFO L125 PetriNetUnfolderBase]: For 1450/1450 co-relation queries the response was YES. [2024-06-27 16:54:53,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6695 conditions, 2862 events. 1783/2862 cut-off events. For 1450/1450 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17778 event pairs, 1276 based on Foata normal form. 72/2653 useless extension candidates. Maximal degree in co-relation 3442. Up to 1897 conditions per place. [2024-06-27 16:54:53,168 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 56 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2024-06-27 16:54:53,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 351 flow [2024-06-27 16:54:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:54:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:54:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-06-27 16:54:53,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.652 [2024-06-27 16:54:53,172 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 140 flow. Second operand 5 states and 163 transitions. [2024-06-27 16:54:53,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 351 flow [2024-06-27 16:54:53,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:53,175 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 190 flow [2024-06-27 16:54:53,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-06-27 16:54:53,176 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-06-27 16:54:53,176 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 190 flow [2024-06-27 16:54:53,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 16:54:53,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:53,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:53,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:54:53,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:53,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1409691762, now seen corresponding path program 1 times [2024-06-27 16:54:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772058703] [2024-06-27 16:54:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:54:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772058703] [2024-06-27 16:54:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772058703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:54:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478431633] [2024-06-27 16:54:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:53,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:54:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:54:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:54:53,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 16:54:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 16:54:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 16:54:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:53,641 INFO L124 PetriNetUnfolderBase]: 2317/3858 cut-off events. [2024-06-27 16:54:53,642 INFO L125 PetriNetUnfolderBase]: For 1970/1970 co-relation queries the response was YES. [2024-06-27 16:54:53,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 3858 events. 2317/3858 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26147 event pairs, 1724 based on Foata normal form. 106/3605 useless extension candidates. Maximal degree in co-relation 6840. Up to 2491 conditions per place. [2024-06-27 16:54:53,664 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 58 selfloop transitions, 5 changer transitions 2/82 dead transitions. [2024-06-27 16:54:53,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 414 flow [2024-06-27 16:54:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:54:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:54:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-06-27 16:54:53,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-27 16:54:53,666 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 190 flow. Second operand 4 states and 136 transitions. [2024-06-27 16:54:53,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 414 flow [2024-06-27 16:54:53,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 410 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:53,671 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 216 flow [2024-06-27 16:54:53,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-27 16:54:53,675 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2024-06-27 16:54:53,675 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 216 flow [2024-06-27 16:54:53,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 16:54:53,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:53,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:53,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:54:53,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:53,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 354292929, now seen corresponding path program 1 times [2024-06-27 16:54:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:53,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821194195] [2024-06-27 16:54:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:54:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821194195] [2024-06-27 16:54:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821194195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:54:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251150696] [2024-06-27 16:54:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:53,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:54:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:54:53,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:54:53,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-06-27 16:54:53,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-06-27 16:54:53,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:53,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-06-27 16:54:53,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:54,703 INFO L124 PetriNetUnfolderBase]: 6369/9864 cut-off events. [2024-06-27 16:54:54,704 INFO L125 PetriNetUnfolderBase]: For 4584/4712 co-relation queries the response was YES. [2024-06-27 16:54:54,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22780 conditions, 9864 events. 6369/9864 cut-off events. For 4584/4712 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 69801 event pairs, 2485 based on Foata normal form. 16/8921 useless extension candidates. Maximal degree in co-relation 18038. Up to 3399 conditions per place. [2024-06-27 16:54:54,814 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 89 selfloop transitions, 9 changer transitions 1/113 dead transitions. [2024-06-27 16:54:54,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 113 transitions, 593 flow [2024-06-27 16:54:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:54:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:54:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-06-27 16:54:54,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6366666666666667 [2024-06-27 16:54:54,815 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 216 flow. Second operand 6 states and 191 transitions. [2024-06-27 16:54:54,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 113 transitions, 593 flow [2024-06-27 16:54:54,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 583 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:54:54,818 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 245 flow [2024-06-27 16:54:54,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2024-06-27 16:54:54,818 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2024-06-27 16:54:54,818 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 245 flow [2024-06-27 16:54:54,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-06-27 16:54:54,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:54,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:54:54,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:54,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1470062564, now seen corresponding path program 1 times [2024-06-27 16:54:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258099602] [2024-06-27 16:54:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:54:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258099602] [2024-06-27 16:54:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258099602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:55,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:55,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:54:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6443528] [2024-06-27 16:54:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:55,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:54:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:54:55,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:54:55,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-06-27 16:54:55,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-06-27 16:54:55,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:55,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-06-27 16:54:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:55,766 INFO L124 PetriNetUnfolderBase]: 4709/7536 cut-off events. [2024-06-27 16:54:55,766 INFO L125 PetriNetUnfolderBase]: For 3991/4129 co-relation queries the response was YES. [2024-06-27 16:54:55,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 7536 events. 4709/7536 cut-off events. For 3991/4129 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 52438 event pairs, 2035 based on Foata normal form. 6/6666 useless extension candidates. Maximal degree in co-relation 13639. Up to 3217 conditions per place. [2024-06-27 16:54:55,801 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 57 selfloop transitions, 7 changer transitions 29/107 dead transitions. [2024-06-27 16:54:55,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 561 flow [2024-06-27 16:54:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:54:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:54:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-06-27 16:54:55,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.63 [2024-06-27 16:54:55,803 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 245 flow. Second operand 6 states and 189 transitions. [2024-06-27 16:54:55,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 561 flow [2024-06-27 16:54:55,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 551 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 16:54:55,806 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 241 flow [2024-06-27 16:54:55,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2024-06-27 16:54:55,807 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2024-06-27 16:54:55,807 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 241 flow [2024-06-27 16:54:55,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-06-27 16:54:55,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:55,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:55,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:54:55,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:55,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1298718439, now seen corresponding path program 1 times [2024-06-27 16:54:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379775115] [2024-06-27 16:54:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:54:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379775115] [2024-06-27 16:54:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379775115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:54:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22075436] [2024-06-27 16:54:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:56,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:54:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:56,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:54:56,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:54:56,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 16:54:56,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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-06-27 16:54:56,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:56,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 16:54:56,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:56,517 INFO L124 PetriNetUnfolderBase]: 2851/4744 cut-off events. [2024-06-27 16:54:56,518 INFO L125 PetriNetUnfolderBase]: For 3236/3236 co-relation queries the response was YES. [2024-06-27 16:54:56,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11628 conditions, 4744 events. 2851/4744 cut-off events. For 3236/3236 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 31184 event pairs, 449 based on Foata normal form. 248/4887 useless extension candidates. Maximal degree in co-relation 9057. Up to 2431 conditions per place. [2024-06-27 16:54:56,541 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 60 selfloop transitions, 7 changer transitions 1/83 dead transitions. [2024-06-27 16:54:56,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 467 flow [2024-06-27 16:54:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:54:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:54:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-06-27 16:54:56,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633333333333334 [2024-06-27 16:54:56,545 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 241 flow. Second operand 6 states and 169 transitions. [2024-06-27 16:54:56,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 467 flow [2024-06-27 16:54:56,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 446 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 16:54:56,559 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 232 flow [2024-06-27 16:54:56,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-06-27 16:54:56,560 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2024-06-27 16:54:56,560 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 232 flow [2024-06-27 16:54:56,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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-06-27 16:54:56,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:56,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:56,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:54:56,561 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:56,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2091064566, now seen corresponding path program 1 times [2024-06-27 16:54:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:56,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741700890] [2024-06-27 16:54:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:54:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741700890] [2024-06-27 16:54:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741700890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:56,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:54:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405132414] [2024-06-27 16:54:56,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:56,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:54:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:56,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:54:56,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:54:56,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 16:54:56,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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-06-27 16:54:56,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:56,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 16:54:56,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:57,016 INFO L124 PetriNetUnfolderBase]: 1675/2662 cut-off events. [2024-06-27 16:54:57,016 INFO L125 PetriNetUnfolderBase]: For 2466/2600 co-relation queries the response was YES. [2024-06-27 16:54:57,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 2662 events. 1675/2662 cut-off events. For 2466/2600 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15036 event pairs, 241 based on Foata normal form. 254/2843 useless extension candidates. Maximal degree in co-relation 5736. Up to 1489 conditions per place. [2024-06-27 16:54:57,027 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 60 selfloop transitions, 5 changer transitions 4/84 dead transitions. [2024-06-27 16:54:57,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 470 flow [2024-06-27 16:54:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:54:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:54:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-06-27 16:54:57,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.57 [2024-06-27 16:54:57,031 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 232 flow. Second operand 6 states and 171 transitions. [2024-06-27 16:54:57,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 470 flow [2024-06-27 16:54:57,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 442 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 16:54:57,034 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 196 flow [2024-06-27 16:54:57,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-06-27 16:54:57,036 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-06-27 16:54:57,036 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 196 flow [2024-06-27 16:54:57,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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-06-27 16:54:57,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:57,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:57,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:54:57,037 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:57,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1454480985, now seen corresponding path program 1 times [2024-06-27 16:54:57,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:57,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424327534] [2024-06-27 16:54:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:57,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:54:57,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:57,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424327534] [2024-06-27 16:54:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424327534] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:54:57,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071955507] [2024-06-27 16:54:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:54:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:54:57,233 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-06-27 16:54:57,264 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-06-27 16:54:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:57,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:54:57,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:54:57,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:54:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071955507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:54:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-06-27 16:54:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614832845] [2024-06-27 16:54:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:57,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:54:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:57,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:54:57,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:54:57,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 16:54:57,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-06-27 16:54:57,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:57,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 16:54:57,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:57,760 INFO L124 PetriNetUnfolderBase]: 2193/3358 cut-off events. [2024-06-27 16:54:57,761 INFO L125 PetriNetUnfolderBase]: For 3279/3502 co-relation queries the response was YES. [2024-06-27 16:54:57,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8991 conditions, 3358 events. 2193/3358 cut-off events. For 3279/3502 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18601 event pairs, 311 based on Foata normal form. 296/3626 useless extension candidates. Maximal degree in co-relation 8963. Up to 1219 conditions per place. [2024-06-27 16:54:57,782 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 75 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2024-06-27 16:54:57,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 557 flow [2024-06-27 16:54:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:54:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:54:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-27 16:54:57,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2024-06-27 16:54:57,783 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 196 flow. Second operand 6 states and 188 transitions. [2024-06-27 16:54:57,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 557 flow [2024-06-27 16:54:57,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 525 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 16:54:57,787 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 265 flow [2024-06-27 16:54:57,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2024-06-27 16:54:57,789 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2024-06-27 16:54:57,789 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 265 flow [2024-06-27 16:54:57,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-06-27 16:54:57,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:57,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:57,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:54:58,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 16:54:58,005 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:58,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:58,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1440231369, now seen corresponding path program 2 times [2024-06-27 16:54:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057178276] [2024-06-27 16:54:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:54:58,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057178276] [2024-06-27 16:54:58,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057178276] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:54:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24709076] [2024-06-27 16:54:58,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:54:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:54:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:54:58,206 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-06-27 16:54:58,228 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-06-27 16:54:58,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:54:58,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:54:58,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 16:54:58,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:54:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:54:58,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:54:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:54:58,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24709076] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 16:54:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:54:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 15 [2024-06-27 16:54:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966090131] [2024-06-27 16:54:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:58,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 16:54:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 16:54:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-06-27 16:54:58,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 16:54:58,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 265 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 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-06-27 16:54:58,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:58,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 16:54:58,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:54:59,438 INFO L124 PetriNetUnfolderBase]: 5613/8122 cut-off events. [2024-06-27 16:54:59,439 INFO L125 PetriNetUnfolderBase]: For 11868/12654 co-relation queries the response was YES. [2024-06-27 16:54:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24724 conditions, 8122 events. 5613/8122 cut-off events. For 11868/12654 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 45829 event pairs, 359 based on Foata normal form. 768/8493 useless extension candidates. Maximal degree in co-relation 24694. Up to 3182 conditions per place. [2024-06-27 16:54:59,494 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 106 selfloop transitions, 25 changer transitions 0/142 dead transitions. [2024-06-27 16:54:59,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 142 transitions, 878 flow [2024-06-27 16:54:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:54:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:54:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-06-27 16:54:59,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311111111111111 [2024-06-27 16:54:59,496 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 265 flow. Second operand 9 states and 239 transitions. [2024-06-27 16:54:59,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 142 transitions, 878 flow [2024-06-27 16:54:59,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 142 transitions, 863 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 16:54:59,504 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 470 flow [2024-06-27 16:54:59,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2024-06-27 16:54:59,504 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2024-06-27 16:54:59,504 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 470 flow [2024-06-27 16:54:59,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 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-06-27 16:54:59,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:54:59,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:54:59,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 16:54:59,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 16:54:59,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:54:59,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:54:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1658893055, now seen corresponding path program 1 times [2024-06-27 16:54:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:54:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401110459] [2024-06-27 16:54:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:54:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:54:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:54:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:54:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:54:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401110459] [2024-06-27 16:54:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401110459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:54:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:54:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:54:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382874584] [2024-06-27 16:54:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:54:59,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:54:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:54:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:54:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:54:59,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 16:54:59,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-06-27 16:54:59,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:54:59,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 16:54:59,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:00,883 INFO L124 PetriNetUnfolderBase]: 6848/10499 cut-off events. [2024-06-27 16:55:00,883 INFO L125 PetriNetUnfolderBase]: For 42472/44225 co-relation queries the response was YES. [2024-06-27 16:55:00,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40619 conditions, 10499 events. 6848/10499 cut-off events. For 42472/44225 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 67518 event pairs, 1038 based on Foata normal form. 1360/11459 useless extension candidates. Maximal degree in co-relation 40584. Up to 3697 conditions per place. [2024-06-27 16:55:00,969 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 118 selfloop transitions, 15 changer transitions 0/156 dead transitions. [2024-06-27 16:55:00,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 156 transitions, 1284 flow [2024-06-27 16:55:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:55:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:55:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-06-27 16:55:00,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-06-27 16:55:00,970 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 470 flow. Second operand 6 states and 192 transitions. [2024-06-27 16:55:00,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 156 transitions, 1284 flow [2024-06-27 16:55:01,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 156 transitions, 1266 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:01,008 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 595 flow [2024-06-27 16:55:01,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=595, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2024-06-27 16:55:01,008 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2024-06-27 16:55:01,008 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 595 flow [2024-06-27 16:55:01,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-06-27 16:55:01,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:01,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:55:01,009 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:55:01,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -769526555, now seen corresponding path program 2 times [2024-06-27 16:55:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651329983] [2024-06-27 16:55:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:55:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651329983] [2024-06-27 16:55:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651329983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 16:55:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711140171] [2024-06-27 16:55:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:01,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:55:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:55:01,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:55:01,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 16:55:01,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 595 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-06-27 16:55:01,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:01,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 16:55:01,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:02,305 INFO L124 PetriNetUnfolderBase]: 7222/11158 cut-off events. [2024-06-27 16:55:02,305 INFO L125 PetriNetUnfolderBase]: For 56720/58227 co-relation queries the response was YES. [2024-06-27 16:55:02,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47595 conditions, 11158 events. 7222/11158 cut-off events. For 56720/58227 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 72018 event pairs, 1480 based on Foata normal form. 1243/12063 useless extension candidates. Maximal degree in co-relation 47555. Up to 7424 conditions per place. [2024-06-27 16:55:02,389 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 112 selfloop transitions, 8 changer transitions 0/143 dead transitions. [2024-06-27 16:55:02,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 143 transitions, 1266 flow [2024-06-27 16:55:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:55:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:55:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-06-27 16:55:02,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-27 16:55:02,390 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 595 flow. Second operand 7 states and 200 transitions. [2024-06-27 16:55:02,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 143 transitions, 1266 flow [2024-06-27 16:55:02,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 143 transitions, 1255 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:02,426 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 620 flow [2024-06-27 16:55:02,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=620, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-06-27 16:55:02,427 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2024-06-27 16:55:02,427 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 620 flow [2024-06-27 16:55:02,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-06-27 16:55:02,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:02,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:02,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 16:55:02,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:55:02,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash 356044648, now seen corresponding path program 1 times [2024-06-27 16:55:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466540897] [2024-06-27 16:55:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466540897] [2024-06-27 16:55:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466540897] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706377013] [2024-06-27 16:55:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:04,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:04,009 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-06-27 16:55:04,010 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-06-27 16:55:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:04,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 29 conjunts are in the unsatisfiable core [2024-06-27 16:55:04,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:04,624 INFO L349 Elim1Store]: treesize reduction 16, result has 69.8 percent of original size [2024-06-27 16:55:04,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 50 [2024-06-27 16:55:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:04,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:56:01,308 INFO L349 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2024-06-27 16:56:01,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 250 [2024-06-27 16:56:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:56:06,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706377013] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:56:06,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:56:06,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2024-06-27 16:56:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949080125] [2024-06-27 16:56:06,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:56:06,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-27 16:56:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:56:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-27 16:56:06,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=357, Unknown=14, NotChecked=0, Total=420 [2024-06-27 16:56:10,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:14,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:18,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:22,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:26,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:31,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:35,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:39,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:56:39,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-27 16:56:39,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 620 flow. Second operand has 21 states, 21 states have (on average 17.476190476190474) internal successors, (367), 21 states have internal predecessors, (367), 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-06-27 16:56:39,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:56:39,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-27 16:56:39,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:57:04,935 INFO L124 PetriNetUnfolderBase]: 35634/50613 cut-off events. [2024-06-27 16:57:04,935 INFO L125 PetriNetUnfolderBase]: For 233717/234153 co-relation queries the response was YES. [2024-06-27 16:57:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212637 conditions, 50613 events. 35634/50613 cut-off events. For 233717/234153 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 327787 event pairs, 6009 based on Foata normal form. 444/50446 useless extension candidates. Maximal degree in co-relation 212585. Up to 23425 conditions per place. [2024-06-27 16:57:05,489 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 245 selfloop transitions, 53 changer transitions 1/310 dead transitions. [2024-06-27 16:57:05,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 310 transitions, 2749 flow [2024-06-27 16:57:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 16:57:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 16:57:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 410 transitions. [2024-06-27 16:57:05,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2024-06-27 16:57:05,491 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 620 flow. Second operand 17 states and 410 transitions. [2024-06-27 16:57:05,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 310 transitions, 2749 flow [2024-06-27 16:57:05,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 310 transitions, 2718 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 16:57:05,642 INFO L231 Difference]: Finished difference. Result has 113 places, 135 transitions, 1273 flow [2024-06-27 16:57:05,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1273, PETRI_PLACES=113, PETRI_TRANSITIONS=135} [2024-06-27 16:57:05,643 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2024-06-27 16:57:05,643 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 135 transitions, 1273 flow [2024-06-27 16:57:05,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 17.476190476190474) internal successors, (367), 21 states have internal predecessors, (367), 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-06-27 16:57:05,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:57:05,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:57:05,654 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-06-27 16:57:05,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:57:05,844 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:57:05,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:57:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1560236022, now seen corresponding path program 2 times [2024-06-27 16:57:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:57:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175938297] [2024-06-27 16:57:05,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:57:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:57:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:57:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:57:08,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:57:08,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175938297] [2024-06-27 16:57:08,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175938297] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:57:08,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368028417] [2024-06-27 16:57:08,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:57:08,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:57:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:57:08,181 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-06-27 16:57:08,182 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-06-27 16:57:08,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:57:08,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:57:08,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 49 conjunts are in the unsatisfiable core [2024-06-27 16:57:08,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:57:08,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-27 16:57:08,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-27 16:57:08,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 16:57:08,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 16:57:08,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:57:09,506 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-06-27 16:57:09,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 42 [2024-06-27 16:57:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:57:09,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:57:14,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:57:14,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 91 [2024-06-27 16:57:14,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:57:14,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 306 treesize of output 454 [2024-06-27 16:57:15,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:57:15,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 354 [2024-06-27 17:00:50,672 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 17:00:50,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-27 17:00:50,674 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 17:00:50,686 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-06-27 17:00:50,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-27 17:00:50,887 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-06-27 17:00:50,892 INFO L158 Benchmark]: Toolchain (without parser) took 360989.83ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 83.2MB in the beginning and 660.4MB in the end (delta: -577.2MB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-06-27 17:00:50,892 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 106.4MB in the beginning and 106.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:00:50,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.20ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 69.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:00:50,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.47ms. Allocated memory is still 155.2MB. Free memory was 69.1MB in the beginning and 66.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:00:50,892 INFO L158 Benchmark]: Boogie Preprocessor took 69.01ms. Allocated memory is still 155.2MB. Free memory was 66.3MB in the beginning and 62.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:00:50,892 INFO L158 Benchmark]: RCFGBuilder took 893.72ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 62.6MB in the beginning and 90.9MB in the end (delta: -28.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-06-27 17:00:50,894 INFO L158 Benchmark]: TraceAbstraction took 359715.94ms. Allocated memory was 211.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 89.8MB in the beginning and 660.4MB in the end (delta: -570.6MB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-06-27 17:00:50,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 106.4MB in the beginning and 106.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.20ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 69.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.47ms. Allocated memory is still 155.2MB. Free memory was 69.1MB in the beginning and 66.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.01ms. Allocated memory is still 155.2MB. Free memory was 66.3MB in the beginning and 62.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 893.72ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 62.6MB in the beginning and 90.9MB in the end (delta: -28.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 359715.94ms. Allocated memory was 211.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 89.8MB in the beginning and 660.4MB in the end (delta: -570.6MB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-more-buffer-series2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:00:52,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:00:52,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:00:52,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:00:52,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:00:52,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:00:52,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:00:52,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:00:52,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:00:52,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:00:52,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:00:52,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:00:52,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:00:52,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:00:52,797 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:00:52,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:00:52,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:00:52,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:00:52,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:00:52,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:00:52,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:00:52,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:00:52,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:00:52,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:00:52,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:00:52,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:00:52,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:00:52,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:00:52,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:00:52,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:00:52,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:00:52,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:00:52,803 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:00:52,803 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2024-06-27 17:00:53,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:00:53,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:00:53,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:00:53,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:00:53,078 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:00:53,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-27 17:00:54,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:00:54,148 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:00:54,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-27 17:00:54,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d83a5085/e56d46d1a4c7401b8b87978c23b07689/FLAG4b43cf836 [2024-06-27 17:00:54,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d83a5085/e56d46d1a4c7401b8b87978c23b07689 [2024-06-27 17:00:54,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:00:54,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:00:54,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:00:54,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:00:54,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:00:54,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2106096a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54, skipping insertion in model container [2024-06-27 17:00:54,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:00:54,769 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 17:00:54,782 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:00:54,791 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:00:54,799 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:00:54,830 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 17:00:54,835 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:00:54,842 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:00:54,865 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 17:00:54,869 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:00:54,883 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:00:54,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54 WrapperNode [2024-06-27 17:00:54,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:00:54,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:00:54,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:00:54,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:00:54,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,945 INFO L138 Inliner]: procedures = 28, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 326 [2024-06-27 17:00:54,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:00:54,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:00:54,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:00:54,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:00:54,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,990 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 17:00:54,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:54,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:55,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:55,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:55,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:55,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:55,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:00:55,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:00:55,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:00:55,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:00:55,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (1/1) ... [2024-06-27 17:00:55,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:00:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:00:55,048 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-06-27 17:00:55,064 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-06-27 17:00:55,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:00:55,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:00:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:00:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:00:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:00:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:00:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:00:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:00:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:00:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:00:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 17:00:55,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:00:55,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:00:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:00:55,094 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:00:55,200 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:00:55,202 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:00:55,685 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:00:55,685 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:00:55,972 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:00:55,972 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-06-27 17:00:55,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:00:55 BoogieIcfgContainer [2024-06-27 17:00:55,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:00:55,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:00:55,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:00:55,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:00:55,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:00:54" (1/3) ... [2024-06-27 17:00:55,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c52bb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:00:55, skipping insertion in model container [2024-06-27 17:00:55,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:00:54" (2/3) ... [2024-06-27 17:00:55,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c52bb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:00:55, skipping insertion in model container [2024-06-27 17:00:55,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:00:55" (3/3) ... [2024-06-27 17:00:55,979 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-06-27 17:00:55,986 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:00:55,993 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:00:55,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:00:55,994 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:00:56,043 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 17:00:56,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 128 flow [2024-06-27 17:00:56,099 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-06-27 17:00:56,099 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 17:00:56,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 7/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 17:00:56,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 128 flow [2024-06-27 17:00:56,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 114 flow [2024-06-27 17:00:56,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:00:56,114 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c3c54b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:00:56,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 17:00:56,124 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:00:56,124 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-06-27 17:00:56,124 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 17:00:56,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:56,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:56,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:00:56,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash -574010348, now seen corresponding path program 1 times [2024-06-27 17:00:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926246596] [2024-06-27 17:00:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:56,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:56,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:56,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 17:00:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:56,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 17:00:56,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:56,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:00:56,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:56,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926246596] [2024-06-27 17:00:56,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926246596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:00:56,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:00:56,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:00:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532146734] [2024-06-27 17:00:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:00:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:00:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:00:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:00:56,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 17:00:56,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06-27 17:00:56,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:56,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 17:00:56,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:56,705 INFO L124 PetriNetUnfolderBase]: 1030/1754 cut-off events. [2024-06-27 17:00:56,705 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-06-27 17:00:56,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 1754 events. 1030/1754 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10534 event pairs, 252 based on Foata normal form. 1/1639 useless extension candidates. Maximal degree in co-relation 2793. Up to 989 conditions per place. [2024-06-27 17:00:56,719 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 39 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2024-06-27 17:00:56,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 245 flow [2024-06-27 17:00:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:00:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:00:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-27 17:00:56,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-06-27 17:00:56,730 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 114 flow. Second operand 3 states and 107 transitions. [2024-06-27 17:00:56,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 245 flow [2024-06-27 17:00:56,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 219 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 17:00:56,736 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 117 flow [2024-06-27 17:00:56,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-06-27 17:00:56,739 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-06-27 17:00:56,740 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 117 flow [2024-06-27 17:00:56,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06-27 17:00:56,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:56,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:56,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:56,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:56,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:00:56,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2021850373, now seen corresponding path program 1 times [2024-06-27 17:00:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66115820] [2024-06-27 17:00:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:56,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:56,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 17:00:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:57,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:00:57,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:57,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:00:57,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66115820] [2024-06-27 17:00:57,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66115820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:00:57,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:00:57,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:00:57,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184802452] [2024-06-27 17:00:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:00:57,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:00:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:00:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:00:57,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 17:00:57,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:57,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:57,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 17:00:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:58,138 INFO L124 PetriNetUnfolderBase]: 3437/4937 cut-off events. [2024-06-27 17:00:58,138 INFO L125 PetriNetUnfolderBase]: For 711/711 co-relation queries the response was YES. [2024-06-27 17:00:58,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10564 conditions, 4937 events. 3437/4937 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 29138 event pairs, 305 based on Foata normal form. 106/4689 useless extension candidates. Maximal degree in co-relation 4176. Up to 2134 conditions per place. [2024-06-27 17:00:58,160 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 117 selfloop transitions, 12 changer transitions 1/142 dead transitions. [2024-06-27 17:00:58,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 142 transitions, 625 flow [2024-06-27 17:00:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:00:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:00:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 269 transitions. [2024-06-27 17:00:58,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5977777777777777 [2024-06-27 17:00:58,171 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 117 flow. Second operand 9 states and 269 transitions. [2024-06-27 17:00:58,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 142 transitions, 625 flow [2024-06-27 17:00:58,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 142 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:00:58,175 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 201 flow [2024-06-27 17:00:58,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-06-27 17:00:58,176 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2024-06-27 17:00:58,176 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 201 flow [2024-06-27 17:00:58,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:58,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:58,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:58,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:58,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:00:58,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash -274534325, now seen corresponding path program 1 times [2024-06-27 17:00:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264604096] [2024-06-27 17:00:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:58,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:58,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 17:00:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:58,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:00:58,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:00:58,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:00:58,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264604096] [2024-06-27 17:00:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264604096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:00:58,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:00:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:00:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596543972] [2024-06-27 17:00:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:00:58,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:00:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:00:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:00:58,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 17:00:58,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:58,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:58,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 17:00:58,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:59,497 INFO L124 PetriNetUnfolderBase]: 4314/6116 cut-off events. [2024-06-27 17:00:59,497 INFO L125 PetriNetUnfolderBase]: For 8878/9635 co-relation queries the response was YES. [2024-06-27 17:00:59,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17104 conditions, 6116 events. 4314/6116 cut-off events. For 8878/9635 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 35282 event pairs, 342 based on Foata normal form. 524/6208 useless extension candidates. Maximal degree in co-relation 10554. Up to 2889 conditions per place. [2024-06-27 17:00:59,529 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 150 selfloop transitions, 12 changer transitions 24/200 dead transitions. [2024-06-27 17:00:59,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 200 transitions, 1252 flow [2024-06-27 17:00:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:00:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:00:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 261 transitions. [2024-06-27 17:00:59,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-06-27 17:00:59,530 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 201 flow. Second operand 9 states and 261 transitions. [2024-06-27 17:00:59,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 200 transitions, 1252 flow [2024-06-27 17:00:59,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 200 transitions, 1252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:00:59,539 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 288 flow [2024-06-27 17:00:59,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-06-27 17:00:59,539 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2024-06-27 17:00:59,539 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 288 flow [2024-06-27 17:00:59,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:59,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:59,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:59,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-06-27 17:00:59,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:59,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:00:59,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 307965632, now seen corresponding path program 1 times [2024-06-27 17:00:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518488101] [2024-06-27 17:00:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:00:59,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:59,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:59,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:59,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 17:00:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:00:59,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:00:59,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:00:59,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:00:59,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:59,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518488101] [2024-06-27 17:00:59,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518488101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:00:59,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:00:59,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:00:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181648790] [2024-06-27 17:00:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:00:59,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:00:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:00:59,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:00:59,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 17:00:59,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 17:00:59,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:59,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 17:00:59,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:00,437 INFO L124 PetriNetUnfolderBase]: 2525/3886 cut-off events. [2024-06-27 17:01:00,437 INFO L125 PetriNetUnfolderBase]: For 9624/10468 co-relation queries the response was YES. [2024-06-27 17:01:00,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13456 conditions, 3886 events. 2525/3886 cut-off events. For 9624/10468 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24400 event pairs, 1513 based on Foata normal form. 612/4016 useless extension candidates. Maximal degree in co-relation 8841. Up to 2485 conditions per place. [2024-06-27 17:01:00,462 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 81 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2024-06-27 17:01:00,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 616 flow [2024-06-27 17:01:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:01:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:01:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-06-27 17:01:00,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.69 [2024-06-27 17:01:00,463 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 288 flow. Second operand 4 states and 138 transitions. [2024-06-27 17:01:00,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 616 flow [2024-06-27 17:01:00,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 616 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:01:00,472 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 310 flow [2024-06-27 17:01:00,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2024-06-27 17:01:00,473 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-06-27 17:01:00,473 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 310 flow [2024-06-27 17:01:00,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 17:01:00,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:00,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:00,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:01:00,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:00,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:00,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1771133152, now seen corresponding path program 1 times [2024-06-27 17:01:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176736148] [2024-06-27 17:01:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:00,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:00,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:00,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 17:01:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:00,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:01:00,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:01:00,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:01:00,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176736148] [2024-06-27 17:01:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176736148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:01:00,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:01:00,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:01:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644253276] [2024-06-27 17:01:00,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:01:00,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:01:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:01:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:01:00,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 17:01:00,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 17:01:00,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:00,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 17:01:00,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:01,462 INFO L124 PetriNetUnfolderBase]: 3475/5462 cut-off events. [2024-06-27 17:01:01,462 INFO L125 PetriNetUnfolderBase]: For 13325/14699 co-relation queries the response was YES. [2024-06-27 17:01:01,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18814 conditions, 5462 events. 3475/5462 cut-off events. For 13325/14699 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 37369 event pairs, 2116 based on Foata normal form. 1014/5801 useless extension candidates. Maximal degree in co-relation 13682. Up to 3485 conditions per place. [2024-06-27 17:01:01,489 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 77 selfloop transitions, 4 changer transitions 3/105 dead transitions. [2024-06-27 17:01:01,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 638 flow [2024-06-27 17:01:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:01:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:01:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-06-27 17:01:01,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-27 17:01:01,490 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 310 flow. Second operand 4 states and 136 transitions. [2024-06-27 17:01:01,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 638 flow [2024-06-27 17:01:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 634 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:01:01,507 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 331 flow [2024-06-27 17:01:01,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2024-06-27 17:01:01,508 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2024-06-27 17:01:01,508 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 331 flow [2024-06-27 17:01:01,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-06-27 17:01:01,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:01,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:01,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:01:01,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:01,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:01,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1953045925, now seen corresponding path program 1 times [2024-06-27 17:01:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506035696] [2024-06-27 17:01:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:01,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:01,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:01,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 17:01:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:01,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 17:01:01,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:01,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:01:01,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506035696] [2024-06-27 17:01:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506035696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:01:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:01:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:01:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921896806] [2024-06-27 17:01:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:01:01,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:01:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:01:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:01:02,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 17:01:02,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 331 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 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-06-27 17:01:02,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:02,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 17:01:02,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:03,724 INFO L124 PetriNetUnfolderBase]: 12917/19816 cut-off events. [2024-06-27 17:01:03,724 INFO L125 PetriNetUnfolderBase]: For 36653/39584 co-relation queries the response was YES. [2024-06-27 17:01:03,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64121 conditions, 19816 events. 12917/19816 cut-off events. For 36653/39584 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 142889 event pairs, 4181 based on Foata normal form. 1160/19898 useless extension candidates. Maximal degree in co-relation 48295. Up to 10303 conditions per place. [2024-06-27 17:01:03,815 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 108 selfloop transitions, 15 changer transitions 38/174 dead transitions. [2024-06-27 17:01:03,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 174 transitions, 1099 flow [2024-06-27 17:01:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:01:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:01:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 17:01:03,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028571428571429 [2024-06-27 17:01:03,817 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 331 flow. Second operand 7 states and 211 transitions. [2024-06-27 17:01:03,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 174 transitions, 1099 flow [2024-06-27 17:01:03,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 174 transitions, 1094 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:01:03,965 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 478 flow [2024-06-27 17:01:03,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=478, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-06-27 17:01:03,968 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2024-06-27 17:01:03,968 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 478 flow [2024-06-27 17:01:03,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 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-06-27 17:01:03,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:03,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:03,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-06-27 17:01:04,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:04,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:04,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1038205517, now seen corresponding path program 2 times [2024-06-27 17:01:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531712046] [2024-06-27 17:01:04,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:01:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:04,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:04,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:04,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-27 17:01:04,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:01:04,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:01:04,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:01:04,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:04,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:01:04,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:04,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531712046] [2024-06-27 17:01:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531712046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:01:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:01:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:01:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607682469] [2024-06-27 17:01:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:01:04,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:01:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:01:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:01:04,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 17:01:04,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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-06-27 17:01:04,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:04,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 17:01:04,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:06,643 INFO L124 PetriNetUnfolderBase]: 12487/19032 cut-off events. [2024-06-27 17:01:06,643 INFO L125 PetriNetUnfolderBase]: For 45063/47889 co-relation queries the response was YES. [2024-06-27 17:01:06,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67861 conditions, 19032 events. 12487/19032 cut-off events. For 45063/47889 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 138339 event pairs, 1297 based on Foata normal form. 1018/19013 useless extension candidates. Maximal degree in co-relation 50807. Up to 6271 conditions per place. [2024-06-27 17:01:06,746 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 182 selfloop transitions, 43 changer transitions 5/244 dead transitions. [2024-06-27 17:01:06,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 244 transitions, 1786 flow [2024-06-27 17:01:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:01:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:01:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2024-06-27 17:01:06,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-06-27 17:01:06,748 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 478 flow. Second operand 12 states and 348 transitions. [2024-06-27 17:01:06,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 244 transitions, 1786 flow [2024-06-27 17:01:07,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 244 transitions, 1784 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 17:01:07,027 INFO L231 Difference]: Finished difference. Result has 108 places, 115 transitions, 922 flow [2024-06-27 17:01:07,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=922, PETRI_PLACES=108, PETRI_TRANSITIONS=115} [2024-06-27 17:01:07,030 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 57 predicate places. [2024-06-27 17:01:07,030 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 115 transitions, 922 flow [2024-06-27 17:01:07,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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-06-27 17:01:07,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:07,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:07,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-27 17:01:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:07,234 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:07,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1326319563, now seen corresponding path program 3 times [2024-06-27 17:01:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567060183] [2024-06-27 17:01:07,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:01:07,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:07,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:07,236 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:07,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-27 17:01:07,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:01:07,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:01:07,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:01:07,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:07,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:01:07,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567060183] [2024-06-27 17:01:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567060183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:01:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:01:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:01:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54372840] [2024-06-27 17:01:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:01:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:01:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:01:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:01:07,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-06-27 17:01:07,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 115 transitions, 922 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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-06-27 17:01:07,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:07,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-06-27 17:01:07,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:10,553 INFO L124 PetriNetUnfolderBase]: 15864/24562 cut-off events. [2024-06-27 17:01:10,553 INFO L125 PetriNetUnfolderBase]: For 86904/90289 co-relation queries the response was YES. [2024-06-27 17:01:10,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99383 conditions, 24562 events. 15864/24562 cut-off events. For 86904/90289 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 187435 event pairs, 1789 based on Foata normal form. 906/24192 useless extension candidates. Maximal degree in co-relation 72935. Up to 8276 conditions per place. [2024-06-27 17:01:10,678 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 208 selfloop transitions, 74 changer transitions 27/323 dead transitions. [2024-06-27 17:01:10,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 323 transitions, 2844 flow [2024-06-27 17:01:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:01:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:01:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 404 transitions. [2024-06-27 17:01:10,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2024-06-27 17:01:10,680 INFO L175 Difference]: Start difference. First operand has 108 places, 115 transitions, 922 flow. Second operand 14 states and 404 transitions. [2024-06-27 17:01:10,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 323 transitions, 2844 flow [2024-06-27 17:01:11,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 323 transitions, 2747 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 17:01:11,044 INFO L231 Difference]: Finished difference. Result has 125 places, 147 transitions, 1430 flow [2024-06-27 17:01:11,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1430, PETRI_PLACES=125, PETRI_TRANSITIONS=147} [2024-06-27 17:01:11,044 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 74 predicate places. [2024-06-27 17:01:11,045 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 147 transitions, 1430 flow [2024-06-27 17:01:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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-06-27 17:01:11,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:11,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:11,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-06-27 17:01:11,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:11,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:11,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:11,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1174231603, now seen corresponding path program 4 times [2024-06-27 17:01:11,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:11,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520282245] [2024-06-27 17:01:11,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:01:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:11,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:11,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:11,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-27 17:01:11,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:01:11,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:01:11,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:01:11,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:11,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:01:11,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:11,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520282245] [2024-06-27 17:01:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520282245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:01:11,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:01:11,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:01:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414650929] [2024-06-27 17:01:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:01:11,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:01:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:11,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:01:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:01:11,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 17:01:11,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 147 transitions, 1430 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 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-06-27 17:01:11,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:11,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 17:01:11,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:14,864 INFO L124 PetriNetUnfolderBase]: 17997/26985 cut-off events. [2024-06-27 17:01:14,865 INFO L125 PetriNetUnfolderBase]: For 135917/139749 co-relation queries the response was YES. [2024-06-27 17:01:14,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115344 conditions, 26985 events. 17997/26985 cut-off events. For 135917/139749 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 199268 event pairs, 2162 based on Foata normal form. 1176/27365 useless extension candidates. Maximal degree in co-relation 95599. Up to 13517 conditions per place. [2024-06-27 17:01:15,019 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 195 selfloop transitions, 63 changer transitions 13/284 dead transitions. [2024-06-27 17:01:15,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 284 transitions, 2737 flow [2024-06-27 17:01:15,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:01:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:01:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 343 transitions. [2024-06-27 17:01:15,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5716666666666667 [2024-06-27 17:01:15,022 INFO L175 Difference]: Start difference. First operand has 125 places, 147 transitions, 1430 flow. Second operand 12 states and 343 transitions. [2024-06-27 17:01:15,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 284 transitions, 2737 flow [2024-06-27 17:01:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 284 transitions, 2704 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 17:01:15,862 INFO L231 Difference]: Finished difference. Result has 137 places, 146 transitions, 1549 flow [2024-06-27 17:01:15,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1549, PETRI_PLACES=137, PETRI_TRANSITIONS=146} [2024-06-27 17:01:15,863 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 86 predicate places. [2024-06-27 17:01:15,863 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 146 transitions, 1549 flow [2024-06-27 17:01:15,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 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-06-27 17:01:15,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:15,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:15,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-06-27 17:01:16,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:16,066 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:16,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1220789002, now seen corresponding path program 1 times [2024-06-27 17:01:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756147543] [2024-06-27 17:01:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:16,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:16,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-27 17:01:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:16,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 17:01:16,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:01:16,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:01:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:16,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:16,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756147543] [2024-06-27 17:01:16,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756147543] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:01:16,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:01:16,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-06-27 17:01:16,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820097109] [2024-06-27 17:01:16,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:01:16,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:01:16,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:16,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:01:16,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:01:16,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-06-27 17:01:16,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 146 transitions, 1549 flow. Second operand has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 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-06-27 17:01:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:16,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-06-27 17:01:16,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:21,183 INFO L124 PetriNetUnfolderBase]: 21448/33271 cut-off events. [2024-06-27 17:01:21,183 INFO L125 PetriNetUnfolderBase]: For 210079/213897 co-relation queries the response was YES. [2024-06-27 17:01:21,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147942 conditions, 33271 events. 21448/33271 cut-off events. For 210079/213897 co-relation queries the response was YES. Maximal size of possible extension queue 1999. Compared 268397 event pairs, 5044 based on Foata normal form. 1221/33281 useless extension candidates. Maximal degree in co-relation 131645. Up to 6727 conditions per place. [2024-06-27 17:01:21,603 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 234 selfloop transitions, 101 changer transitions 5/365 dead transitions. [2024-06-27 17:01:21,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 365 transitions, 4016 flow [2024-06-27 17:01:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:01:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:01:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 360 transitions. [2024-06-27 17:01:21,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 17:01:21,605 INFO L175 Difference]: Start difference. First operand has 137 places, 146 transitions, 1549 flow. Second operand 12 states and 360 transitions. [2024-06-27 17:01:21,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 365 transitions, 4016 flow [2024-06-27 17:01:22,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 365 transitions, 3702 flow, removed 21 selfloop flow, removed 14 redundant places. [2024-06-27 17:01:22,776 INFO L231 Difference]: Finished difference. Result has 135 places, 196 transitions, 2197 flow [2024-06-27 17:01:22,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2197, PETRI_PLACES=135, PETRI_TRANSITIONS=196} [2024-06-27 17:01:22,776 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 84 predicate places. [2024-06-27 17:01:22,776 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 196 transitions, 2197 flow [2024-06-27 17:01:22,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 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-06-27 17:01:22,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:22,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:22,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-06-27 17:01:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:22,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:22,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1969313509, now seen corresponding path program 1 times [2024-06-27 17:01:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216784283] [2024-06-27 17:01:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:22,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:22,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-06-27 17:01:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:23,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 17:01:23,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:23,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:01:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:23,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216784283] [2024-06-27 17:01:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216784283] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:01:23,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:01:23,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-06-27 17:01:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145420993] [2024-06-27 17:01:23,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:01:23,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:01:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:23,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:01:23,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:01:23,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-06-27 17:01:23,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 196 transitions, 2197 flow. Second operand has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 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-06-27 17:01:23,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:23,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-06-27 17:01:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:27,098 INFO L124 PetriNetUnfolderBase]: 16392/24904 cut-off events. [2024-06-27 17:01:27,098 INFO L125 PetriNetUnfolderBase]: For 121960/123771 co-relation queries the response was YES. [2024-06-27 17:01:27,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105411 conditions, 24904 events. 16392/24904 cut-off events. For 121960/123771 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 186571 event pairs, 2730 based on Foata normal form. 1196/25262 useless extension candidates. Maximal degree in co-relation 105354. Up to 6640 conditions per place. [2024-06-27 17:01:27,328 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 216 selfloop transitions, 55 changer transitions 6/334 dead transitions. [2024-06-27 17:01:27,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 334 transitions, 3543 flow [2024-06-27 17:01:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:01:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:01:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 351 transitions. [2024-06-27 17:01:27,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.585 [2024-06-27 17:01:27,330 INFO L175 Difference]: Start difference. First operand has 135 places, 196 transitions, 2197 flow. Second operand 12 states and 351 transitions. [2024-06-27 17:01:27,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 334 transitions, 3543 flow [2024-06-27 17:01:27,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 334 transitions, 3269 flow, removed 83 selfloop flow, removed 7 redundant places. [2024-06-27 17:01:27,990 INFO L231 Difference]: Finished difference. Result has 139 places, 204 transitions, 2176 flow [2024-06-27 17:01:27,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2176, PETRI_PLACES=139, PETRI_TRANSITIONS=204} [2024-06-27 17:01:27,992 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 88 predicate places. [2024-06-27 17:01:27,992 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 204 transitions, 2176 flow [2024-06-27 17:01:27,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 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-06-27 17:01:27,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:27,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:28,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-06-27 17:01:28,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:28,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:28,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1247305288, now seen corresponding path program 1 times [2024-06-27 17:01:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796361939] [2024-06-27 17:01:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:01:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:28,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:28,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-06-27 17:01:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:01:28,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:01:28,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:01:28,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:01:28,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796361939] [2024-06-27 17:01:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796361939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:01:28,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:01:28,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:01:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236796722] [2024-06-27 17:01:28,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:01:28,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:01:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:01:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:01:28,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-06-27 17:01:28,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 204 transitions, 2176 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-06-27 17:01:28,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:28,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-06-27 17:01:28,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:01:33,418 INFO L124 PetriNetUnfolderBase]: 21694/33931 cut-off events. [2024-06-27 17:01:33,418 INFO L125 PetriNetUnfolderBase]: For 150658/154238 co-relation queries the response was YES. [2024-06-27 17:01:33,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139727 conditions, 33931 events. 21694/33931 cut-off events. For 150658/154238 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 285526 event pairs, 2977 based on Foata normal form. 1886/34235 useless extension candidates. Maximal degree in co-relation 139670. Up to 9490 conditions per place. [2024-06-27 17:01:33,805 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 292 selfloop transitions, 39 changer transitions 0/414 dead transitions. [2024-06-27 17:01:33,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 414 transitions, 4528 flow [2024-06-27 17:01:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:01:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:01:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-06-27 17:01:33,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-06-27 17:01:33,806 INFO L175 Difference]: Start difference. First operand has 139 places, 204 transitions, 2176 flow. Second operand 8 states and 265 transitions. [2024-06-27 17:01:33,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 414 transitions, 4528 flow [2024-06-27 17:01:34,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 414 transitions, 4442 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-27 17:01:34,240 INFO L231 Difference]: Finished difference. Result has 142 places, 216 transitions, 2323 flow [2024-06-27 17:01:34,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2323, PETRI_PLACES=142, PETRI_TRANSITIONS=216} [2024-06-27 17:01:34,241 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 91 predicate places. [2024-06-27 17:01:34,241 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 216 transitions, 2323 flow [2024-06-27 17:01:34,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-06-27 17:01:34,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:01:34,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:01:34,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-06-27 17:01:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:34,442 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:01:34,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:01:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1529862530, now seen corresponding path program 2 times [2024-06-27 17:01:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:01:34,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947494320] [2024-06-27 17:01:34,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:01:34,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:01:34,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:01:34,444 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:01:34,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-06-27 17:01:34,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:01:34,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:01:34,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:01:34,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:01:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:01:34,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:01:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:01:34,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947494320] [2024-06-27 17:01:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947494320] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:01:34,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:01:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-06-27 17:01:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833915215] [2024-06-27 17:01:34,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:01:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:01:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:01:34,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:01:34,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-06-27 17:01:34,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 216 transitions, 2323 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-06-27 17:01:34,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:34,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-06-27 17:01:34,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand