./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:35:14,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:35:14,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:35:14,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:35:14,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:35:14,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:35:14,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:35:14,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:35:14,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:35:14,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:35:14,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:35:14,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:35:14,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:35:14,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:35:14,673 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:35:14,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:35:14,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:35:14,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:35:14,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:35:14,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:35:14,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:35:14,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:35:14,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:35:14,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:35:14,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:35:14,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:35:14,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:35:14,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:35:14,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:35:14,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:35:14,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:35:14,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:35:14,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:35:14,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:35:14,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:35:14,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:35:14,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:35:14,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:35:14,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:35:14,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:35:14,679 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:35:14,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:35:14,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:35:14,680 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-01-27 15:35:14,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:35:14,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:35:14,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:35:14,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:35:14,859 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:35:14,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-01-27 15:35:15,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:35:15,967 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:35:15,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-01-27 15:35:15,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4943803/0791528705b04bc992a38b15c4daf5ce/FLAG6d3273671 [2024-01-27 15:35:15,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4943803/0791528705b04bc992a38b15c4daf5ce [2024-01-27 15:35:15,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:35:15,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:35:15,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:35:15,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:35:15,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:35:15,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:35:15" (1/1) ... [2024-01-27 15:35:15,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36863d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:15, skipping insertion in model container [2024-01-27 15:35:15,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:35:15" (1/1) ... [2024-01-27 15:35:16,016 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:35:16,167 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-01-27 15:35:16,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:35:16,182 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:35:16,231 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-01-27 15:35:16,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:35:16,245 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:35:16,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16 WrapperNode [2024-01-27 15:35:16,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:35:16,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:35:16,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:35:16,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:35:16,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,292 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 283 [2024-01-27 15:35:16,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:35:16,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:35:16,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:35:16,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:35:16,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,317 INFO L175 MemorySlicer]: Split 17 memory accesses to 5 slices as follows [2, 9, 2, 2, 2]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 1, 1]. [2024-01-27 15:35:16,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:35:16,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:35:16,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:35:16,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:35:16,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (1/1) ... [2024-01-27 15:35:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:35:16,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:16,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:35:16,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:35:16,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:35:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:35:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:35:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:35:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:35:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:35:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:35:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:35:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:35:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:35:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:35:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:35:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:35:16,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:35:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:35:16,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:35:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:35:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:35:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:35:16,440 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:35:16,530 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:35:16,532 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:35:16,814 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:35:16,815 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:35:17,087 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:35:17,087 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:35:17,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:35:17 BoogieIcfgContainer [2024-01-27 15:35:17,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:35:17,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:35:17,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:35:17,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:35:17,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:35:15" (1/3) ... [2024-01-27 15:35:17,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e7f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:35:17, skipping insertion in model container [2024-01-27 15:35:17,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:16" (2/3) ... [2024-01-27 15:35:17,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e7f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:35:17, skipping insertion in model container [2024-01-27 15:35:17,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:35:17" (3/3) ... [2024-01-27 15:35:17,096 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-01-27 15:35:17,103 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:35:17,110 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:35:17,111 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:35:17,111 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:35:17,153 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:35:17,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 87 flow [2024-01-27 15:35:17,212 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2024-01-27 15:35:17,212 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:35:17,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 6/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-01-27 15:35:17,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 33 transitions, 87 flow [2024-01-27 15:35:17,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 29 transitions, 76 flow [2024-01-27 15:35:17,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:35:17,230 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;@7b46b2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:35:17,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:35:17,238 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:35:17,240 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-01-27 15:35:17,241 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:35:17,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:17,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] [2024-01-27 15:35:17,242 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 1 more)] === [2024-01-27 15:35:17,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash -783779341, now seen corresponding path program 1 times [2024-01-27 15:35:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:17,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534269309] [2024-01-27 15:35:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534269309] [2024-01-27 15:35:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534269309] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:17,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:35:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519000178] [2024-01-27 15:35:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:17,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:35:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:35:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:35:17,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:17,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:17,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:17,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:17,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:17,988 INFO L124 PetriNetUnfolderBase]: 431/637 cut-off events. [2024-01-27 15:35:17,988 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-01-27 15:35:17,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 637 events. 431/637 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1990 event pairs, 138 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 1030. Up to 389 conditions per place. [2024-01-27 15:35:17,998 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 42 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-01-27 15:35:17,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 223 flow [2024-01-27 15:35:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:35:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:35:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-01-27 15:35:18,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-01-27 15:35:18,009 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-01-27 15:35:18,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 223 flow [2024-01-27 15:35:18,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 48 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:35:18,017 INFO L231 Difference]: Finished difference. Result has 30 places, 32 transitions, 90 flow [2024-01-27 15:35:18,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=32} [2024-01-27 15:35:18,023 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2024-01-27 15:35:18,024 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 32 transitions, 90 flow [2024-01-27 15:35:18,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:18,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:18,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:18,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:35:18,025 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 1 more)] === [2024-01-27 15:35:18,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 695678084, now seen corresponding path program 1 times [2024-01-27 15:35:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879914548] [2024-01-27 15:35:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:18,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:18,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879914548] [2024-01-27 15:35:18,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879914548] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:18,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:18,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:18,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710078541] [2024-01-27 15:35:18,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:18,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:35:18,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:18,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:18,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:18,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:18,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:18,445 INFO L124 PetriNetUnfolderBase]: 793/1195 cut-off events. [2024-01-27 15:35:18,445 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-01-27 15:35:18,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2851 conditions, 1195 events. 793/1195 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4346 event pairs, 457 based on Foata normal form. 46/1231 useless extension candidates. Maximal degree in co-relation 1030. Up to 637 conditions per place. [2024-01-27 15:35:18,452 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 65 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2024-01-27 15:35:18,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 378 flow [2024-01-27 15:35:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:35:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:35:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-01-27 15:35:18,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-01-27 15:35:18,455 INFO L175 Difference]: Start difference. First operand has 30 places, 32 transitions, 90 flow. Second operand 6 states and 98 transitions. [2024-01-27 15:35:18,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 378 flow [2024-01-27 15:35:18,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:35:18,460 INFO L231 Difference]: Finished difference. Result has 38 places, 45 transitions, 190 flow [2024-01-27 15:35:18,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=38, PETRI_TRANSITIONS=45} [2024-01-27 15:35:18,463 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2024-01-27 15:35:18,463 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 45 transitions, 190 flow [2024-01-27 15:35:18,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:18,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:18,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:35:18,464 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 1 more)] === [2024-01-27 15:35:18,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1897048753, now seen corresponding path program 1 times [2024-01-27 15:35:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:18,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050989513] [2024-01-27 15:35:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:18,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050989513] [2024-01-27 15:35:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050989513] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:18,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:18,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545521126] [2024-01-27 15:35:18,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:18,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:18,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:18,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:35:18,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:18,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 45 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:18,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:18,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:18,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:18,785 INFO L124 PetriNetUnfolderBase]: 691/1063 cut-off events. [2024-01-27 15:35:18,786 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-01-27 15:35:18,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 1063 events. 691/1063 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3818 event pairs, 417 based on Foata normal form. 46/1106 useless extension candidates. Maximal degree in co-relation 1605. Up to 637 conditions per place. [2024-01-27 15:35:18,791 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 61 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2024-01-27 15:35:18,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 77 transitions, 444 flow [2024-01-27 15:35:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:35:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:35:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-01-27 15:35:18,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-01-27 15:35:18,792 INFO L175 Difference]: Start difference. First operand has 38 places, 45 transitions, 190 flow. Second operand 6 states and 96 transitions. [2024-01-27 15:35:18,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 77 transitions, 444 flow [2024-01-27 15:35:18,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:35:18,795 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 241 flow [2024-01-27 15:35:18,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2024-01-27 15:35:18,796 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2024-01-27 15:35:18,796 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 241 flow [2024-01-27 15:35:18,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:18,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:18,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:18,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:35:18,797 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 1 more)] === [2024-01-27 15:35:18,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2030837961, now seen corresponding path program 1 times [2024-01-27 15:35:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:18,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310686973] [2024-01-27 15:35:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:18,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:18,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310686973] [2024-01-27 15:35:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310686973] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:18,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:18,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105361380] [2024-01-27 15:35:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:18,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:18,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:35:18,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:18,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:18,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:18,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:18,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:19,123 INFO L124 PetriNetUnfolderBase]: 575/892 cut-off events. [2024-01-27 15:35:19,124 INFO L125 PetriNetUnfolderBase]: For 874/874 co-relation queries the response was YES. [2024-01-27 15:35:19,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 892 events. 575/892 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3018 event pairs, 369 based on Foata normal form. 26/915 useless extension candidates. Maximal degree in co-relation 1781. Up to 637 conditions per place. [2024-01-27 15:35:19,128 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 28 selfloop transitions, 6 changer transitions 37/72 dead transitions. [2024-01-27 15:35:19,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 469 flow [2024-01-27 15:35:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:35:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:35:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-01-27 15:35:19,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-01-27 15:35:19,144 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 241 flow. Second operand 6 states and 93 transitions. [2024-01-27 15:35:19,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 469 flow [2024-01-27 15:35:19,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 448 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 15:35:19,148 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 158 flow [2024-01-27 15:35:19,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-01-27 15:35:19,149 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2024-01-27 15:35:19,149 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 158 flow [2024-01-27 15:35:19,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:19,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:19,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:19,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:35:19,150 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 1 more)] === [2024-01-27 15:35:19,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1638250998, now seen corresponding path program 1 times [2024-01-27 15:35:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:19,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462140753] [2024-01-27 15:35:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:19,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462140753] [2024-01-27 15:35:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462140753] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:19,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211760364] [2024-01-27 15:35:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:19,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:19,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:35:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:19,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:35:19,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:19,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211760364] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:19,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:35:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-27 15:35:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2673954] [2024-01-27 15:35:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:19,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 15:35:19,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:19,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:19,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:19,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:19,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:19,568 INFO L124 PetriNetUnfolderBase]: 416/614 cut-off events. [2024-01-27 15:35:19,568 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-01-27 15:35:19,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 614 events. 416/614 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1866 event pairs, 166 based on Foata normal form. 56/669 useless extension candidates. Maximal degree in co-relation 1856. Up to 427 conditions per place. [2024-01-27 15:35:19,572 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 43 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-01-27 15:35:19,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 310 flow [2024-01-27 15:35:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:35:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:35:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-01-27 15:35:19,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-01-27 15:35:19,574 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 158 flow. Second operand 5 states and 62 transitions. [2024-01-27 15:35:19,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 310 flow [2024-01-27 15:35:19,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 246 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-01-27 15:35:19,578 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 131 flow [2024-01-27 15:35:19,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2024-01-27 15:35:19,578 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-01-27 15:35:19,578 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 131 flow [2024-01-27 15:35:19,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:19,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:19,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:19,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:35:19,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:19,792 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 1 more)] === [2024-01-27 15:35:19,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2003372971, now seen corresponding path program 1 times [2024-01-27 15:35:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668410545] [2024-01-27 15:35:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:19,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:19,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668410545] [2024-01-27 15:35:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668410545] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:19,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647592863] [2024-01-27 15:35:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:19,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:19,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:19,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:35:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:19,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:35:19,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:20,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647592863] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:35:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-27 15:35:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736207724] [2024-01-27 15:35:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:20,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 15:35:20,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:20,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:20,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:20,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:20,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:20,154 INFO L124 PetriNetUnfolderBase]: 410/602 cut-off events. [2024-01-27 15:35:20,154 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-01-27 15:35:20,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 602 events. 410/602 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1809 event pairs, 183 based on Foata normal form. 42/641 useless extension candidates. Maximal degree in co-relation 1628. Up to 460 conditions per place. [2024-01-27 15:35:20,157 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 45 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-01-27 15:35:20,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 288 flow [2024-01-27 15:35:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:35:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:35:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-01-27 15:35:20,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-01-27 15:35:20,158 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 131 flow. Second operand 5 states and 62 transitions. [2024-01-27 15:35:20,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 288 flow [2024-01-27 15:35:20,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 270 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-01-27 15:35:20,159 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 141 flow [2024-01-27 15:35:20,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2024-01-27 15:35:20,160 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2024-01-27 15:35:20,160 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 141 flow [2024-01-27 15:35:20,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:20,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:20,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:20,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:35:20,375 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,SelfDestructingSolverStorable5 [2024-01-27 15:35:20,375 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 1 more)] === [2024-01-27 15:35:20,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 927440782, now seen corresponding path program 1 times [2024-01-27 15:35:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76660072] [2024-01-27 15:35:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:35:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76660072] [2024-01-27 15:35:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76660072] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004566123] [2024-01-27 15:35:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:20,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:20,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:20,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:20,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:35:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:20,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:35:20,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:35:20,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:35:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004566123] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:20,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:35:20,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-27 15:35:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101430878] [2024-01-27 15:35:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:20,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 15:35:20,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:20,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:20,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:20,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:20,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:20,764 INFO L124 PetriNetUnfolderBase]: 468/686 cut-off events. [2024-01-27 15:35:20,765 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2024-01-27 15:35:20,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 686 events. 468/686 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2061 event pairs, 221 based on Foata normal form. 42/725 useless extension candidates. Maximal degree in co-relation 1990. Up to 544 conditions per place. [2024-01-27 15:35:20,768 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-01-27 15:35:20,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 312 flow [2024-01-27 15:35:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:35:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:35:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-01-27 15:35:20,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-01-27 15:35:20,769 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 141 flow. Second operand 5 states and 62 transitions. [2024-01-27 15:35:20,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 312 flow [2024-01-27 15:35:20,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 294 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-27 15:35:20,772 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 151 flow [2024-01-27 15:35:20,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2024-01-27 15:35:20,772 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2024-01-27 15:35:20,772 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 151 flow [2024-01-27 15:35:20,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:20,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:20,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:20,786 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-01-27 15:35:20,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:20,987 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 1 more)] === [2024-01-27 15:35:20,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2032112774, now seen corresponding path program 1 times [2024-01-27 15:35:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794443132] [2024-01-27 15:35:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794443132] [2024-01-27 15:35:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794443132] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028461267] [2024-01-27 15:35:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:22,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:22,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:35:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:22,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 47 conjunts are in the unsatisfiable core [2024-01-27 15:35:22,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:22,248 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-01-27 15:35:22,278 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 15 treesize of output 1 [2024-01-27 15:35:22,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:35:22,307 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-01-27 15:35:22,337 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-01-27 15:35:22,516 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-01-27 15:35:22,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-01-27 15:35:22,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-01-27 15:35:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:35:22,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:40,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (~C~0.offset Int) (~A~0.base Int)) (let ((.cse2 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse0 (select (select |c_#memory_int#1| c_~B~0.base) c_~B~0.offset)) (.cse1 (select .cse2 ~A~0.offset))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| c_~C~0.base (store (select |c_#memory_int#1| c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) c_~B~0.offset) (select .cse2 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) ~A~0.offset))) (+ .cse0 c_~csum~0 .cse1))))) is different from false [2024-01-27 15:35:49,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (~C~0.offset Int) (v_ArrVal_273 (Array Int Int)) (~A~0.base Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_273))) (let ((.cse1 (select (select .cse0 c_~B~0.base) c_~B~0.offset))) (= (+ c_~asum~0 c_~bsum~0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store v_ArrVal_273 ~C~0.offset (+ (select (select .cse0 ~A~0.base) ~A~0.offset) .cse1))) c_~B~0.base) c_~B~0.offset)) (+ .cse1 c_~csum~0))))) is different from false [2024-01-27 15:35:49,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:49,209 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 89 treesize of output 54 [2024-01-27 15:35:49,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:49,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 180 treesize of output 163 [2024-01-27 15:35:49,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2024-01-27 15:35:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 1 trivial. 2 not checked. [2024-01-27 15:35:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028461267] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:49,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:49,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2024-01-27 15:35:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047166992] [2024-01-27 15:35:49,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:49,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-01-27 15:35:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-01-27 15:35:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=898, Unknown=4, NotChecked=126, Total=1190 [2024-01-27 15:35:49,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:49,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 151 flow. Second operand has 35 states, 35 states have (on average 5.942857142857143) internal successors, (208), 35 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:49,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:49,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:49,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:51,608 INFO L124 PetriNetUnfolderBase]: 682/999 cut-off events. [2024-01-27 15:35:51,608 INFO L125 PetriNetUnfolderBase]: For 766/766 co-relation queries the response was YES. [2024-01-27 15:35:51,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 999 events. 682/999 cut-off events. For 766/766 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3434 event pairs, 31 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 3104. Up to 729 conditions per place. [2024-01-27 15:35:51,613 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 73 selfloop transitions, 30 changer transitions 1/105 dead transitions. [2024-01-27 15:35:51,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 605 flow [2024-01-27 15:35:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:35:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:35:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 162 transitions. [2024-01-27 15:35:51,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-01-27 15:35:51,621 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 151 flow. Second operand 15 states and 162 transitions. [2024-01-27 15:35:51,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 605 flow [2024-01-27 15:35:51,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 105 transitions, 578 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-27 15:35:51,623 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 332 flow [2024-01-27 15:35:51,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=332, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2024-01-27 15:35:51,626 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2024-01-27 15:35:51,626 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 332 flow [2024-01-27 15:35:51,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.942857142857143) internal successors, (208), 35 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:51,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:51,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:51,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:35:51,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:51,827 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 1 more)] === [2024-01-27 15:35:51,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 178995322, now seen corresponding path program 2 times [2024-01-27 15:35:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058814325] [2024-01-27 15:35:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058814325] [2024-01-27 15:35:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058814325] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493535189] [2024-01-27 15:35:53,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:35:53,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:53,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:53,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:35:53,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:35:53,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:35:53,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 39 conjunts are in the unsatisfiable core [2024-01-27 15:35:53,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:53,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:53,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-01-27 15:35:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:53,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:54,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:54,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2024-01-27 15:35:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493535189] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:54,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 21 [2024-01-27 15:35:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600096579] [2024-01-27 15:35:54,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:54,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:35:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:35:54,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-01-27 15:35:54,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:54,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 332 flow. Second operand has 22 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 22 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:54,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:54,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:54,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:55,604 INFO L124 PetriNetUnfolderBase]: 801/1173 cut-off events. [2024-01-27 15:35:55,605 INFO L125 PetriNetUnfolderBase]: For 1633/1633 co-relation queries the response was YES. [2024-01-27 15:35:55,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 1173 events. 801/1173 cut-off events. For 1633/1633 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4108 event pairs, 147 based on Foata normal form. 1/1174 useless extension candidates. Maximal degree in co-relation 4305. Up to 1000 conditions per place. [2024-01-27 15:35:55,610 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 76 selfloop transitions, 35 changer transitions 1/113 dead transitions. [2024-01-27 15:35:55,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 113 transitions, 810 flow [2024-01-27 15:35:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:35:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:35:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 148 transitions. [2024-01-27 15:35:55,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.298989898989899 [2024-01-27 15:35:55,612 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 332 flow. Second operand 15 states and 148 transitions. [2024-01-27 15:35:55,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 113 transitions, 810 flow [2024-01-27 15:35:55,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 745 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-01-27 15:35:55,615 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 550 flow [2024-01-27 15:35:55,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=550, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2024-01-27 15:35:55,616 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-01-27 15:35:55,616 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 550 flow [2024-01-27 15:35:55,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 22 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:55,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:55,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:55,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-27 15:35:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:55,828 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 1 more)] === [2024-01-27 15:35:55,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -860010222, now seen corresponding path program 3 times [2024-01-27 15:35:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265252509] [2024-01-27 15:35:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265252509] [2024-01-27 15:35:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265252509] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327249665] [2024-01-27 15:35:56,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:35:56,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:56,870 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:56,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-27 15:35:56,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:35:56,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:35:56,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2024-01-27 15:35:57,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:57,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:57,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-01-27 15:35:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:57,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:57,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:57,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2024-01-27 15:35:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:58,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327249665] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:58,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:58,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 25 [2024-01-27 15:35:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528196078] [2024-01-27 15:35:58,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:58,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-01-27 15:35:58,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-01-27 15:35:58,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2024-01-27 15:35:58,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:35:58,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 550 flow. Second operand has 26 states, 26 states have (on average 6.576923076923077) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:58,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:58,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:35:58,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:59,886 INFO L124 PetriNetUnfolderBase]: 943/1380 cut-off events. [2024-01-27 15:35:59,886 INFO L125 PetriNetUnfolderBase]: For 2939/2939 co-relation queries the response was YES. [2024-01-27 15:35:59,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 1380 events. 943/1380 cut-off events. For 2939/2939 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5033 event pairs, 184 based on Foata normal form. 1/1381 useless extension candidates. Maximal degree in co-relation 5582. Up to 1181 conditions per place. [2024-01-27 15:35:59,895 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 92 selfloop transitions, 45 changer transitions 1/139 dead transitions. [2024-01-27 15:35:59,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 1115 flow [2024-01-27 15:35:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:35:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:35:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-01-27 15:35:59,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34032634032634035 [2024-01-27 15:35:59,897 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 550 flow. Second operand 13 states and 146 transitions. [2024-01-27 15:35:59,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 1115 flow [2024-01-27 15:35:59,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 1069 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-01-27 15:35:59,904 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 823 flow [2024-01-27 15:35:59,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=823, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2024-01-27 15:35:59,905 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2024-01-27 15:35:59,905 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 823 flow [2024-01-27 15:35:59,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.576923076923077) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:59,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:59,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:59,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:36:00,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:00,132 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 1 more)] === [2024-01-27 15:36:00,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 220072492, now seen corresponding path program 4 times [2024-01-27 15:36:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180906417] [2024-01-27 15:36:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:36:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180906417] [2024-01-27 15:36:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180906417] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931406939] [2024-01-27 15:36:01,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:36:01,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:01,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:01,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:01,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 15:36:01,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:36:01,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:36:01,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2024-01-27 15:36:01,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:01,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:36:01,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2024-01-27 15:36:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:36:01,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:37:09,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:37:09,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 87 [2024-01-27 15:37:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:37:10,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931406939] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:37:10,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:37:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 23 [2024-01-27 15:37:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253057249] [2024-01-27 15:37:10,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:37:10,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-27 15:37:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:37:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-27 15:37:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=444, Unknown=16, NotChecked=0, Total=552 [2024-01-27 15:37:10,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:37:10,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 823 flow. Second operand has 24 states, 24 states have (on average 6.916666666666667) internal successors, (166), 24 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:10,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:37:10,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:37:10,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:37:15,674 INFO L124 PetriNetUnfolderBase]: 1075/1573 cut-off events. [2024-01-27 15:37:15,674 INFO L125 PetriNetUnfolderBase]: For 5006/5006 co-relation queries the response was YES. [2024-01-27 15:37:15,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7001 conditions, 1573 events. 1075/1573 cut-off events. For 5006/5006 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5810 event pairs, 271 based on Foata normal form. 1/1574 useless extension candidates. Maximal degree in co-relation 6937. Up to 1368 conditions per place. [2024-01-27 15:37:15,683 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 97 selfloop transitions, 54 changer transitions 1/153 dead transitions. [2024-01-27 15:37:15,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 153 transitions, 1428 flow [2024-01-27 15:37:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:37:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:37:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 142 transitions. [2024-01-27 15:37:15,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.331002331002331 [2024-01-27 15:37:15,685 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 823 flow. Second operand 13 states and 142 transitions. [2024-01-27 15:37:15,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 153 transitions, 1428 flow [2024-01-27 15:37:15,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 153 transitions, 1340 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-01-27 15:37:15,696 INFO L231 Difference]: Finished difference. Result has 96 places, 120 transitions, 1121 flow [2024-01-27 15:37:15,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1121, PETRI_PLACES=96, PETRI_TRANSITIONS=120} [2024-01-27 15:37:15,696 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2024-01-27 15:37:15,697 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 120 transitions, 1121 flow [2024-01-27 15:37:15,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.916666666666667) internal successors, (166), 24 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:15,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:37:15,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:37:15,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-01-27 15:37:15,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:37:15,908 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 1 more)] === [2024-01-27 15:37:15,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:37:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1823788844, now seen corresponding path program 5 times [2024-01-27 15:37:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:37:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724047094] [2024-01-27 15:37:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:37:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:37:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:37:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:37:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:37:16,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724047094] [2024-01-27 15:37:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724047094] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:37:16,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942952866] [2024-01-27 15:37:16,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:37:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:37:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:37:16,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:37:16,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-27 15:37:16,824 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:37:16,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:37:16,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 53 conjunts are in the unsatisfiable core [2024-01-27 15:37:16,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:37:16,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2024-01-27 15:37:16,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:37:16,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:16,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:37:16,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:16,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:37:16,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:37:16,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:16,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:16,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:37:16,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:16,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:16,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:37:17,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:17,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:37:17,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:17,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:37:17,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:37:17,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:37:17,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:17,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:37:17,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:17,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:37:17,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:37:17,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:37:17,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:37:17,166 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 15 treesize of output 1 [2024-01-27 15:37:17,230 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-01-27 15:37:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-01-27 15:37:17,302 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-01-27 15:37:17,368 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:37:17,368 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-01-27 15:37:17,423 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-01-27 15:37:17,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:37:17,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2024-01-27 15:37:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:37:17,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:37:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:37:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942952866] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:37:18,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:37:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 8] total 29 [2024-01-27 15:37:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698526459] [2024-01-27 15:37:18,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:37:18,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-01-27 15:37:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:37:18,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-01-27 15:37:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2024-01-27 15:37:18,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:37:18,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 120 transitions, 1121 flow. Second operand has 30 states, 30 states have (on average 6.333333333333333) internal successors, (190), 30 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:18,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:37:18,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:37:18,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:37:20,182 INFO L124 PetriNetUnfolderBase]: 1241/1818 cut-off events. [2024-01-27 15:37:20,182 INFO L125 PetriNetUnfolderBase]: For 7783/7783 co-relation queries the response was YES. [2024-01-27 15:37:20,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8671 conditions, 1818 events. 1241/1818 cut-off events. For 7783/7783 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7190 event pairs, 90 based on Foata normal form. 1/1819 useless extension candidates. Maximal degree in co-relation 8600. Up to 1335 conditions per place. [2024-01-27 15:37:20,194 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 101 selfloop transitions, 78 changer transitions 1/181 dead transitions. [2024-01-27 15:37:20,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 181 transitions, 1768 flow [2024-01-27 15:37:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:37:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:37:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 170 transitions. [2024-01-27 15:37:20,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2024-01-27 15:37:20,197 INFO L175 Difference]: Start difference. First operand has 96 places, 120 transitions, 1121 flow. Second operand 15 states and 170 transitions. [2024-01-27 15:37:20,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 181 transitions, 1768 flow [2024-01-27 15:37:20,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 181 transitions, 1684 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-01-27 15:37:20,215 INFO L231 Difference]: Finished difference. Result has 108 places, 130 transitions, 1357 flow [2024-01-27 15:37:20,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1357, PETRI_PLACES=108, PETRI_TRANSITIONS=130} [2024-01-27 15:37:20,216 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2024-01-27 15:37:20,216 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 130 transitions, 1357 flow [2024-01-27 15:37:20,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.333333333333333) internal successors, (190), 30 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:20,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:37:20,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:37:20,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-01-27 15:37:20,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-27 15:37:20,428 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 1 more)] === [2024-01-27 15:37:20,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:37:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash 836351564, now seen corresponding path program 6 times [2024-01-27 15:37:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:37:20,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616361741] [2024-01-27 15:37:20,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:37:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:37:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:37:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:37:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:37:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616361741] [2024-01-27 15:37:21,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616361741] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:37:21,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035457000] [2024-01-27 15:37:21,243 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:37:21,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:37:21,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:37:21,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:37:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-27 15:37:21,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 15:37:21,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:37:21,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 39 conjunts are in the unsatisfiable core [2024-01-27 15:37:21,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:37:21,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:37:21,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-01-27 15:37:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:37:21,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:37:22,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:37:22,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 17 [2024-01-27 15:37:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:37:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035457000] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:37:22,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:37:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 22 [2024-01-27 15:37:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879962161] [2024-01-27 15:37:22,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:37:22,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-27 15:37:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:37:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-27 15:37:22,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-01-27 15:37:22,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:37:22,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 130 transitions, 1357 flow. Second operand has 23 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:22,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:37:22,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:37:22,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:37:23,615 INFO L124 PetriNetUnfolderBase]: 1331/1951 cut-off events. [2024-01-27 15:37:23,616 INFO L125 PetriNetUnfolderBase]: For 9634/9634 co-relation queries the response was YES. [2024-01-27 15:37:23,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9860 conditions, 1951 events. 1331/1951 cut-off events. For 9634/9634 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7783 event pairs, 176 based on Foata normal form. 1/1952 useless extension candidates. Maximal degree in co-relation 9785. Up to 1606 conditions per place. [2024-01-27 15:37:23,655 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 111 selfloop transitions, 72 changer transitions 1/185 dead transitions. [2024-01-27 15:37:23,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 185 transitions, 2021 flow [2024-01-27 15:37:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:37:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:37:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2024-01-27 15:37:23,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2024-01-27 15:37:23,658 INFO L175 Difference]: Start difference. First operand has 108 places, 130 transitions, 1357 flow. Second operand 13 states and 154 transitions. [2024-01-27 15:37:23,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 185 transitions, 2021 flow [2024-01-27 15:37:23,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 185 transitions, 1825 flow, removed 54 selfloop flow, removed 10 redundant places. [2024-01-27 15:37:23,684 INFO L231 Difference]: Finished difference. Result has 114 places, 142 transitions, 1543 flow [2024-01-27 15:37:23,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1543, PETRI_PLACES=114, PETRI_TRANSITIONS=142} [2024-01-27 15:37:23,685 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 81 predicate places. [2024-01-27 15:37:23,685 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 142 transitions, 1543 flow [2024-01-27 15:37:23,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:23,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:37:23,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:37:23,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-27 15:37:23,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-01-27 15:37:23,896 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 1 more)] === [2024-01-27 15:37:23,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:37:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1438899892, now seen corresponding path program 7 times [2024-01-27 15:37:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:37:23,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901990839] [2024-01-27 15:37:23,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:37:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:37:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:37:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:37:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:37:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901990839] [2024-01-27 15:37:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901990839] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:37:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136749392] [2024-01-27 15:37:24,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:37:24,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:37:24,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:37:24,783 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:37:24,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-27 15:37:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:37:24,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2024-01-27 15:37:24,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:37:25,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:37:25,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2024-01-27 15:37:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:37:25,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:33,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:33,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 17 [2024-01-27 15:38:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136749392] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:33,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:38:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 23 [2024-01-27 15:38:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547917962] [2024-01-27 15:38:33,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:33,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-27 15:38:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:38:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-27 15:38:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=450, Unknown=15, NotChecked=0, Total=552 [2024-01-27 15:38:33,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:38:33,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 142 transitions, 1543 flow. Second operand has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:33,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:33,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:38:33,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:35,250 INFO L124 PetriNetUnfolderBase]: 1391/2040 cut-off events. [2024-01-27 15:38:35,250 INFO L125 PetriNetUnfolderBase]: For 10417/10417 co-relation queries the response was YES. [2024-01-27 15:38:35,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10456 conditions, 2040 events. 1391/2040 cut-off events. For 10417/10417 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8236 event pairs, 184 based on Foata normal form. 1/2041 useless extension candidates. Maximal degree in co-relation 10376. Up to 1695 conditions per place. [2024-01-27 15:38:35,259 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 116 selfloop transitions, 74 changer transitions 1/192 dead transitions. [2024-01-27 15:38:35,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 192 transitions, 2132 flow [2024-01-27 15:38:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:38:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:38:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2024-01-27 15:38:35,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-01-27 15:38:35,261 INFO L175 Difference]: Start difference. First operand has 114 places, 142 transitions, 1543 flow. Second operand 13 states and 156 transitions. [2024-01-27 15:38:35,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 192 transitions, 2132 flow [2024-01-27 15:38:35,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 192 transitions, 1954 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-01-27 15:38:35,278 INFO L231 Difference]: Finished difference. Result has 121 places, 147 transitions, 1613 flow [2024-01-27 15:38:35,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1613, PETRI_PLACES=121, PETRI_TRANSITIONS=147} [2024-01-27 15:38:35,278 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 88 predicate places. [2024-01-27 15:38:35,278 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 147 transitions, 1613 flow [2024-01-27 15:38:35,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:35,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:35,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:35,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:35,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-01-27 15:38:35,489 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 1 more)] === [2024-01-27 15:38:35,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1015035542, now seen corresponding path program 8 times [2024-01-27 15:38:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:38:35,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835395716] [2024-01-27 15:38:35,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:38:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:38:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:38:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835395716] [2024-01-27 15:38:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835395716] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:38:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300565180] [2024-01-27 15:38:36,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:38:36,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:38:36,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:38:36,242 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:38:36,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-01-27 15:38:36,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:38:36,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:36,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 48 conjunts are in the unsatisfiable core [2024-01-27 15:38:36,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:36,406 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-01-27 15:38:36,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:38:36,454 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-01-27 15:38:36,835 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-01-27 15:38:36,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-01-27 15:38:37,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:37,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2024-01-27 15:38:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:37,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:38,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:38,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 40 [2024-01-27 15:38:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300565180] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:38,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:38:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2024-01-27 15:38:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537494415] [2024-01-27 15:38:38,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:38,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-27 15:38:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:38:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-27 15:38:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-01-27 15:38:38,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:38:38,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 147 transitions, 1613 flow. Second operand has 25 states, 25 states have (on average 6.4) internal successors, (160), 25 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:38,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:38,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:38:38,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:40,096 INFO L124 PetriNetUnfolderBase]: 1535/2249 cut-off events. [2024-01-27 15:38:40,096 INFO L125 PetriNetUnfolderBase]: For 13090/13090 co-relation queries the response was YES. [2024-01-27 15:38:40,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11501 conditions, 2249 events. 1535/2249 cut-off events. For 13090/13090 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9304 event pairs, 184 based on Foata normal form. 1/2250 useless extension candidates. Maximal degree in co-relation 11419. Up to 1824 conditions per place. [2024-01-27 15:38:40,106 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 119 selfloop transitions, 78 changer transitions 1/199 dead transitions. [2024-01-27 15:38:40,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 199 transitions, 2290 flow [2024-01-27 15:38:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:38:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:38:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2024-01-27 15:38:40,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2024-01-27 15:38:40,107 INFO L175 Difference]: Start difference. First operand has 121 places, 147 transitions, 1613 flow. Second operand 13 states and 154 transitions. [2024-01-27 15:38:40,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 199 transitions, 2290 flow [2024-01-27 15:38:40,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 199 transitions, 2082 flow, removed 30 selfloop flow, removed 12 redundant places. [2024-01-27 15:38:40,135 INFO L231 Difference]: Finished difference. Result has 123 places, 157 transitions, 1747 flow [2024-01-27 15:38:40,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1747, PETRI_PLACES=123, PETRI_TRANSITIONS=157} [2024-01-27 15:38:40,136 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 90 predicate places. [2024-01-27 15:38:40,136 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 157 transitions, 1747 flow [2024-01-27 15:38:40,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.4) internal successors, (160), 25 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:40,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:40,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:40,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:40,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 15:38:40,344 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:40,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -141647496, now seen corresponding path program 9 times [2024-01-27 15:38:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:38:40,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821424012] [2024-01-27 15:38:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:38:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:38:41,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:38:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821424012] [2024-01-27 15:38:41,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821424012] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:38:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215769768] [2024-01-27 15:38:41,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:38:41,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:38:41,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:38:41,246 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:38:41,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-01-27 15:38:41,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:38:41,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:41,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 48 conjunts are in the unsatisfiable core [2024-01-27 15:38:41,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:41,414 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-01-27 15:38:41,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:38:41,457 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-01-27 15:38:41,851 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-01-27 15:38:41,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-01-27 15:38:42,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:42,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2024-01-27 15:38:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:42,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:48,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:48,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 40 [2024-01-27 15:38:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215769768] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:48,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:38:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2024-01-27 15:38:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128870242] [2024-01-27 15:38:48,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-27 15:38:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:38:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-27 15:38:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-01-27 15:38:48,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:38:48,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 157 transitions, 1747 flow. Second operand has 25 states, 25 states have (on average 6.4) internal successors, (160), 25 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:48,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:48,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:38:48,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:50,208 INFO L124 PetriNetUnfolderBase]: 1623/2378 cut-off events. [2024-01-27 15:38:50,208 INFO L125 PetriNetUnfolderBase]: For 14588/14588 co-relation queries the response was YES. [2024-01-27 15:38:50,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12316 conditions, 2378 events. 1623/2378 cut-off events. For 14588/14588 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10003 event pairs, 218 based on Foata normal form. 1/2379 useless extension candidates. Maximal degree in co-relation 12234. Up to 2037 conditions per place. [2024-01-27 15:38:50,249 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 130 selfloop transitions, 72 changer transitions 1/204 dead transitions. [2024-01-27 15:38:50,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 204 transitions, 2391 flow [2024-01-27 15:38:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:38:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:38:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2024-01-27 15:38:50,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3543123543123543 [2024-01-27 15:38:50,251 INFO L175 Difference]: Start difference. First operand has 123 places, 157 transitions, 1747 flow. Second operand 13 states and 152 transitions. [2024-01-27 15:38:50,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 204 transitions, 2391 flow [2024-01-27 15:38:50,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 204 transitions, 2159 flow, removed 74 selfloop flow, removed 8 redundant places. [2024-01-27 15:38:50,287 INFO L231 Difference]: Finished difference. Result has 129 places, 163 transitions, 1802 flow [2024-01-27 15:38:50,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1802, PETRI_PLACES=129, PETRI_TRANSITIONS=163} [2024-01-27 15:38:50,289 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2024-01-27 15:38:50,289 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 163 transitions, 1802 flow [2024-01-27 15:38:50,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.4) internal successors, (160), 25 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:50,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:50,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:50,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:50,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-27 15:38:50,492 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:50,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1442847502, now seen corresponding path program 10 times [2024-01-27 15:38:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:38:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164257060] [2024-01-27 15:38:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:38:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:51,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:38:51,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164257060] [2024-01-27 15:38:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164257060] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:38:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444875289] [2024-01-27 15:38:51,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:38:51,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:38:51,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:38:51,521 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:38:51,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-01-27 15:38:51,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:38:51,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:51,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2024-01-27 15:38:51,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:51,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:51,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2024-01-27 15:38:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:51,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:39:12,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:39:12,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2024-01-27 15:39:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444875289] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:39:12,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:39:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2024-01-27 15:39:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562937750] [2024-01-27 15:39:12,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:39:12,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-27 15:39:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:39:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-27 15:39:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=503, Unknown=5, NotChecked=0, Total=600 [2024-01-27 15:39:12,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:39:12,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 163 transitions, 1802 flow. Second operand has 25 states, 25 states have (on average 6.96) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:39:12,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:12,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:39:12,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:14,474 INFO L124 PetriNetUnfolderBase]: 1872/2742 cut-off events. [2024-01-27 15:39:14,474 INFO L125 PetriNetUnfolderBase]: For 19265/19265 co-relation queries the response was YES. [2024-01-27 15:39:14,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14683 conditions, 2742 events. 1872/2742 cut-off events. For 19265/19265 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11773 event pairs, 532 based on Foata normal form. 1/2743 useless extension candidates. Maximal degree in co-relation 14598. Up to 2396 conditions per place. [2024-01-27 15:39:14,487 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 165 selfloop transitions, 71 changer transitions 1/238 dead transitions. [2024-01-27 15:39:14,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 238 transitions, 2945 flow [2024-01-27 15:39:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:39:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:39:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 162 transitions. [2024-01-27 15:39:14,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-01-27 15:39:14,488 INFO L175 Difference]: Start difference. First operand has 129 places, 163 transitions, 1802 flow. Second operand 15 states and 162 transitions. [2024-01-27 15:39:14,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 238 transitions, 2945 flow [2024-01-27 15:39:14,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 238 transitions, 2705 flow, removed 30 selfloop flow, removed 10 redundant places. [2024-01-27 15:39:14,517 INFO L231 Difference]: Finished difference. Result has 137 places, 194 transitions, 2326 flow [2024-01-27 15:39:14,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2326, PETRI_PLACES=137, PETRI_TRANSITIONS=194} [2024-01-27 15:39:14,518 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2024-01-27 15:39:14,518 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 194 transitions, 2326 flow [2024-01-27 15:39:14,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.96) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:39:14,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:14,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:14,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-01-27 15:39:14,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-01-27 15:39:14,732 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:39:14,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -345359474, now seen corresponding path program 11 times [2024-01-27 15:39:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:39:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663946231] [2024-01-27 15:39:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:39:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:39:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:39:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663946231] [2024-01-27 15:39:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663946231] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:39:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048091840] [2024-01-27 15:39:15,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:39:15,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:39:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:39:15,556 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:39:15,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-01-27 15:39:15,694 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:39:15,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:39:15,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 39 conjunts are in the unsatisfiable core [2024-01-27 15:39:15,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:16,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:39:16,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-01-27 15:39:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:16,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:39:16,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:39:16,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2024-01-27 15:39:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048091840] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:39:16,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:39:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 21 [2024-01-27 15:39:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786686470] [2024-01-27 15:39:16,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:39:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:39:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:39:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:39:16,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-01-27 15:39:16,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:39:16,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 194 transitions, 2326 flow. Second operand has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 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-01-27 15:39:16,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:16,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:39:16,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:18,064 INFO L124 PetriNetUnfolderBase]: 2066/3027 cut-off events. [2024-01-27 15:39:18,064 INFO L125 PetriNetUnfolderBase]: For 25538/25538 co-relation queries the response was YES. [2024-01-27 15:39:18,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16710 conditions, 3027 events. 2066/3027 cut-off events. For 25538/25538 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13299 event pairs, 608 based on Foata normal form. 1/3028 useless extension candidates. Maximal degree in co-relation 16621. Up to 2747 conditions per place. [2024-01-27 15:39:18,078 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 191 selfloop transitions, 59 changer transitions 1/252 dead transitions. [2024-01-27 15:39:18,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 252 transitions, 3252 flow [2024-01-27 15:39:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:39:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:39:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2024-01-27 15:39:18,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2024-01-27 15:39:18,080 INFO L175 Difference]: Start difference. First operand has 137 places, 194 transitions, 2326 flow. Second operand 13 states and 154 transitions. [2024-01-27 15:39:18,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 252 transitions, 3252 flow [2024-01-27 15:39:18,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 252 transitions, 3055 flow, removed 88 selfloop flow, removed 7 redundant places. [2024-01-27 15:39:18,121 INFO L231 Difference]: Finished difference. Result has 146 places, 208 transitions, 2578 flow [2024-01-27 15:39:18,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2578, PETRI_PLACES=146, PETRI_TRANSITIONS=208} [2024-01-27 15:39:18,121 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 113 predicate places. [2024-01-27 15:39:18,122 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 208 transitions, 2578 flow [2024-01-27 15:39:18,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 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-01-27 15:39:18,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:18,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:18,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-01-27 15:39:18,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:39:18,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:39:18,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1646583540, now seen corresponding path program 12 times [2024-01-27 15:39:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:39:18,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216726096] [2024-01-27 15:39:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:39:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:39:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:39:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216726096] [2024-01-27 15:39:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216726096] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:39:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836971615] [2024-01-27 15:39:19,102 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:39:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:39:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:39:19,103 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:39:19,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-01-27 15:39:19,239 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 15:39:19,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:39:19,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2024-01-27 15:39:19,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:19,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:39:19,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-01-27 15:39:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:19,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:39:19,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:39:19,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2024-01-27 15:39:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:20,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836971615] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:39:20,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:39:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 7] total 21 [2024-01-27 15:39:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165955119] [2024-01-27 15:39:20,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:39:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:39:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:39:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:39:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-01-27 15:39:20,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:39:20,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 208 transitions, 2578 flow. Second operand has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 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-01-27 15:39:20,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:20,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:39:20,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:21,900 INFO L124 PetriNetUnfolderBase]: 2232/3272 cut-off events. [2024-01-27 15:39:21,901 INFO L125 PetriNetUnfolderBase]: For 29105/29105 co-relation queries the response was YES. [2024-01-27 15:39:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18160 conditions, 3272 events. 2232/3272 cut-off events. For 29105/29105 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14699 event pairs, 672 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 18066. Up to 2958 conditions per place. [2024-01-27 15:39:21,918 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 202 selfloop transitions, 67 changer transitions 1/271 dead transitions. [2024-01-27 15:39:21,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 271 transitions, 3604 flow [2024-01-27 15:39:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:39:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:39:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2024-01-27 15:39:21,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-01-27 15:39:21,919 INFO L175 Difference]: Start difference. First operand has 146 places, 208 transitions, 2578 flow. Second operand 13 states and 156 transitions. [2024-01-27 15:39:21,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 271 transitions, 3604 flow [2024-01-27 15:39:21,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 271 transitions, 3364 flow, removed 108 selfloop flow, removed 5 redundant places. [2024-01-27 15:39:21,971 INFO L231 Difference]: Finished difference. Result has 156 places, 225 transitions, 2867 flow [2024-01-27 15:39:21,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2867, PETRI_PLACES=156, PETRI_TRANSITIONS=225} [2024-01-27 15:39:21,972 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 123 predicate places. [2024-01-27 15:39:21,972 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 225 transitions, 2867 flow [2024-01-27 15:39:21,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 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-01-27 15:39:21,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:21,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:21,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-01-27 15:39:22,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:39:22,177 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:39:22,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1539975762, now seen corresponding path program 13 times [2024-01-27 15:39:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:39:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393253291] [2024-01-27 15:39:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:39:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:39:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:39:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393253291] [2024-01-27 15:39:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393253291] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:39:22,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857763793] [2024-01-27 15:39:22,959 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:39:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:39:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:39:22,960 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:39:22,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-01-27 15:39:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:23,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2024-01-27 15:39:23,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:23,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:39:23,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24 [2024-01-27 15:39:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:23,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:40:24,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:40:24,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2024-01-27 15:40:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:40:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857763793] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:40:24,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:40:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 23 [2024-01-27 15:40:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624482734] [2024-01-27 15:40:24,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:40:24,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-27 15:40:24,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:40:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-27 15:40:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=446, Unknown=15, NotChecked=0, Total=552 [2024-01-27 15:40:24,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:40:24,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 225 transitions, 2867 flow. Second operand has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:24,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:40:24,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:40:24,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:40:28,276 INFO L124 PetriNetUnfolderBase]: 2332/3419 cut-off events. [2024-01-27 15:40:28,276 INFO L125 PetriNetUnfolderBase]: For 30896/30896 co-relation queries the response was YES. [2024-01-27 15:40:28,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18619 conditions, 3419 events. 2332/3419 cut-off events. For 30896/30896 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15512 event pairs, 728 based on Foata normal form. 1/3420 useless extension candidates. Maximal degree in co-relation 18521. Up to 3213 conditions per place. [2024-01-27 15:40:28,291 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 210 selfloop transitions, 59 changer transitions 1/271 dead transitions. [2024-01-27 15:40:28,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 271 transitions, 3666 flow [2024-01-27 15:40:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:40:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:40:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-01-27 15:40:28,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34032634032634035 [2024-01-27 15:40:28,292 INFO L175 Difference]: Start difference. First operand has 156 places, 225 transitions, 2867 flow. Second operand 13 states and 146 transitions. [2024-01-27 15:40:28,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 271 transitions, 3666 flow [2024-01-27 15:40:28,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 271 transitions, 3382 flow, removed 113 selfloop flow, removed 7 redundant places. [2024-01-27 15:40:28,336 INFO L231 Difference]: Finished difference. Result has 164 places, 235 transitions, 2882 flow [2024-01-27 15:40:28,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2882, PETRI_PLACES=164, PETRI_TRANSITIONS=235} [2024-01-27 15:40:28,336 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 131 predicate places. [2024-01-27 15:40:28,336 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 235 transitions, 2882 flow [2024-01-27 15:40:28,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:28,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:28,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:40:28,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-01-27 15:40:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:28,538 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:40:28,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1584981072, now seen corresponding path program 14 times [2024-01-27 15:40:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:40:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726207219] [2024-01-27 15:40:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:40:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:40:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:40:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726207219] [2024-01-27 15:40:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726207219] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:40:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245759207] [2024-01-27 15:40:29,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:40:29,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:29,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:40:29,959 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:40:29,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-01-27 15:40:30,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:40:30,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:40:30,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 51 conjunts are in the unsatisfiable core [2024-01-27 15:40:30,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:30,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2024-01-27 15:40:30,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:40:30,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:40:30,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:40:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:40:30,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:40:30,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:40:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:40:30,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:40:30,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:40:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:40:30,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:40:30,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:40:30,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:40:30,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:40:30,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 1 [2024-01-27 15:40:30,630 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-01-27 15:40:30,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-01-27 15:40:30,779 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:40:30,779 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-01-27 15:40:31,520 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-01-27 15:40:31,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-01-27 15:40:31,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:40:31,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 94 [2024-01-27 15:40:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:40:32,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:40:32,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:40:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2024-01-27 15:40:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:40:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245759207] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:40:34,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:40:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-01-27 15:40:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352223378] [2024-01-27 15:40:34,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:40:34,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-01-27 15:40:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:40:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-01-27 15:40:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-01-27 15:40:34,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:40:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 235 transitions, 2882 flow. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 27 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:40:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:40:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:40:38,339 INFO L124 PetriNetUnfolderBase]: 2412/3536 cut-off events. [2024-01-27 15:40:38,339 INFO L125 PetriNetUnfolderBase]: For 31319/31319 co-relation queries the response was YES. [2024-01-27 15:40:38,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18840 conditions, 3536 events. 2412/3536 cut-off events. For 31319/31319 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16132 event pairs, 772 based on Foata normal form. 1/3537 useless extension candidates. Maximal degree in co-relation 18738. Up to 3344 conditions per place. [2024-01-27 15:40:38,358 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 213 selfloop transitions, 58 changer transitions 1/273 dead transitions. [2024-01-27 15:40:38,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 273 transitions, 3692 flow [2024-01-27 15:40:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-27 15:40:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-01-27 15:40:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2024-01-27 15:40:38,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31385281385281383 [2024-01-27 15:40:38,360 INFO L175 Difference]: Start difference. First operand has 164 places, 235 transitions, 2882 flow. Second operand 14 states and 145 transitions. [2024-01-27 15:40:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 273 transitions, 3692 flow [2024-01-27 15:40:38,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 273 transitions, 3488 flow, removed 48 selfloop flow, removed 9 redundant places. [2024-01-27 15:40:38,441 INFO L231 Difference]: Finished difference. Result has 170 places, 241 transitions, 2978 flow [2024-01-27 15:40:38,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2978, PETRI_PLACES=170, PETRI_TRANSITIONS=241} [2024-01-27 15:40:38,442 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 137 predicate places. [2024-01-27 15:40:38,442 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 241 transitions, 2978 flow [2024-01-27 15:40:38,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 27 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:38,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:38,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:40:38,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-01-27 15:40:38,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:38,650 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:40:38,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 756026548, now seen corresponding path program 15 times [2024-01-27 15:40:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:40:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62068462] [2024-01-27 15:40:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:40:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:40:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:40:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62068462] [2024-01-27 15:40:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62068462] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:40:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917870919] [2024-01-27 15:40:40,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:40:40,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:40:40,310 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:40:40,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-01-27 15:40:40,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:40:40,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:40:40,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2024-01-27 15:40:40,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:41,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:40:41,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2024-01-27 15:40:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:40:41,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:40:42,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:40:42,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 87 [2024-01-27 15:40:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:40:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917870919] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:40:42,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:40:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 25 [2024-01-27 15:40:42,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025369810] [2024-01-27 15:40:42,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:40:42,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-01-27 15:40:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:40:42,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-01-27 15:40:42,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2024-01-27 15:40:42,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:40:42,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 241 transitions, 2978 flow. Second operand has 26 states, 26 states have (on average 6.576923076923077) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:42,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:40:42,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:40:42,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:40:47,204 INFO L124 PetriNetUnfolderBase]: 2502/3669 cut-off events. [2024-01-27 15:40:47,204 INFO L125 PetriNetUnfolderBase]: For 34062/34062 co-relation queries the response was YES. [2024-01-27 15:40:47,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19500 conditions, 3669 events. 2502/3669 cut-off events. For 34062/34062 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16931 event pairs, 792 based on Foata normal form. 1/3670 useless extension candidates. Maximal degree in co-relation 19397. Up to 3447 conditions per place. [2024-01-27 15:40:47,222 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 222 selfloop transitions, 64 changer transitions 1/288 dead transitions. [2024-01-27 15:40:47,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 288 transitions, 3803 flow [2024-01-27 15:40:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:40:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:40:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2024-01-27 15:40:47,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3191919191919192 [2024-01-27 15:40:47,223 INFO L175 Difference]: Start difference. First operand has 170 places, 241 transitions, 2978 flow. Second operand 15 states and 158 transitions. [2024-01-27 15:40:47,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 288 transitions, 3803 flow [2024-01-27 15:40:47,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 288 transitions, 3591 flow, removed 72 selfloop flow, removed 10 redundant places. [2024-01-27 15:40:47,277 INFO L231 Difference]: Finished difference. Result has 177 places, 248 transitions, 3062 flow [2024-01-27 15:40:47,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3062, PETRI_PLACES=177, PETRI_TRANSITIONS=248} [2024-01-27 15:40:47,277 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 144 predicate places. [2024-01-27 15:40:47,277 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 248 transitions, 3062 flow [2024-01-27 15:40:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.576923076923077) internal successors, (171), 26 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:47,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:47,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:40:47,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-01-27 15:40:47,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:47,478 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:40:47,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 929589454, now seen corresponding path program 16 times [2024-01-27 15:40:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:40:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140269046] [2024-01-27 15:40:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:40:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:40:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:40:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140269046] [2024-01-27 15:40:48,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140269046] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:40:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586372973] [2024-01-27 15:40:48,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:40:48,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:48,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:40:48,919 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:40:48,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-01-27 15:40:49,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:40:49,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:40:49,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 40 conjunts are in the unsatisfiable core [2024-01-27 15:40:49,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:49,144 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-01-27 15:40:49,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:40:49,289 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-01-27 15:40:50,175 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-01-27 15:40:50,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-01-27 15:40:50,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-01-27 15:40:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:40:50,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:40:52,570 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-01-27 15:40:52,572 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-01-27 15:40:52,573 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:40:52,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-01-27 15:40:52,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:52,774 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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) 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) ... 46 more [2024-01-27 15:40:52,778 INFO L158 Benchmark]: Toolchain (without parser) took 336788.85ms. Allocated memory was 146.8MB in the beginning and 415.2MB in the end (delta: 268.4MB). Free memory was 74.4MB in the beginning and 190.6MB in the end (delta: -116.2MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB. [2024-01-27 15:40:52,778 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:40:52,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.15ms. Allocated memory is still 146.8MB. Free memory was 74.3MB in the beginning and 116.5MB in the end (delta: -42.2MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-01-27 15:40:52,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.67ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 116.4MB in the beginning and 202.8MB in the end (delta: -86.4MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-01-27 15:40:52,778 INFO L158 Benchmark]: Boogie Preprocessor took 42.24ms. Allocated memory is still 232.8MB. Free memory was 202.8MB in the beginning and 199.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:40:52,778 INFO L158 Benchmark]: RCFGBuilder took 745.92ms. Allocated memory is still 232.8MB. Free memory was 199.7MB in the beginning and 103.2MB in the end (delta: 96.5MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-01-27 15:40:52,778 INFO L158 Benchmark]: TraceAbstraction took 335686.88ms. Allocated memory was 232.8MB in the beginning and 415.2MB in the end (delta: 182.5MB). Free memory was 103.2MB in the beginning and 190.6MB in the end (delta: -87.4MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2024-01-27 15:40:52,779 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.14ms. Allocated memory is still 146.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.15ms. Allocated memory is still 146.8MB. Free memory was 74.3MB in the beginning and 116.5MB in the end (delta: -42.2MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.67ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 116.4MB in the beginning and 202.8MB in the end (delta: -86.4MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.24ms. Allocated memory is still 232.8MB. Free memory was 202.8MB in the beginning and 199.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 745.92ms. Allocated memory is still 232.8MB. Free memory was 199.7MB in the beginning and 103.2MB in the end (delta: 96.5MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 335686.88ms. Allocated memory was 232.8MB in the beginning and 415.2MB in the end (delta: 182.5MB). Free memory was 103.2MB in the beginning and 190.6MB in the end (delta: -87.4MB). Peak memory consumption was 95.9MB. 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-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:40:54,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:40:54,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:40:54,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:40:54,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:40:54,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:40:54,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:40:54,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:40:54,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:40:54,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:40:54,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:40:54,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:40:54,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:40:54,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:40:54,518 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:40:54,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:40:54,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:40:54,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:40:54,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:40:54,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:40:54,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:40:54,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:40:54,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:40:54,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:40:54,520 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:40:54,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:40:54,520 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:40:54,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:40:54,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:40:54,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:40:54,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:40:54,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:40:54,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:40:54,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:40:54,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:40:54,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:40:54,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:40:54,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:40:54,522 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:40:54,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:40:54,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:40:54,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:40:54,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:40:54,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:40:54,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:40:54,523 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:40:54,523 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-01-27 15:40:54,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:40:54,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:40:54,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:40:54,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:40:54,821 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:40:54,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-01-27 15:40:55,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:40:56,108 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:40:56,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-01-27 15:40:56,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1927378e9/5a663840da3b4e8fbcb788e7dd4b121f/FLAG45b5578b7 [2024-01-27 15:40:56,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1927378e9/5a663840da3b4e8fbcb788e7dd4b121f [2024-01-27 15:40:56,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:40:56,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:40:56,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:40:56,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:40:56,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:40:56,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab259a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56, skipping insertion in model container [2024-01-27 15:40:56,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:40:56,330 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-01-27 15:40:56,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:40:56,366 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:40:56,373 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:40:56,392 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-01-27 15:40:56,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:40:56,403 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:40:56,435 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-01-27 15:40:56,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:40:56,456 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:40:56,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56 WrapperNode [2024-01-27 15:40:56,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:40:56,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:40:56,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:40:56,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:40:56,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,519 INFO L138 Inliner]: procedures = 28, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 274 [2024-01-27 15:40:56,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:40:56,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:40:56,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:40:56,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:40:56,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,566 INFO L175 MemorySlicer]: Split 17 memory accesses to 5 slices as follows [2, 2, 2, 2, 9]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 4]. [2024-01-27 15:40:56,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:40:56,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:40:56,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:40:56,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:40:56,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (1/1) ... [2024-01-27 15:40:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:40:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:40:56,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:40:56,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:40:56,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:40:56,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:40:56,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:40:56,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:40:56,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:40:56,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-01-27 15:40:56,683 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:40:56,782 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:40:56,784 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:40:57,168 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:40:57,168 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:40:57,481 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:40:57,481 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:40:57,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:40:57 BoogieIcfgContainer [2024-01-27 15:40:57,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:40:57,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:40:57,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:40:57,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:40:57,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:40:56" (1/3) ... [2024-01-27 15:40:57,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e36e610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:40:57, skipping insertion in model container [2024-01-27 15:40:57,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:40:56" (2/3) ... [2024-01-27 15:40:57,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e36e610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:40:57, skipping insertion in model container [2024-01-27 15:40:57,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:40:57" (3/3) ... [2024-01-27 15:40:57,491 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-01-27 15:40:57,498 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:40:57,506 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:40:57,506 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:40:57,506 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:40:57,571 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:40:57,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 87 flow [2024-01-27 15:40:57,622 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2024-01-27 15:40:57,623 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:40:57,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 6/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-01-27 15:40:57,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 33 transitions, 87 flow [2024-01-27 15:40:57,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 29 transitions, 76 flow [2024-01-27 15:40:57,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:40:57,650 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;@3fb854d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:40:57,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:40:57,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:40:57,664 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-01-27 15:40:57,664 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:40:57,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:57,664 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] [2024-01-27 15:40:57,665 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 1 more)] === [2024-01-27 15:40:57,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2041293473, now seen corresponding path program 1 times [2024-01-27 15:40:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:40:57,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588551423] [2024-01-27 15:40:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:57,680 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-01-27 15:40:57,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:40:57,682 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-01-27 15:40:57,700 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-01-27 15:40:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:57,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:40:57,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:40:58,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:40:58,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:40:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588551423] [2024-01-27 15:40:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588551423] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:40:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:40:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:40:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362969329] [2024-01-27 15:40:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:40:58,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:40:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:40:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:40:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:40:58,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:40:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:58,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:40:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:40:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:40:58,318 INFO L124 PetriNetUnfolderBase]: 431/637 cut-off events. [2024-01-27 15:40:58,319 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-01-27 15:40:58,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 637 events. 431/637 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1984 event pairs, 138 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 1030. Up to 389 conditions per place. [2024-01-27 15:40:58,323 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 42 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2024-01-27 15:40:58,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 223 flow [2024-01-27 15:40:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:40:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:40:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-01-27 15:40:58,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-01-27 15:40:58,339 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-01-27 15:40:58,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 223 flow [2024-01-27 15:40:58,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 48 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:40:58,348 INFO L231 Difference]: Finished difference. Result has 30 places, 32 transitions, 90 flow [2024-01-27 15:40:58,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=32} [2024-01-27 15:40:58,352 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2024-01-27 15:40:58,353 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 32 transitions, 90 flow [2024-01-27 15:40:58,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:58,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:58,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:40:58,375 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 (2)] Ended with exit code 0 [2024-01-27 15:40:58,557 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-01-27 15:40:58,557 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 1 more)] === [2024-01-27 15:40:58,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1559193806, now seen corresponding path program 1 times [2024-01-27 15:40:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:40:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131489858] [2024-01-27 15:40:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:58,558 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-01-27 15:40:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:40:58,559 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-01-27 15:40:58,568 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-01-27 15:40:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:58,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:40:58,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:40:58,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:40:58,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:40:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131489858] [2024-01-27 15:40:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131489858] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:40:58,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:40:58,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:40:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918157203] [2024-01-27 15:40:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:40:58,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:40:58,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:40:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:40:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:40:58,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:40:58,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 32 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:58,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:40:58,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:40:58,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:40:59,476 INFO L124 PetriNetUnfolderBase]: 569/819 cut-off events. [2024-01-27 15:40:59,476 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-01-27 15:40:59,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 819 events. 569/819 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2675 event pairs, 231 based on Foata normal form. 12/828 useless extension candidates. Maximal degree in co-relation 593. Up to 607 conditions per place. [2024-01-27 15:40:59,480 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 54 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2024-01-27 15:40:59,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 68 transitions, 332 flow [2024-01-27 15:40:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:40:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:40:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-01-27 15:40:59,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-01-27 15:40:59,482 INFO L175 Difference]: Start difference. First operand has 30 places, 32 transitions, 90 flow. Second operand 6 states and 83 transitions. [2024-01-27 15:40:59,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 68 transitions, 332 flow [2024-01-27 15:40:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 68 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:40:59,484 INFO L231 Difference]: Finished difference. Result has 36 places, 42 transitions, 168 flow [2024-01-27 15:40:59,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=36, PETRI_TRANSITIONS=42} [2024-01-27 15:40:59,485 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-01-27 15:40:59,485 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 42 transitions, 168 flow [2024-01-27 15:40:59,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:59,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:59,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:40:59,491 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 (3)] Ended with exit code 0 [2024-01-27 15:40:59,688 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-01-27 15:40:59,689 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 1 more)] === [2024-01-27 15:40:59,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1075734955, now seen corresponding path program 1 times [2024-01-27 15:40:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:40:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504610863] [2024-01-27 15:40:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:59,690 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-01-27 15:40:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:40:59,691 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-01-27 15:40:59,692 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-01-27 15:40:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:59,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:40:59,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:40:59,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:40:59,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:40:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504610863] [2024-01-27 15:40:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504610863] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:40:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:40:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:40:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801594471] [2024-01-27 15:40:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:40:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:40:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:40:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:40:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:40:59,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:40:59,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 42 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:59,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:40:59,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:40:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:00,838 INFO L124 PetriNetUnfolderBase]: 672/989 cut-off events. [2024-01-27 15:41:00,839 INFO L125 PetriNetUnfolderBase]: For 703/703 co-relation queries the response was YES. [2024-01-27 15:41:00,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2938 conditions, 989 events. 672/989 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3663 event pairs, 158 based on Foata normal form. 22/1008 useless extension candidates. Maximal degree in co-relation 1099. Up to 411 conditions per place. [2024-01-27 15:41:00,843 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 71 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-01-27 15:41:00,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 461 flow [2024-01-27 15:41:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-01-27 15:41:00,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-01-27 15:41:00,846 INFO L175 Difference]: Start difference. First operand has 36 places, 42 transitions, 168 flow. Second operand 6 states and 92 transitions. [2024-01-27 15:41:00,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 461 flow [2024-01-27 15:41:00,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 83 transitions, 448 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-27 15:41:00,849 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 200 flow [2024-01-27 15:41:00,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2024-01-27 15:41:00,850 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2024-01-27 15:41:00,850 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 200 flow [2024-01-27 15:41:00,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:00,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:00,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:00,858 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-01-27 15:41:01,054 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-01-27 15:41:01,057 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 1 more)] === [2024-01-27 15:41:01,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1339926383, now seen corresponding path program 2 times [2024-01-27 15:41:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:01,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564747469] [2024-01-27 15:41:01,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:41:01,058 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-01-27 15:41:01,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:01,058 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-01-27 15:41:01,059 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-01-27 15:41:01,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:41:01,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:01,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:01,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:01,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:01,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564747469] [2024-01-27 15:41:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564747469] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:41:01,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:41:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 15:41:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204401081] [2024-01-27 15:41:01,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:41:01,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 15:41:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 15:41:01,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:41:01,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:01,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 200 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:01,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:01,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:01,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:03,269 INFO L124 PetriNetUnfolderBase]: 1271/1884 cut-off events. [2024-01-27 15:41:03,269 INFO L125 PetriNetUnfolderBase]: For 2367/2367 co-relation queries the response was YES. [2024-01-27 15:41:03,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6269 conditions, 1884 events. 1271/1884 cut-off events. For 2367/2367 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7880 event pairs, 196 based on Foata normal form. 82/1963 useless extension candidates. Maximal degree in co-relation 2040. Up to 613 conditions per place. [2024-01-27 15:41:03,277 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 133 selfloop transitions, 22 changer transitions 0/156 dead transitions. [2024-01-27 15:41:03,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 156 transitions, 996 flow [2024-01-27 15:41:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:41:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:41:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-01-27 15:41:03,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46831955922865015 [2024-01-27 15:41:03,282 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 200 flow. Second operand 11 states and 170 transitions. [2024-01-27 15:41:03,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 156 transitions, 996 flow [2024-01-27 15:41:03,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 156 transitions, 935 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:03,292 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 344 flow [2024-01-27 15:41:03,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=344, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2024-01-27 15:41:03,293 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2024-01-27 15:41:03,295 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 344 flow [2024-01-27 15:41:03,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:03,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:03,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:03,315 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-01-27 15:41:03,499 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-01-27 15:41:03,500 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 1 more)] === [2024-01-27 15:41:03,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -732420984, now seen corresponding path program 2 times [2024-01-27 15:41:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83992735] [2024-01-27 15:41:03,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:41:03,501 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-01-27 15:41:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:03,502 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-01-27 15:41:03,505 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-01-27 15:41:03,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:41:03,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:03,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:03,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:03,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:03,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:03,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83992735] [2024-01-27 15:41:03,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83992735] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:41:03,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:41:03,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 15:41:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035296129] [2024-01-27 15:41:03,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:41:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 15:41:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:03,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 15:41:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:41:03,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:03,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 344 flow. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 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-01-27 15:41:03,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:03,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:03,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:05,548 INFO L124 PetriNetUnfolderBase]: 2153/3215 cut-off events. [2024-01-27 15:41:05,549 INFO L125 PetriNetUnfolderBase]: For 13336/13336 co-relation queries the response was YES. [2024-01-27 15:41:05,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13783 conditions, 3215 events. 2153/3215 cut-off events. For 13336/13336 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15327 event pairs, 316 based on Foata normal form. 130/3342 useless extension candidates. Maximal degree in co-relation 8245. Up to 1202 conditions per place. [2024-01-27 15:41:05,565 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 218 selfloop transitions, 48 changer transitions 0/267 dead transitions. [2024-01-27 15:41:05,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 267 transitions, 2300 flow [2024-01-27 15:41:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:41:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:41:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-01-27 15:41:05,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738292011019284 [2024-01-27 15:41:05,568 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 344 flow. Second operand 11 states and 172 transitions. [2024-01-27 15:41:05,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 267 transitions, 2300 flow [2024-01-27 15:41:05,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 267 transitions, 1881 flow, removed 209 selfloop flow, removed 1 redundant places. [2024-01-27 15:41:05,581 INFO L231 Difference]: Finished difference. Result has 67 places, 104 transitions, 762 flow [2024-01-27 15:41:05,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=762, PETRI_PLACES=67, PETRI_TRANSITIONS=104} [2024-01-27 15:41:05,583 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2024-01-27 15:41:05,583 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 104 transitions, 762 flow [2024-01-27 15:41:05,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 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-01-27 15:41:05,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:05,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:05,588 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-01-27 15:41:05,787 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-01-27 15:41:05,789 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 1 more)] === [2024-01-27 15:41:05,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2019179498, now seen corresponding path program 3 times [2024-01-27 15:41:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812627122] [2024-01-27 15:41:05,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:41:05,790 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-01-27 15:41:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:05,791 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-01-27 15:41:05,794 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-01-27 15:41:05,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:41:05,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:05,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:05,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:06,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:06,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812627122] [2024-01-27 15:41:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812627122] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977539895] [2024-01-27 15:41:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:06,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:06,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 104 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:06,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:06,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:06,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:07,168 INFO L124 PetriNetUnfolderBase]: 2170/3244 cut-off events. [2024-01-27 15:41:07,169 INFO L125 PetriNetUnfolderBase]: For 24436/24436 co-relation queries the response was YES. [2024-01-27 15:41:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16080 conditions, 3244 events. 2170/3244 cut-off events. For 24436/24436 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15291 event pairs, 737 based on Foata normal form. 12/3253 useless extension candidates. Maximal degree in co-relation 8593. Up to 2306 conditions per place. [2024-01-27 15:41:07,192 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 151 selfloop transitions, 13 changer transitions 0/165 dead transitions. [2024-01-27 15:41:07,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 165 transitions, 1598 flow [2024-01-27 15:41:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-01-27 15:41:07,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-01-27 15:41:07,194 INFO L175 Difference]: Start difference. First operand has 67 places, 104 transitions, 762 flow. Second operand 6 states and 88 transitions. [2024-01-27 15:41:07,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 165 transitions, 1598 flow [2024-01-27 15:41:07,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 165 transitions, 1537 flow, removed 30 selfloop flow, removed 1 redundant places. [2024-01-27 15:41:07,226 INFO L231 Difference]: Finished difference. Result has 73 places, 106 transitions, 798 flow [2024-01-27 15:41:07,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=73, PETRI_TRANSITIONS=106} [2024-01-27 15:41:07,226 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-01-27 15:41:07,227 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 106 transitions, 798 flow [2024-01-27 15:41:07,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:07,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:07,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:07,233 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 (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:07,430 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-01-27 15:41:07,431 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 1 more)] === [2024-01-27 15:41:07,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash -73041983, now seen corresponding path program 3 times [2024-01-27 15:41:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083265288] [2024-01-27 15:41:07,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:41:07,432 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-01-27 15:41:07,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:07,433 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-01-27 15:41:07,434 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-01-27 15:41:07,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:41:07,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:07,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:07,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:07,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:07,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083265288] [2024-01-27 15:41:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083265288] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:41:07,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:41:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 15:41:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774161872] [2024-01-27 15:41:07,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:41:07,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 15:41:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 15:41:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:41:07,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:07,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 106 transitions, 798 flow. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 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-01-27 15:41:07,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:07,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:07,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:09,528 INFO L124 PetriNetUnfolderBase]: 3891/5806 cut-off events. [2024-01-27 15:41:09,529 INFO L125 PetriNetUnfolderBase]: For 58086/58086 co-relation queries the response was YES. [2024-01-27 15:41:09,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30359 conditions, 5806 events. 3891/5806 cut-off events. For 58086/58086 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30234 event pairs, 846 based on Foata normal form. 148/5951 useless extension candidates. Maximal degree in co-relation 15660. Up to 2705 conditions per place. [2024-01-27 15:41:09,587 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 226 selfloop transitions, 106 changer transitions 8/341 dead transitions. [2024-01-27 15:41:09,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 341 transitions, 3369 flow [2024-01-27 15:41:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-27 15:41:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-01-27 15:41:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 200 transitions. [2024-01-27 15:41:09,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329004329004329 [2024-01-27 15:41:09,589 INFO L175 Difference]: Start difference. First operand has 73 places, 106 transitions, 798 flow. Second operand 14 states and 200 transitions. [2024-01-27 15:41:09,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 341 transitions, 3369 flow [2024-01-27 15:41:09,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 341 transitions, 3295 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:09,656 INFO L231 Difference]: Finished difference. Result has 94 places, 161 transitions, 1823 flow [2024-01-27 15:41:09,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1823, PETRI_PLACES=94, PETRI_TRANSITIONS=161} [2024-01-27 15:41:09,656 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 61 predicate places. [2024-01-27 15:41:09,657 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 161 transitions, 1823 flow [2024-01-27 15:41:09,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 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-01-27 15:41:09,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:09,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:09,661 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-01-27 15:41:09,860 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-01-27 15:41:09,861 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 1 more)] === [2024-01-27 15:41:09,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1139593617, now seen corresponding path program 1 times [2024-01-27 15:41:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514883306] [2024-01-27 15:41:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:41:09,862 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-01-27 15:41:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:09,863 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-01-27 15:41:09,863 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-01-27 15:41:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:41:09,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:10,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:10,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:10,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:10,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514883306] [2024-01-27 15:41:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514883306] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062246444] [2024-01-27 15:41:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:10,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:10,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:10,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:10,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 161 transitions, 1823 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:10,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:10,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:11,610 INFO L124 PetriNetUnfolderBase]: 3950/5929 cut-off events. [2024-01-27 15:41:11,610 INFO L125 PetriNetUnfolderBase]: For 86552/86552 co-relation queries the response was YES. [2024-01-27 15:41:11,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37720 conditions, 5929 events. 3950/5929 cut-off events. For 86552/86552 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31539 event pairs, 1376 based on Foata normal form. 68/5994 useless extension candidates. Maximal degree in co-relation 32767. Up to 4157 conditions per place. [2024-01-27 15:41:11,643 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 256 selfloop transitions, 13 changer transitions 16/286 dead transitions. [2024-01-27 15:41:11,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 286 transitions, 3816 flow [2024-01-27 15:41:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-01-27 15:41:11,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-01-27 15:41:11,646 INFO L175 Difference]: Start difference. First operand has 94 places, 161 transitions, 1823 flow. Second operand 6 states and 92 transitions. [2024-01-27 15:41:11,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 286 transitions, 3816 flow [2024-01-27 15:41:11,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 286 transitions, 3489 flow, removed 163 selfloop flow, removed 1 redundant places. [2024-01-27 15:41:11,835 INFO L231 Difference]: Finished difference. Result has 100 places, 163 transitions, 1717 flow [2024-01-27 15:41:11,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1717, PETRI_PLACES=100, PETRI_TRANSITIONS=163} [2024-01-27 15:41:11,836 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 67 predicate places. [2024-01-27 15:41:11,836 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 163 transitions, 1717 flow [2024-01-27 15:41:11,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:11,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:11,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:11,842 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-01-27 15:41:12,040 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-01-27 15:41:12,043 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 1 more)] === [2024-01-27 15:41:12,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1843117074, now seen corresponding path program 4 times [2024-01-27 15:41:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424944860] [2024-01-27 15:41:12,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:41:12,044 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-01-27 15:41:12,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:12,046 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-01-27 15:41:12,052 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-01-27 15:41:12,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:41:12,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:12,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:12,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:12,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:12,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424944860] [2024-01-27 15:41:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424944860] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:41:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849323260] [2024-01-27 15:41:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:12,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:41:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:41:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:41:12,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:12,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 163 transitions, 1717 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:12,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:12,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:12,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:13,706 INFO L124 PetriNetUnfolderBase]: 5174/7832 cut-off events. [2024-01-27 15:41:13,707 INFO L125 PetriNetUnfolderBase]: For 111958/111958 co-relation queries the response was YES. [2024-01-27 15:41:13,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50164 conditions, 7832 events. 5174/7832 cut-off events. For 111958/111958 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 42919 event pairs, 2434 based on Foata normal form. 152/7978 useless extension candidates. Maximal degree in co-relation 42298. Up to 5815 conditions per place. [2024-01-27 15:41:13,747 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 290 selfloop transitions, 16 changer transitions 2/309 dead transitions. [2024-01-27 15:41:13,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 309 transitions, 3917 flow [2024-01-27 15:41:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-01-27 15:41:13,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-01-27 15:41:13,750 INFO L175 Difference]: Start difference. First operand has 100 places, 163 transitions, 1717 flow. Second operand 6 states and 94 transitions. [2024-01-27 15:41:13,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 309 transitions, 3917 flow [2024-01-27 15:41:13,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 309 transitions, 3819 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:13,944 INFO L231 Difference]: Finished difference. Result has 106 places, 177 transitions, 1846 flow [2024-01-27 15:41:13,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1846, PETRI_PLACES=106, PETRI_TRANSITIONS=177} [2024-01-27 15:41:13,945 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 73 predicate places. [2024-01-27 15:41:13,945 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 177 transitions, 1846 flow [2024-01-27 15:41:13,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:13,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:13,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:13,951 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-01-27 15:41:14,149 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-01-27 15:41:14,149 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 1 more)] === [2024-01-27 15:41:14,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1609673279, now seen corresponding path program 2 times [2024-01-27 15:41:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245972579] [2024-01-27 15:41:14,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:41:14,150 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-01-27 15:41:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:14,151 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-01-27 15:41:14,154 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-01-27 15:41:14,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:41:14,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:14,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:14,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:14,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:14,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245972579] [2024-01-27 15:41:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245972579] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:14,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:14,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256602279] [2024-01-27 15:41:14,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:14,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:14,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:14,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:14,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 177 transitions, 1846 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:14,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:14,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:14,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:16,468 INFO L124 PetriNetUnfolderBase]: 6092/9050 cut-off events. [2024-01-27 15:41:16,468 INFO L125 PetriNetUnfolderBase]: For 148515/148515 co-relation queries the response was YES. [2024-01-27 15:41:16,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61523 conditions, 9050 events. 6092/9050 cut-off events. For 148515/148515 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 48652 event pairs, 1368 based on Foata normal form. 64/9114 useless extension candidates. Maximal degree in co-relation 53761. Up to 4957 conditions per place. [2024-01-27 15:41:16,520 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 185 selfloop transitions, 93 changer transitions 1/280 dead transitions. [2024-01-27 15:41:16,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 280 transitions, 3574 flow [2024-01-27 15:41:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-01-27 15:41:16,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-01-27 15:41:16,522 INFO L175 Difference]: Start difference. First operand has 106 places, 177 transitions, 1846 flow. Second operand 6 states and 86 transitions. [2024-01-27 15:41:16,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 280 transitions, 3574 flow [2024-01-27 15:41:16,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 280 transitions, 3574 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:41:16,725 INFO L231 Difference]: Finished difference. Result has 113 places, 190 transitions, 2366 flow [2024-01-27 15:41:16,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2366, PETRI_PLACES=113, PETRI_TRANSITIONS=190} [2024-01-27 15:41:16,725 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places. [2024-01-27 15:41:16,726 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 190 transitions, 2366 flow [2024-01-27 15:41:16,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:16,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:16,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:16,730 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-01-27 15:41:16,930 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-01-27 15:41:16,930 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 1 more)] === [2024-01-27 15:41:16,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1493177375, now seen corresponding path program 3 times [2024-01-27 15:41:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:16,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020816712] [2024-01-27 15:41:16,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:41:16,931 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-01-27 15:41:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:16,932 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-01-27 15:41:16,933 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-01-27 15:41:17,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:41:17,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:17,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:17,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:17,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:17,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020816712] [2024-01-27 15:41:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020816712] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:41:17,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:41:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 15:41:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015182304] [2024-01-27 15:41:17,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:41:17,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 15:41:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 15:41:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:41:17,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:17,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 190 transitions, 2366 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:17,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:17,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:17,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:19,272 INFO L124 PetriNetUnfolderBase]: 6618/10052 cut-off events. [2024-01-27 15:41:19,272 INFO L125 PetriNetUnfolderBase]: For 152300/152300 co-relation queries the response was YES. [2024-01-27 15:41:19,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72089 conditions, 10052 events. 6618/10052 cut-off events. For 152300/152300 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 57794 event pairs, 886 based on Foata normal form. 204/10256 useless extension candidates. Maximal degree in co-relation 63748. Up to 3697 conditions per place. [2024-01-27 15:41:19,343 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 283 selfloop transitions, 98 changer transitions 20/402 dead transitions. [2024-01-27 15:41:19,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 402 transitions, 5492 flow [2024-01-27 15:41:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:41:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:41:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-01-27 15:41:19,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-01-27 15:41:19,345 INFO L175 Difference]: Start difference. First operand has 113 places, 190 transitions, 2366 flow. Second operand 11 states and 151 transitions. [2024-01-27 15:41:19,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 402 transitions, 5492 flow [2024-01-27 15:41:20,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 5191 flow, removed 106 selfloop flow, removed 4 redundant places. [2024-01-27 15:41:20,163 INFO L231 Difference]: Finished difference. Result has 124 places, 195 transitions, 2446 flow [2024-01-27 15:41:20,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2446, PETRI_PLACES=124, PETRI_TRANSITIONS=195} [2024-01-27 15:41:20,164 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 91 predicate places. [2024-01-27 15:41:20,164 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 195 transitions, 2446 flow [2024-01-27 15:41:20,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:20,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:20,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:20,169 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 (12)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:20,369 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-01-27 15:41:20,369 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 1 more)] === [2024-01-27 15:41:20,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1429486037, now seen corresponding path program 4 times [2024-01-27 15:41:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055779638] [2024-01-27 15:41:20,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:41:20,370 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-01-27 15:41:20,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:20,371 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-01-27 15:41:20,372 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-01-27 15:41:20,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:41:20,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:20,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:20,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:20,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:20,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055779638] [2024-01-27 15:41:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055779638] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187157950] [2024-01-27 15:41:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:20,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:20,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:20,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 195 transitions, 2446 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:20,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:20,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:20,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:22,421 INFO L124 PetriNetUnfolderBase]: 6338/9624 cut-off events. [2024-01-27 15:41:22,421 INFO L125 PetriNetUnfolderBase]: For 132831/132831 co-relation queries the response was YES. [2024-01-27 15:41:22,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62383 conditions, 9624 events. 6338/9624 cut-off events. For 132831/132831 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 54945 event pairs, 2760 based on Foata normal form. 32/9656 useless extension candidates. Maximal degree in co-relation 52816. Up to 8179 conditions per place. [2024-01-27 15:41:22,497 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 216 selfloop transitions, 50 changer transitions 9/276 dead transitions. [2024-01-27 15:41:22,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 276 transitions, 4062 flow [2024-01-27 15:41:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-01-27 15:41:22,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-01-27 15:41:22,501 INFO L175 Difference]: Start difference. First operand has 124 places, 195 transitions, 2446 flow. Second operand 6 states and 83 transitions. [2024-01-27 15:41:22,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 276 transitions, 4062 flow [2024-01-27 15:41:22,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 276 transitions, 3720 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-01-27 15:41:22,834 INFO L231 Difference]: Finished difference. Result has 125 places, 208 transitions, 2547 flow [2024-01-27 15:41:22,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2547, PETRI_PLACES=125, PETRI_TRANSITIONS=208} [2024-01-27 15:41:22,835 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 92 predicate places. [2024-01-27 15:41:22,835 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 208 transitions, 2547 flow [2024-01-27 15:41:22,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:22,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:22,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:22,841 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 (13)] Ended with exit code 0 [2024-01-27 15:41:23,039 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-01-27 15:41:23,039 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 1 more)] === [2024-01-27 15:41:23,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1817405989, now seen corresponding path program 5 times [2024-01-27 15:41:23,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:23,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017084468] [2024-01-27 15:41:23,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:41:23,040 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-01-27 15:41:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:23,041 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-01-27 15:41:23,042 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-01-27 15:41:23,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:41:23,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:23,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:41:23,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:23,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:23,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017084468] [2024-01-27 15:41:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017084468] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:23,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:23,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311986591] [2024-01-27 15:41:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:23,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:41:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:23,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:41:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:41:23,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:23,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 208 transitions, 2547 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:23,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:23,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:23,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:25,485 INFO L124 PetriNetUnfolderBase]: 6772/10286 cut-off events. [2024-01-27 15:41:25,486 INFO L125 PetriNetUnfolderBase]: For 132368/132368 co-relation queries the response was YES. [2024-01-27 15:41:25,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66016 conditions, 10286 events. 6772/10286 cut-off events. For 132368/132368 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 59491 event pairs, 1630 based on Foata normal form. 196/10482 useless extension candidates. Maximal degree in co-relation 56150. Up to 6013 conditions per place. [2024-01-27 15:41:25,550 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 279 selfloop transitions, 45 changer transitions 2/327 dead transitions. [2024-01-27 15:41:25,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 327 transitions, 4549 flow [2024-01-27 15:41:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:41:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:41:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-01-27 15:41:25,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2024-01-27 15:41:25,553 INFO L175 Difference]: Start difference. First operand has 125 places, 208 transitions, 2547 flow. Second operand 5 states and 86 transitions. [2024-01-27 15:41:25,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 327 transitions, 4549 flow [2024-01-27 15:41:25,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 327 transitions, 4381 flow, removed 47 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:25,911 INFO L231 Difference]: Finished difference. Result has 128 places, 217 transitions, 2656 flow [2024-01-27 15:41:25,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2656, PETRI_PLACES=128, PETRI_TRANSITIONS=217} [2024-01-27 15:41:25,912 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 95 predicate places. [2024-01-27 15:41:25,912 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 217 transitions, 2656 flow [2024-01-27 15:41:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:25,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:25,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:25,920 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 (14)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:26,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-01-27 15:41:26,118 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 1 more)] === [2024-01-27 15:41:26,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 24751045, now seen corresponding path program 4 times [2024-01-27 15:41:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278256689] [2024-01-27 15:41:26,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:41:26,119 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-01-27 15:41:26,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:26,121 INFO L229 MonitoredProcess]: Starting monitored process 15 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-01-27 15:41:26,121 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 (15)] Waiting until timeout for monitored process [2024-01-27 15:41:26,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:41:26,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:26,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:26,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:26,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:26,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278256689] [2024-01-27 15:41:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278256689] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:26,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:26,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653366874] [2024-01-27 15:41:26,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:26,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:26,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:26,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:26,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:26,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 217 transitions, 2656 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:26,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:26,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:26,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:28,021 INFO L124 PetriNetUnfolderBase]: 6972/10578 cut-off events. [2024-01-27 15:41:28,021 INFO L125 PetriNetUnfolderBase]: For 155018/155018 co-relation queries the response was YES. [2024-01-27 15:41:28,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69197 conditions, 10578 events. 6972/10578 cut-off events. For 155018/155018 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 60905 event pairs, 2640 based on Foata normal form. 124/10702 useless extension candidates. Maximal degree in co-relation 58508. Up to 7959 conditions per place. [2024-01-27 15:41:28,086 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 185 selfloop transitions, 113 changer transitions 12/311 dead transitions. [2024-01-27 15:41:28,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 311 transitions, 4503 flow [2024-01-27 15:41:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-01-27 15:41:28,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-01-27 15:41:28,089 INFO L175 Difference]: Start difference. First operand has 128 places, 217 transitions, 2656 flow. Second operand 6 states and 83 transitions. [2024-01-27 15:41:28,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 311 transitions, 4503 flow [2024-01-27 15:41:28,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 311 transitions, 4397 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-01-27 15:41:28,442 INFO L231 Difference]: Finished difference. Result has 133 places, 246 transitions, 3483 flow [2024-01-27 15:41:28,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2585, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3483, PETRI_PLACES=133, PETRI_TRANSITIONS=246} [2024-01-27 15:41:28,443 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 100 predicate places. [2024-01-27 15:41:28,443 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 246 transitions, 3483 flow [2024-01-27 15:41:28,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:28,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:28,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:28,456 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 (15)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:28,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-01-27 15:41:28,653 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 1 more)] === [2024-01-27 15:41:28,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash 956001141, now seen corresponding path program 5 times [2024-01-27 15:41:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806841047] [2024-01-27 15:41:28,654 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:41:28,654 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-01-27 15:41:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:28,655 INFO L229 MonitoredProcess]: Starting monitored process 16 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-01-27 15:41:28,656 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 (16)] Waiting until timeout for monitored process [2024-01-27 15:41:28,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:41:28,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:28,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:28,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:28,854 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:28,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:28,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806841047] [2024-01-27 15:41:28,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806841047] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953850733] [2024-01-27 15:41:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:28,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:28,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:28,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:28,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 246 transitions, 3483 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:28,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:28,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:28,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:30,909 INFO L124 PetriNetUnfolderBase]: 7400/11238 cut-off events. [2024-01-27 15:41:30,909 INFO L125 PetriNetUnfolderBase]: For 176534/176534 co-relation queries the response was YES. [2024-01-27 15:41:30,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76580 conditions, 11238 events. 7400/11238 cut-off events. For 176534/176534 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 65742 event pairs, 2549 based on Foata normal form. 200/11438 useless extension candidates. Maximal degree in co-relation 66363. Up to 8622 conditions per place. [2024-01-27 15:41:30,979 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 267 selfloop transitions, 84 changer transitions 2/354 dead transitions. [2024-01-27 15:41:30,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 354 transitions, 5524 flow [2024-01-27 15:41:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2024-01-27 15:41:30,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-01-27 15:41:30,981 INFO L175 Difference]: Start difference. First operand has 133 places, 246 transitions, 3483 flow. Second operand 6 states and 81 transitions. [2024-01-27 15:41:30,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 354 transitions, 5524 flow [2024-01-27 15:41:31,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 354 transitions, 5223 flow, removed 93 selfloop flow, removed 2 redundant places. [2024-01-27 15:41:31,448 INFO L231 Difference]: Finished difference. Result has 137 places, 275 transitions, 3987 flow [2024-01-27 15:41:31,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3196, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3987, PETRI_PLACES=137, PETRI_TRANSITIONS=275} [2024-01-27 15:41:31,449 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2024-01-27 15:41:31,449 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 275 transitions, 3987 flow [2024-01-27 15:41:31,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:31,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:31,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:31,455 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 (16)] Ended with exit code 0 [2024-01-27 15:41:31,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-01-27 15:41:31,650 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:31,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1689879519, now seen corresponding path program 6 times [2024-01-27 15:41:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:31,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465034114] [2024-01-27 15:41:31,651 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:41:31,651 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-01-27 15:41:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:31,652 INFO L229 MonitoredProcess]: Starting monitored process 17 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-01-27 15:41:31,652 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 (17)] Waiting until timeout for monitored process [2024-01-27 15:41:31,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 15:41:31,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:31,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:31,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:31,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:31,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:31,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465034114] [2024-01-27 15:41:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465034114] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:31,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098196799] [2024-01-27 15:41:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:31,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:31,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:31,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:31,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 275 transitions, 3987 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:31,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:31,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:31,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:34,088 INFO L124 PetriNetUnfolderBase]: 7283/11091 cut-off events. [2024-01-27 15:41:34,089 INFO L125 PetriNetUnfolderBase]: For 165716/165716 co-relation queries the response was YES. [2024-01-27 15:41:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74757 conditions, 11091 events. 7283/11091 cut-off events. For 165716/165716 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 65419 event pairs, 2555 based on Foata normal form. 50/11141 useless extension candidates. Maximal degree in co-relation 65852. Up to 9350 conditions per place. [2024-01-27 15:41:34,171 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 295 selfloop transitions, 63 changer transitions 0/359 dead transitions. [2024-01-27 15:41:34,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 359 transitions, 5937 flow [2024-01-27 15:41:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-01-27 15:41:34,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-01-27 15:41:34,174 INFO L175 Difference]: Start difference. First operand has 137 places, 275 transitions, 3987 flow. Second operand 6 states and 85 transitions. [2024-01-27 15:41:34,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 359 transitions, 5937 flow [2024-01-27 15:41:34,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 359 transitions, 5461 flow, removed 135 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:34,731 INFO L231 Difference]: Finished difference. Result has 140 places, 284 transitions, 4004 flow [2024-01-27 15:41:34,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3657, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4004, PETRI_PLACES=140, PETRI_TRANSITIONS=284} [2024-01-27 15:41:34,732 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places. [2024-01-27 15:41:34,732 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 284 transitions, 4004 flow [2024-01-27 15:41:34,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:34,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:34,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:34,736 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 (17)] Ended with exit code 0 [2024-01-27 15:41:34,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-01-27 15:41:34,936 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:34,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1592058287, now seen corresponding path program 7 times [2024-01-27 15:41:34,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69983411] [2024-01-27 15:41:34,937 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:41:34,937 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-01-27 15:41:34,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:34,938 INFO L229 MonitoredProcess]: Starting monitored process 18 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-01-27 15:41:34,938 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 (18)] Waiting until timeout for monitored process [2024-01-27 15:41:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:41:35,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:35,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:35,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:35,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69983411] [2024-01-27 15:41:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69983411] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:35,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:41:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912109502] [2024-01-27 15:41:35,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:35,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:41:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:41:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:41:35,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:35,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 284 transitions, 4004 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:35,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:35,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:35,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:37,104 INFO L124 PetriNetUnfolderBase]: 6269/9513 cut-off events. [2024-01-27 15:41:37,104 INFO L125 PetriNetUnfolderBase]: For 140288/140288 co-relation queries the response was YES. [2024-01-27 15:41:37,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64408 conditions, 9513 events. 6269/9513 cut-off events. For 140288/140288 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 54256 event pairs, 2706 based on Foata normal form. 144/9657 useless extension candidates. Maximal degree in co-relation 57676. Up to 8335 conditions per place. [2024-01-27 15:41:37,178 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 312 selfloop transitions, 27 changer transitions 23/363 dead transitions. [2024-01-27 15:41:37,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 363 transitions, 5718 flow [2024-01-27 15:41:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-01-27 15:41:37,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-01-27 15:41:37,181 INFO L175 Difference]: Start difference. First operand has 140 places, 284 transitions, 4004 flow. Second operand 6 states and 90 transitions. [2024-01-27 15:41:37,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 363 transitions, 5718 flow [2024-01-27 15:41:37,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 363 transitions, 5444 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-01-27 15:41:37,692 INFO L231 Difference]: Finished difference. Result has 143 places, 299 transitions, 4130 flow [2024-01-27 15:41:37,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3794, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4130, PETRI_PLACES=143, PETRI_TRANSITIONS=299} [2024-01-27 15:41:37,692 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 110 predicate places. [2024-01-27 15:41:37,693 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 299 transitions, 4130 flow [2024-01-27 15:41:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:37,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:37,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:37,698 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 (18)] Ended with exit code 0 [2024-01-27 15:41:37,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-01-27 15:41:37,893 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:37,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -344838899, now seen corresponding path program 6 times [2024-01-27 15:41:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:37,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599568266] [2024-01-27 15:41:37,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:41:37,894 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-01-27 15:41:37,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:37,895 INFO L229 MonitoredProcess]: Starting monitored process 19 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-01-27 15:41:37,898 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 (19)] Waiting until timeout for monitored process [2024-01-27 15:41:38,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 15:41:38,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:38,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:38,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:38,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:38,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599568266] [2024-01-27 15:41:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599568266] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903819884] [2024-01-27 15:41:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:38,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:38,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:38,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 299 transitions, 4130 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:38,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:38,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:38,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:39,942 INFO L124 PetriNetUnfolderBase]: 6072/9278 cut-off events. [2024-01-27 15:41:39,942 INFO L125 PetriNetUnfolderBase]: For 132561/132561 co-relation queries the response was YES. [2024-01-27 15:41:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61629 conditions, 9278 events. 6072/9278 cut-off events. For 132561/132561 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 53286 event pairs, 2201 based on Foata normal form. 110/9388 useless extension candidates. Maximal degree in co-relation 54129. Up to 6930 conditions per place. [2024-01-27 15:41:40,007 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 278 selfloop transitions, 76 changer transitions 33/388 dead transitions. [2024-01-27 15:41:40,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 388 transitions, 5816 flow [2024-01-27 15:41:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-01-27 15:41:40,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-01-27 15:41:40,009 INFO L175 Difference]: Start difference. First operand has 143 places, 299 transitions, 4130 flow. Second operand 6 states and 83 transitions. [2024-01-27 15:41:40,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 388 transitions, 5816 flow [2024-01-27 15:41:40,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 388 transitions, 5782 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:40,418 INFO L231 Difference]: Finished difference. Result has 146 places, 284 transitions, 4051 flow [2024-01-27 15:41:40,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4068, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4051, PETRI_PLACES=146, PETRI_TRANSITIONS=284} [2024-01-27 15:41:40,418 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 113 predicate places. [2024-01-27 15:41:40,418 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 284 transitions, 4051 flow [2024-01-27 15:41:40,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:40,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:40,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:40,424 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 (19)] Ended with exit code 0 [2024-01-27 15:41:40,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-01-27 15:41:40,619 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:40,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2145607847, now seen corresponding path program 7 times [2024-01-27 15:41:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63682861] [2024-01-27 15:41:40,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:41:40,620 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-01-27 15:41:40,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:40,621 INFO L229 MonitoredProcess]: Starting monitored process 20 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-01-27 15:41:40,625 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 (20)] Waiting until timeout for monitored process [2024-01-27 15:41:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:41:40,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:40,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:41:40,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:40,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63682861] [2024-01-27 15:41:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63682861] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:40,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905698562] [2024-01-27 15:41:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:40,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:40,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:40,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:40,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 284 transitions, 4051 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:40,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:40,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:40,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:42,380 INFO L124 PetriNetUnfolderBase]: 5182/7871 cut-off events. [2024-01-27 15:41:42,380 INFO L125 PetriNetUnfolderBase]: For 126693/126693 co-relation queries the response was YES. [2024-01-27 15:41:42,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52582 conditions, 7871 events. 5182/7871 cut-off events. For 126693/126693 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 43883 event pairs, 1886 based on Foata normal form. 172/8043 useless extension candidates. Maximal degree in co-relation 50153. Up to 5273 conditions per place. [2024-01-27 15:41:42,444 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 170 selfloop transitions, 134 changer transitions 37/342 dead transitions. [2024-01-27 15:41:42,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 342 transitions, 5335 flow [2024-01-27 15:41:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2024-01-27 15:41:42,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-01-27 15:41:42,446 INFO L175 Difference]: Start difference. First operand has 146 places, 284 transitions, 4051 flow. Second operand 6 states and 81 transitions. [2024-01-27 15:41:42,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 342 transitions, 5335 flow [2024-01-27 15:41:42,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 342 transitions, 5101 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-01-27 15:41:42,827 INFO L231 Difference]: Finished difference. Result has 148 places, 254 transitions, 3690 flow [2024-01-27 15:41:42,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3799, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3690, PETRI_PLACES=148, PETRI_TRANSITIONS=254} [2024-01-27 15:41:42,828 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 115 predicate places. [2024-01-27 15:41:42,828 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 254 transitions, 3690 flow [2024-01-27 15:41:42,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:42,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:42,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:42,833 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 (20)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:43,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-01-27 15:41:43,033 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:43,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -982021822, now seen corresponding path program 1 times [2024-01-27 15:41:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247423236] [2024-01-27 15:41:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:41:43,034 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-01-27 15:41:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:43,035 INFO L229 MonitoredProcess]: Starting monitored process 21 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-01-27 15:41:43,036 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 (21)] Waiting until timeout for monitored process [2024-01-27 15:41:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:41:43,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:43,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:41:43,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:41:43,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:43,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247423236] [2024-01-27 15:41:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247423236] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:41:43,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:41:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-01-27 15:41:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381081849] [2024-01-27 15:41:43,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:41:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 15:41:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 15:41:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:41:43,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:43,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 254 transitions, 3690 flow. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:43,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:43,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:43,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:45,585 INFO L124 PetriNetUnfolderBase]: 8925/13316 cut-off events. [2024-01-27 15:41:45,585 INFO L125 PetriNetUnfolderBase]: For 212222/212222 co-relation queries the response was YES. [2024-01-27 15:41:45,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85813 conditions, 13316 events. 8925/13316 cut-off events. For 212222/212222 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 77359 event pairs, 3512 based on Foata normal form. 462/13778 useless extension candidates. Maximal degree in co-relation 85760. Up to 6009 conditions per place. [2024-01-27 15:41:45,695 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 238 selfloop transitions, 230 changer transitions 14/483 dead transitions. [2024-01-27 15:41:45,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 483 transitions, 7672 flow [2024-01-27 15:41:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:41:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:41:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-01-27 15:41:45,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3691460055096419 [2024-01-27 15:41:45,697 INFO L175 Difference]: Start difference. First operand has 148 places, 254 transitions, 3690 flow. Second operand 11 states and 134 transitions. [2024-01-27 15:41:45,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 483 transitions, 7672 flow [2024-01-27 15:41:46,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 483 transitions, 6772 flow, removed 144 selfloop flow, removed 14 redundant places. [2024-01-27 15:41:46,565 INFO L231 Difference]: Finished difference. Result has 134 places, 341 transitions, 4840 flow [2024-01-27 15:41:46,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4840, PETRI_PLACES=134, PETRI_TRANSITIONS=341} [2024-01-27 15:41:46,565 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places. [2024-01-27 15:41:46,565 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 341 transitions, 4840 flow [2024-01-27 15:41:46,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:46,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:46,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:46,571 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 (21)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:46,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-01-27 15:41:46,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:46,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -615280546, now seen corresponding path program 1 times [2024-01-27 15:41:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862308557] [2024-01-27 15:41:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:41:46,767 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-01-27 15:41:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:46,768 INFO L229 MonitoredProcess]: Starting monitored process 22 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-01-27 15:41:46,769 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 (22)] Waiting until timeout for monitored process [2024-01-27 15:41:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:41:46,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:41:46,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:41:46,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:46,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862308557] [2024-01-27 15:41:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862308557] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:46,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:41:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560893370] [2024-01-27 15:41:46,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:46,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:41:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:41:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:41:46,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:46,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 341 transitions, 4840 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:46,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:46,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:46,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:49,689 INFO L124 PetriNetUnfolderBase]: 8983/13170 cut-off events. [2024-01-27 15:41:49,690 INFO L125 PetriNetUnfolderBase]: For 132334/132334 co-relation queries the response was YES. [2024-01-27 15:41:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78598 conditions, 13170 events. 8983/13170 cut-off events. For 132334/132334 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 74851 event pairs, 1978 based on Foata normal form. 272/13442 useless extension candidates. Maximal degree in co-relation 78553. Up to 8764 conditions per place. [2024-01-27 15:41:49,792 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 416 selfloop transitions, 47 changer transitions 4/468 dead transitions. [2024-01-27 15:41:49,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 468 transitions, 7258 flow [2024-01-27 15:41:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:41:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:41:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-01-27 15:41:49,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-01-27 15:41:49,794 INFO L175 Difference]: Start difference. First operand has 134 places, 341 transitions, 4840 flow. Second operand 6 states and 87 transitions. [2024-01-27 15:41:49,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 468 transitions, 7258 flow [2024-01-27 15:41:50,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 468 transitions, 7081 flow, removed 77 selfloop flow, removed 7 redundant places. [2024-01-27 15:41:50,475 INFO L231 Difference]: Finished difference. Result has 129 places, 347 transitions, 4930 flow [2024-01-27 15:41:50,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4711, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4930, PETRI_PLACES=129, PETRI_TRANSITIONS=347} [2024-01-27 15:41:50,476 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2024-01-27 15:41:50,476 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 347 transitions, 4930 flow [2024-01-27 15:41:50,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:50,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:50,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:50,481 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 (22)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:50,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-01-27 15:41:50,677 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:50,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 723092176, now seen corresponding path program 2 times [2024-01-27 15:41:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:50,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709144696] [2024-01-27 15:41:50,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:41:50,677 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-01-27 15:41:50,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:50,679 INFO L229 MonitoredProcess]: Starting monitored process 23 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-01-27 15:41:50,685 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 (23)] Waiting until timeout for monitored process [2024-01-27 15:41:50,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:41:50,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:50,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:41:50,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:41:51,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:41:51,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:51,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709144696] [2024-01-27 15:41:51,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709144696] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:41:51,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:41:51,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-01-27 15:41:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815792184] [2024-01-27 15:41:51,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:51,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:41:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:41:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:41:51,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:51,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 347 transitions, 4930 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:51,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:51,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:51,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:53,525 INFO L124 PetriNetUnfolderBase]: 9395/13750 cut-off events. [2024-01-27 15:41:53,525 INFO L125 PetriNetUnfolderBase]: For 153157/153157 co-relation queries the response was YES. [2024-01-27 15:41:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84026 conditions, 13750 events. 9395/13750 cut-off events. For 153157/153157 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 78566 event pairs, 3296 based on Foata normal form. 168/13917 useless extension candidates. Maximal degree in co-relation 83984. Up to 9841 conditions per place. [2024-01-27 15:41:53,628 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 422 selfloop transitions, 44 changer transitions 13/480 dead transitions. [2024-01-27 15:41:53,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 480 transitions, 7681 flow [2024-01-27 15:41:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:41:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:41:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-01-27 15:41:53,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2024-01-27 15:41:53,630 INFO L175 Difference]: Start difference. First operand has 129 places, 347 transitions, 4930 flow. Second operand 5 states and 83 transitions. [2024-01-27 15:41:53,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 480 transitions, 7681 flow [2024-01-27 15:41:54,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 480 transitions, 7598 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-27 15:41:54,184 INFO L231 Difference]: Finished difference. Result has 133 places, 369 transitions, 5323 flow [2024-01-27 15:41:54,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4866, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5323, PETRI_PLACES=133, PETRI_TRANSITIONS=369} [2024-01-27 15:41:54,184 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 100 predicate places. [2024-01-27 15:41:54,184 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 369 transitions, 5323 flow [2024-01-27 15:41:54,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:54,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:54,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:54,193 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 (23)] Forceful destruction successful, exit code 0 [2024-01-27 15:41:54,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-01-27 15:41:54,385 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:54,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash -270010528, now seen corresponding path program 3 times [2024-01-27 15:41:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:54,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657323491] [2024-01-27 15:41:54,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:41:54,386 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-01-27 15:41:54,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:54,386 INFO L229 MonitoredProcess]: Starting monitored process 24 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-01-27 15:41:54,387 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 (24)] Waiting until timeout for monitored process [2024-01-27 15:41:54,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:41:54,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:54,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:41:54,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:41:54,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:41:54,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657323491] [2024-01-27 15:41:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657323491] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:41:54,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:41:54,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 15:41:54,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782971507] [2024-01-27 15:41:54,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:41:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:41:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:41:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:41:54,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:54,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 369 transitions, 5323 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:54,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:54,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:54,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:41:57,486 INFO L124 PetriNetUnfolderBase]: 9257/13572 cut-off events. [2024-01-27 15:41:57,486 INFO L125 PetriNetUnfolderBase]: For 159975/159975 co-relation queries the response was YES. [2024-01-27 15:41:57,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88066 conditions, 13572 events. 9257/13572 cut-off events. For 159975/159975 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 77325 event pairs, 3148 based on Foata normal form. 44/13615 useless extension candidates. Maximal degree in co-relation 88021. Up to 10528 conditions per place. [2024-01-27 15:41:57,582 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 374 selfloop transitions, 66 changer transitions 4/445 dead transitions. [2024-01-27 15:41:57,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 445 transitions, 7032 flow [2024-01-27 15:41:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:41:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:41:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-01-27 15:41:57,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-01-27 15:41:57,583 INFO L175 Difference]: Start difference. First operand has 133 places, 369 transitions, 5323 flow. Second operand 7 states and 92 transitions. [2024-01-27 15:41:57,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 445 transitions, 7032 flow [2024-01-27 15:41:58,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 445 transitions, 6924 flow, removed 36 selfloop flow, removed 1 redundant places. [2024-01-27 15:41:58,123 INFO L231 Difference]: Finished difference. Result has 140 places, 382 transitions, 5615 flow [2024-01-27 15:41:58,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5246, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5615, PETRI_PLACES=140, PETRI_TRANSITIONS=382} [2024-01-27 15:41:58,124 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places. [2024-01-27 15:41:58,124 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 382 transitions, 5615 flow [2024-01-27 15:41:58,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:41:58,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:41:58,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:41:58,131 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 (24)] Ended with exit code 0 [2024-01-27 15:41:58,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-01-27 15:41:58,325 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:41:58,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:41:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 378559088, now seen corresponding path program 4 times [2024-01-27 15:41:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:41:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720367341] [2024-01-27 15:41:58,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:41:58,325 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-01-27 15:41:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:41:58,326 INFO L229 MonitoredProcess]: Starting monitored process 25 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-01-27 15:41:58,328 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 (25)] Waiting until timeout for monitored process [2024-01-27 15:41:58,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:41:58,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:41:58,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:41:58,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:41:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:41:58,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:41:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:41:58,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:41:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720367341] [2024-01-27 15:41:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720367341] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:41:58,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:41:58,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-01-27 15:41:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562700984] [2024-01-27 15:41:58,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:41:58,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 15:41:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:41:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 15:41:58,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:41:58,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2024-01-27 15:41:58,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 382 transitions, 5615 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-01-27 15:41:58,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:41:58,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2024-01-27 15:41:58,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:42:01,455 INFO L124 PetriNetUnfolderBase]: 8411/12210 cut-off events. [2024-01-27 15:42:01,455 INFO L125 PetriNetUnfolderBase]: For 156118/156118 co-relation queries the response was YES. [2024-01-27 15:42:01,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79979 conditions, 12210 events. 8411/12210 cut-off events. For 156118/156118 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 67335 event pairs, 3028 based on Foata normal form. 440/12649 useless extension candidates. Maximal degree in co-relation 79932. Up to 6081 conditions per place. [2024-01-27 15:42:01,548 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 474 selfloop transitions, 84 changer transitions 0/559 dead transitions. [2024-01-27 15:42:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 559 transitions, 9000 flow [2024-01-27 15:42:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:42:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:42:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-01-27 15:42:01,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-01-27 15:42:01,550 INFO L175 Difference]: Start difference. First operand has 140 places, 382 transitions, 5615 flow. Second operand 11 states and 132 transitions. [2024-01-27 15:42:01,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 559 transitions, 9000 flow [2024-01-27 15:42:02,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 559 transitions, 8643 flow, removed 110 selfloop flow, removed 4 redundant places. [2024-01-27 15:42:02,150 INFO L231 Difference]: Finished difference. Result has 144 places, 405 transitions, 5953 flow [2024-01-27 15:42:02,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5316, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5953, PETRI_PLACES=144, PETRI_TRANSITIONS=405} [2024-01-27 15:42:02,151 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 111 predicate places. [2024-01-27 15:42:02,151 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 405 transitions, 5953 flow [2024-01-27 15:42:02,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-01-27 15:42:02,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:42:02,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:42:02,156 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 (25)] Forceful destruction successful, exit code 0 [2024-01-27 15:42:02,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-01-27 15:42:02,352 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:42:02,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:42:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -493919544, now seen corresponding path program 1 times [2024-01-27 15:42:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:42:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999605635] [2024-01-27 15:42:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:42:02,353 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-01-27 15:42:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:42:02,353 INFO L229 MonitoredProcess]: Starting monitored process 26 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-01-27 15:42:02,354 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 (26)] Waiting until timeout for monitored process [2024-01-27 15:42:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:42:02,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 30 conjunts are in the unsatisfiable core [2024-01-27 15:42:02,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:42:02,816 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 7 [2024-01-27 15:42:02,866 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-01-27 15:42:02,866 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 13 treesize of output 13 [2024-01-27 15:42:03,411 INFO L349 Elim1Store]: treesize reduction 736, result has 17.6 percent of original size [2024-01-27 15:42:03,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 240 treesize of output 288 Killed by 15