./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-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-more-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 91d7b70e505e7aef19ce206c76dac3b8838d1608e22286f0e4e4335d9f63c057 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:19:08,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:19:08,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:19:08,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:19:08,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:19:08,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:19:08,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:19:08,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:19:08,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:19:08,896 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:19:08,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:19:08,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:19:08,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:19:08,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:19:08,899 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:19:08,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:19:08,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:19:08,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:19:08,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:19:08,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:19:08,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:19:08,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:19:08,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:19:08,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:19:08,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:19:08,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:19:08,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:19:08,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:19:08,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:19:08,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:19:08,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:19:08,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:19:08,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:19:08,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:19:08,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:19:08,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:19:08,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:19:08,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:19:08,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:19:08,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:19:08,905 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:19:08,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:19:08,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:19:08,906 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 -> 91d7b70e505e7aef19ce206c76dac3b8838d1608e22286f0e4e4335d9f63c057 [2024-01-27 16:19:09,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:19:09,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:19:09,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:19:09,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:19:09,202 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:19:09,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2024-01-27 16:19:10,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:19:10,473 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:19:10,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2024-01-27 16:19:10,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac3a77bd/2f7c629f7f32444eb646ef166d5a4083/FLAGfea084c75 [2024-01-27 16:19:10,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac3a77bd/2f7c629f7f32444eb646ef166d5a4083 [2024-01-27 16:19:10,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:19:10,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:19:10,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:19:10,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:19:10,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:19:10,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b2c78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10, skipping insertion in model container [2024-01-27 16:19:10,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:19:10,659 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-more-array-sum-alt.wvr.c[2800,2813] [2024-01-27 16:19:10,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:19:10,683 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:19:10,698 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-more-array-sum-alt.wvr.c[2800,2813] [2024-01-27 16:19:10,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:19:10,729 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:19:10,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10 WrapperNode [2024-01-27 16:19:10,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:19:10,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:19:10,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:19:10,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:19:10,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,773 INFO L138 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 209 [2024-01-27 16:19:10,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:19:10,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:19:10,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:19:10,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:19:10,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,821 INFO L175 MemorySlicer]: Split 12 memory accesses to 5 slices as follows [2, 2, 4, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 16:19:10,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:19:10,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:19:10,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:19:10,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:19:10,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (1/1) ... [2024-01-27 16:19:10,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:19:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:10,896 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 16:19:10,926 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 16:19:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:19:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:19:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:19:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:19:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:19:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:19:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:19:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:19:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:19:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:19:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:19:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:19:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 16:19:10,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 16:19:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 16:19:10,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 16:19:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 16:19:10,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 16:19:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:19:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:19:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:19:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:19:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:19:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:19:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:19:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 16:19:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:19:10,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:19:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:19:10,975 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 16:19:11,114 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:19:11,138 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:19:11,376 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:19:11,376 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:19:11,687 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:19:11,687 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 16:19:11,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:11 BoogieIcfgContainer [2024-01-27 16:19:11,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:19:11,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:19:11,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:19:11,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:19:11,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:19:10" (1/3) ... [2024-01-27 16:19:11,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfa28d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:19:11, skipping insertion in model container [2024-01-27 16:19:11,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:10" (2/3) ... [2024-01-27 16:19:11,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfa28d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:19:11, skipping insertion in model container [2024-01-27 16:19:11,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:11" (3/3) ... [2024-01-27 16:19:11,696 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2024-01-27 16:19:11,702 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:19:11,709 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:19:11,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:19:11,709 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:19:11,758 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 16:19:11,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 97 flow [2024-01-27 16:19:11,821 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-01-27 16:19:11,823 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 16:19:11,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-01-27 16:19:11,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 38 transitions, 97 flow [2024-01-27 16:19:11,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 86 flow [2024-01-27 16:19:11,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:19:11,854 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;@7c84764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:19:11,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 16:19:11,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:19:11,880 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-01-27 16:19:11,880 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 16:19:11,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:11,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:11,882 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 16:19:11,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash -194597747, now seen corresponding path program 1 times [2024-01-27 16:19:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632227649] [2024-01-27 16:19:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:12,360 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 16:19:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632227649] [2024-01-27 16:19:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632227649] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:12,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:19:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164894065] [2024-01-27 16:19:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:12,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:19:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:19:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:19:12,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-01-27 16:19:12,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 16:19:12,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:12,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-01-27 16:19:12,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:12,687 INFO L124 PetriNetUnfolderBase]: 1300/1958 cut-off events. [2024-01-27 16:19:12,687 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-01-27 16:19:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3990 conditions, 1958 events. 1300/1958 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9121 event pairs, 335 based on Foata normal form. 1/1937 useless extension candidates. Maximal degree in co-relation 3352. Up to 1333 conditions per place. [2024-01-27 16:19:12,704 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 47 selfloop transitions, 4 changer transitions 1/56 dead transitions. [2024-01-27 16:19:12,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 249 flow [2024-01-27 16:19:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:19:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:19:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-01-27 16:19:12,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-01-27 16:19:12,716 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 86 flow. Second operand 3 states and 74 transitions. [2024-01-27 16:19:12,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 249 flow [2024-01-27 16:19:12,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 227 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 16:19:12,726 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 100 flow [2024-01-27 16:19:12,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2024-01-27 16:19:12,731 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-01-27 16:19:12,731 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 100 flow [2024-01-27 16:19:12,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 16:19:12,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:12,732 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] [2024-01-27 16:19:12,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:19:12,733 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 16:19:12,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1174497164, now seen corresponding path program 1 times [2024-01-27 16:19:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:12,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535892082] [2024-01-27 16:19:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:12,881 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 16:19:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535892082] [2024-01-27 16:19:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535892082] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:19:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450052919] [2024-01-27 16:19:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:12,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:19:12,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-01-27 16:19:12,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:12,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:12,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-01-27 16:19:12,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:13,172 INFO L124 PetriNetUnfolderBase]: 1898/2980 cut-off events. [2024-01-27 16:19:13,173 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-27 16:19:13,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6000 conditions, 2980 events. 1898/2980 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16226 event pairs, 1276 based on Foata normal form. 0/2731 useless extension candidates. Maximal degree in co-relation 2258. Up to 1811 conditions per place. [2024-01-27 16:19:13,187 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 60 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-01-27 16:19:13,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 314 flow [2024-01-27 16:19:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-01-27 16:19:13,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842105263157895 [2024-01-27 16:19:13,190 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 100 flow. Second operand 5 states and 111 transitions. [2024-01-27 16:19:13,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 314 flow [2024-01-27 16:19:13,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:13,192 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 132 flow [2024-01-27 16:19:13,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-01-27 16:19:13,192 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-01-27 16:19:13,193 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 132 flow [2024-01-27 16:19:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:13,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:13,193 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] [2024-01-27 16:19:13,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:19:13,196 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 16:19:13,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -201252190, now seen corresponding path program 1 times [2024-01-27 16:19:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492442931] [2024-01-27 16:19:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:13,322 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 16:19:13,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492442931] [2024-01-27 16:19:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492442931] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:19:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978852220] [2024-01-27 16:19:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:13,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:13,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:13,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:19:13,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-01-27 16:19:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:13,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:13,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-01-27 16:19:13,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:13,570 INFO L124 PetriNetUnfolderBase]: 1552/2472 cut-off events. [2024-01-27 16:19:13,570 INFO L125 PetriNetUnfolderBase]: For 519/617 co-relation queries the response was YES. [2024-01-27 16:19:13,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5369 conditions, 2472 events. 1552/2472 cut-off events. For 519/617 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13097 event pairs, 1067 based on Foata normal form. 0/2264 useless extension candidates. Maximal degree in co-relation 4012. Up to 1703 conditions per place. [2024-01-27 16:19:13,581 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 56 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-01-27 16:19:13,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 330 flow [2024-01-27 16:19:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-01-27 16:19:13,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2024-01-27 16:19:13,586 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 132 flow. Second operand 5 states and 107 transitions. [2024-01-27 16:19:13,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 330 flow [2024-01-27 16:19:13,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:13,591 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 153 flow [2024-01-27 16:19:13,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-01-27 16:19:13,593 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-01-27 16:19:13,593 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 153 flow [2024-01-27 16:19:13,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:13,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:13,593 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] [2024-01-27 16:19:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:19:13,594 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 16:19:13,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1783408922, now seen corresponding path program 1 times [2024-01-27 16:19:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544248863] [2024-01-27 16:19:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:13,714 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 16:19:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544248863] [2024-01-27 16:19:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544248863] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:13,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:19:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994887456] [2024-01-27 16:19:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:13,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:13,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:13,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:19:13,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-01-27 16:19:13,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:13,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:13,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-01-27 16:19:13,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:13,956 INFO L124 PetriNetUnfolderBase]: 1382/2155 cut-off events. [2024-01-27 16:19:13,957 INFO L125 PetriNetUnfolderBase]: For 769/972 co-relation queries the response was YES. [2024-01-27 16:19:13,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 2155 events. 1382/2155 cut-off events. For 769/972 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10692 event pairs, 1018 based on Foata normal form. 0/2016 useless extension candidates. Maximal degree in co-relation 4324. Up to 1746 conditions per place. [2024-01-27 16:19:13,969 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 27 selfloop transitions, 2 changer transitions 27/65 dead transitions. [2024-01-27 16:19:13,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 333 flow [2024-01-27 16:19:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-01-27 16:19:13,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2024-01-27 16:19:13,970 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 153 flow. Second operand 5 states and 102 transitions. [2024-01-27 16:19:13,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 333 flow [2024-01-27 16:19:13,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:19:13,973 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 126 flow [2024-01-27 16:19:13,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2024-01-27 16:19:13,974 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-01-27 16:19:13,974 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 126 flow [2024-01-27 16:19:13,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:13,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:13,975 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] [2024-01-27 16:19:13,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:19:13,975 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 16:19:13,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash -292922294, now seen corresponding path program 1 times [2024-01-27 16:19:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165188865] [2024-01-27 16:19:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:14,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165188865] [2024-01-27 16:19:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165188865] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908042893] [2024-01-27 16:19:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:14,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:14,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:14,090 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 16:19:14,092 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 16:19:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:14,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 16:19:14,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:14,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908042893] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-01-27 16:19:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664182200] [2024-01-27 16:19:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:19:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:19:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-01-27 16:19:14,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-01-27 16:19:14,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:14,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:14,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-01-27 16:19:14,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:14,699 INFO L124 PetriNetUnfolderBase]: 2124/3314 cut-off events. [2024-01-27 16:19:14,699 INFO L125 PetriNetUnfolderBase]: For 896/1066 co-relation queries the response was YES. [2024-01-27 16:19:14,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 3314 events. 2124/3314 cut-off events. For 896/1066 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18140 event pairs, 414 based on Foata normal form. 0/2938 useless extension candidates. Maximal degree in co-relation 8011. Up to 829 conditions per place. [2024-01-27 16:19:14,714 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 86 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-01-27 16:19:14,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 531 flow [2024-01-27 16:19:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:19:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:19:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-01-27 16:19:14,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2024-01-27 16:19:14,716 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 126 flow. Second operand 9 states and 174 transitions. [2024-01-27 16:19:14,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 531 flow [2024-01-27 16:19:14,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 109 transitions, 461 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-01-27 16:19:14,725 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 188 flow [2024-01-27 16:19:14,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-01-27 16:19:14,726 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-01-27 16:19:14,726 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 188 flow [2024-01-27 16:19:14,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:14,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:14,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, 1, 1] [2024-01-27 16:19:14,752 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 16:19:14,938 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 16:19:14,939 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 16:19:14,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1755067332, now seen corresponding path program 2 times [2024-01-27 16:19:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749287604] [2024-01-27 16:19:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:15,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749287604] [2024-01-27 16:19:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749287604] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466540539] [2024-01-27 16:19:15,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:19:15,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:15,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:15,031 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 16:19:15,048 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 16:19:15,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:19:15,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:15,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 16:19:15,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:15,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466540539] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-01-27 16:19:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524613320] [2024-01-27 16:19:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:15,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:19:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:15,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:19:15,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-01-27 16:19:15,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-01-27 16:19:15,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:15,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:15,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-01-27 16:19:15,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:15,610 INFO L124 PetriNetUnfolderBase]: 2537/3935 cut-off events. [2024-01-27 16:19:15,611 INFO L125 PetriNetUnfolderBase]: For 2084/2084 co-relation queries the response was YES. [2024-01-27 16:19:15,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9968 conditions, 3935 events. 2537/3935 cut-off events. For 2084/2084 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21464 event pairs, 388 based on Foata normal form. 18/3923 useless extension candidates. Maximal degree in co-relation 9945. Up to 982 conditions per place. [2024-01-27 16:19:15,632 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 85 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2024-01-27 16:19:15,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 121 transitions, 641 flow [2024-01-27 16:19:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:19:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:19:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-01-27 16:19:15,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2024-01-27 16:19:15,634 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 188 flow. Second operand 9 states and 166 transitions. [2024-01-27 16:19:15,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 121 transitions, 641 flow [2024-01-27 16:19:15,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:19:15,648 INFO L231 Difference]: Finished difference. Result has 62 places, 67 transitions, 395 flow [2024-01-27 16:19:15,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=62, PETRI_TRANSITIONS=67} [2024-01-27 16:19:15,651 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-01-27 16:19:15,651 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 395 flow [2024-01-27 16:19:15,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:15,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:15,651 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] [2024-01-27 16:19:15,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-27 16:19:15,863 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 16:19:15,864 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 16:19:15,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1725427506, now seen corresponding path program 3 times [2024-01-27 16:19:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024674344] [2024-01-27 16:19:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024674344] [2024-01-27 16:19:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024674344] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395502575] [2024-01-27 16:19:16,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:19:16,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:16,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:16,023 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 16:19:16,049 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 16:19:16,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 16:19:16,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:16,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 16:19:16,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:16,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395502575] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:16,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:16,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-01-27 16:19:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753066016] [2024-01-27 16:19:16,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:16,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:19:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:16,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:19:16,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-01-27 16:19:16,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-01-27 16:19:16,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:16,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:16,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-01-27 16:19:16,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:16,758 INFO L124 PetriNetUnfolderBase]: 3217/4991 cut-off events. [2024-01-27 16:19:16,758 INFO L125 PetriNetUnfolderBase]: For 9076/9080 co-relation queries the response was YES. [2024-01-27 16:19:16,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 4991 events. 3217/4991 cut-off events. For 9076/9080 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 28306 event pairs, 692 based on Foata normal form. 22/4982 useless extension candidates. Maximal degree in co-relation 16221. Up to 1514 conditions per place. [2024-01-27 16:19:16,781 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 94 selfloop transitions, 46 changer transitions 0/148 dead transitions. [2024-01-27 16:19:16,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 148 transitions, 1026 flow [2024-01-27 16:19:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:19:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:19:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-01-27 16:19:16,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233918128654971 [2024-01-27 16:19:16,782 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 395 flow. Second operand 9 states and 179 transitions. [2024-01-27 16:19:16,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 148 transitions, 1026 flow [2024-01-27 16:19:16,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 148 transitions, 1001 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-01-27 16:19:16,845 INFO L231 Difference]: Finished difference. Result has 73 places, 87 transitions, 724 flow [2024-01-27 16:19:16,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=724, PETRI_PLACES=73, PETRI_TRANSITIONS=87} [2024-01-27 16:19:16,846 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-01-27 16:19:16,846 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 87 transitions, 724 flow [2024-01-27 16:19:16,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:16,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:16,846 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] [2024-01-27 16:19:16,858 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 16:19:17,057 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 16:19:17,058 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 16:19:17,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1475755132, now seen corresponding path program 4 times [2024-01-27 16:19:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162049829] [2024-01-27 16:19:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162049829] [2024-01-27 16:19:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162049829] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753132062] [2024-01-27 16:19:17,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:19:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:17,146 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 16:19:17,168 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 16:19:17,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:19:17,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:17,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 16:19:17,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:17,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753132062] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:17,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-01-27 16:19:17,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416936743] [2024-01-27 16:19:17,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:17,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 16:19:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 16:19:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-01-27 16:19:17,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-01-27 16:19:17,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 87 transitions, 724 flow. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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 16:19:17,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:17,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-01-27 16:19:17,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:18,600 INFO L124 PetriNetUnfolderBase]: 5443/8421 cut-off events. [2024-01-27 16:19:18,601 INFO L125 PetriNetUnfolderBase]: For 30358/30414 co-relation queries the response was YES. [2024-01-27 16:19:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30701 conditions, 8421 events. 5443/8421 cut-off events. For 30358/30414 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 50437 event pairs, 433 based on Foata normal form. 34/7965 useless extension candidates. Maximal degree in co-relation 30665. Up to 1054 conditions per place. [2024-01-27 16:19:18,788 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 197 selfloop transitions, 149 changer transitions 0/353 dead transitions. [2024-01-27 16:19:18,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 353 transitions, 3109 flow [2024-01-27 16:19:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-27 16:19:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-01-27 16:19:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 442 transitions. [2024-01-27 16:19:18,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2024-01-27 16:19:18,790 INFO L175 Difference]: Start difference. First operand has 73 places, 87 transitions, 724 flow. Second operand 26 states and 442 transitions. [2024-01-27 16:19:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 353 transitions, 3109 flow [2024-01-27 16:19:18,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 353 transitions, 2964 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-01-27 16:19:18,945 INFO L231 Difference]: Finished difference. Result has 102 places, 195 transitions, 2080 flow [2024-01-27 16:19:18,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2080, PETRI_PLACES=102, PETRI_TRANSITIONS=195} [2024-01-27 16:19:18,946 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2024-01-27 16:19:18,946 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 195 transitions, 2080 flow [2024-01-27 16:19:18,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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 16:19:18,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:18,947 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] [2024-01-27 16:19:18,963 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 16:19:19,155 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 16:19:19,155 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 16:19:19,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2053998762, now seen corresponding path program 5 times [2024-01-27 16:19:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165959705] [2024-01-27 16:19:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165959705] [2024-01-27 16:19:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165959705] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:19,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685290437] [2024-01-27 16:19:19,428 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:19:19,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:19,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:19,429 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 16:19:19,472 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 16:19:19,569 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:19:19,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:19,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 16:19:19,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:19,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685290437] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:19,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-01-27 16:19:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288477177] [2024-01-27 16:19:19,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:19,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 16:19:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 16:19:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-01-27 16:19:19,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-01-27 16:19:19,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 195 transitions, 2080 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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 16:19:19,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:19,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-01-27 16:19:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:21,266 INFO L124 PetriNetUnfolderBase]: 6542/10037 cut-off events. [2024-01-27 16:19:21,266 INFO L125 PetriNetUnfolderBase]: For 45966/46144 co-relation queries the response was YES. [2024-01-27 16:19:21,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41225 conditions, 10037 events. 6542/10037 cut-off events. For 45966/46144 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 61102 event pairs, 661 based on Foata normal form. 150/10064 useless extension candidates. Maximal degree in co-relation 41179. Up to 1384 conditions per place. [2024-01-27 16:19:21,337 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 185 selfloop transitions, 225 changer transitions 0/417 dead transitions. [2024-01-27 16:19:21,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 417 transitions, 4250 flow [2024-01-27 16:19:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 16:19:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 16:19:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 380 transitions. [2024-01-27 16:19:21,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-01-27 16:19:21,339 INFO L175 Difference]: Start difference. First operand has 102 places, 195 transitions, 2080 flow. Second operand 22 states and 380 transitions. [2024-01-27 16:19:21,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 417 transitions, 4250 flow [2024-01-27 16:19:21,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 417 transitions, 4129 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-01-27 16:19:21,685 INFO L231 Difference]: Finished difference. Result has 132 places, 310 transitions, 3763 flow [2024-01-27 16:19:21,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3763, PETRI_PLACES=132, PETRI_TRANSITIONS=310} [2024-01-27 16:19:21,686 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-01-27 16:19:21,686 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 310 transitions, 3763 flow [2024-01-27 16:19:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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 16:19:21,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:21,686 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] [2024-01-27 16:19:21,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 16:19:21,900 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 16:19:21,900 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 16:19:21,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash -596791786, now seen corresponding path program 6 times [2024-01-27 16:19:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620152387] [2024-01-27 16:19:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620152387] [2024-01-27 16:19:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620152387] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:22,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770291449] [2024-01-27 16:19:22,084 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 16:19:22,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:22,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:22,100 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 16:19:22,125 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 16:19:22,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 16:19:22,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:22,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 16:19:22,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:22,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:22,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770291449] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:22,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2024-01-27 16:19:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644249524] [2024-01-27 16:19:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:22,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:19:22,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:19:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-01-27 16:19:22,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-01-27 16:19:22,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 310 transitions, 3763 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:22,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:22,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-01-27 16:19:22,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:23,588 INFO L124 PetriNetUnfolderBase]: 5465/8415 cut-off events. [2024-01-27 16:19:23,588 INFO L125 PetriNetUnfolderBase]: For 56074/56306 co-relation queries the response was YES. [2024-01-27 16:19:23,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38547 conditions, 8415 events. 5465/8415 cut-off events. For 56074/56306 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 51179 event pairs, 600 based on Foata normal form. 138/8432 useless extension candidates. Maximal degree in co-relation 38488. Up to 2633 conditions per place. [2024-01-27 16:19:23,665 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 193 selfloop transitions, 148 changer transitions 0/349 dead transitions. [2024-01-27 16:19:23,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 349 transitions, 4564 flow [2024-01-27 16:19:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:19:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:19:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-01-27 16:19:23,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032894736842105 [2024-01-27 16:19:23,667 INFO L175 Difference]: Start difference. First operand has 132 places, 310 transitions, 3763 flow. Second operand 8 states and 153 transitions. [2024-01-27 16:19:23,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 349 transitions, 4564 flow [2024-01-27 16:19:24,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 349 transitions, 4397 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-01-27 16:19:24,164 INFO L231 Difference]: Finished difference. Result has 136 places, 310 transitions, 3946 flow [2024-01-27 16:19:24,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3564, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3946, PETRI_PLACES=136, PETRI_TRANSITIONS=310} [2024-01-27 16:19:24,165 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-01-27 16:19:24,166 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 310 transitions, 3946 flow [2024-01-27 16:19:24,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 16:19:24,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:24,166 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] [2024-01-27 16:19:24,180 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 16:19:24,378 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 16:19:24,379 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 16:19:24,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -743635386, now seen corresponding path program 1 times [2024-01-27 16:19:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727279453] [2024-01-27 16:19:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:24,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727279453] [2024-01-27 16:19:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727279453] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939970732] [2024-01-27 16:19:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:24,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:24,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:24,475 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 16:19:24,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 16:19:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:24,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 16:19:24,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:24,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939970732] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:24,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:24,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-01-27 16:19:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473882400] [2024-01-27 16:19:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:24,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-01-27 16:19:24,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-01-27 16:19:24,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 310 transitions, 3946 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:24,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:24,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-01-27 16:19:24,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:25,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L66-->L60-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1][179], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 244#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 37#L48true, 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 36#L74true, Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 257#(<= 1 ~N~0), Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), 4#L60-5true, Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 11#L98-4true, Black: 240#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,245 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-01-27 16:19:25,245 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-27 16:19:25,245 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-27 16:19:25,245 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-27 16:19:25,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L79-->L73-5: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post7#1=|v_thread3Thread1of1ForFork1_#t~post7#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post7#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 778#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 418#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 999#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1203#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 37#L48true, Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 257#(<= 1 ~N~0), 10#L73-5true, Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 28#L61true, Black: 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 11#L98-4true, Black: 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,246 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-01-27 16:19:25,246 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-27 16:19:25,246 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-27 16:19:25,246 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-01-27 16:19:25,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L66-->L60-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1][179], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 15#L50true, 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 244#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 36#L74true, Black: 257#(<= 1 ~N~0), Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), 4#L60-5true, Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 11#L98-4true, Black: 240#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,326 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,327 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,327 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,327 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L79-->L73-5: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post7#1=|v_thread3Thread1of1ForFork1_#t~post7#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post7#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 778#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 418#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 999#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 15#L50true, 1203#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 257#(<= 1 ~N~0), 10#L73-5true, Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 28#L61true, Black: 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 11#L98-4true, Black: 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,328 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,328 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,328 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,328 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L66-->L60-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1][179], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 244#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 37#L48true, 14#L99-1true, 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 36#L74true, Black: 257#(<= 1 ~N~0), Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 4#L60-5true, Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 240#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,329 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,329 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,329 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L79-->L73-5: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post7#1=|v_thread3Thread1of1ForFork1_#t~post7#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post7#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 778#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 418#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 999#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1203#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 437#(<= 1 ~N~0), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 37#L48true, 14#L99-1true, Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 257#(<= 1 ~N~0), 10#L73-5true, Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 28#L61true, Black: 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,330 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,330 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-27 16:19:25,330 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,330 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-01-27 16:19:25,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L66-->L60-5: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1][179], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 15#L50true, 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 244#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 14#L99-1true, 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 36#L74true, Black: 257#(<= 1 ~N~0), Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 4#L60-5true, Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 240#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,398 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-27 16:19:25,398 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 16:19:25,398 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-27 16:19:25,398 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 16:19:25,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L79-->L73-5: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post7#1=|v_thread3Thread1of1ForFork1_#t~post7#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post7#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 830#(<= 1 ~N~0), Black: 1009#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1003#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 778#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1015#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 418#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 1021#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 999#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), Black: 1011#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1007#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1005#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 1001#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 992#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 1013#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 1017#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 15#L50true, 1203#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1372#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 437#(<= 1 ~N~0), Black: 603#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 601#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 607#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 14#L99-1true, Black: 424#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 420#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 257#(<= 1 ~N~0), 10#L73-5true, Black: 422#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 49#(and (= ~res1~0 0) (= ~res2~0 0)), Black: 811#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 599#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 667#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 791#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 813#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 785#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 805#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 28#L61true, Black: 797#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 53#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 248#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 803#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1205#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 242#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 246#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-01-27 16:19:25,399 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-27 16:19:25,399 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 16:19:25,399 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 16:19:25,400 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-27 16:19:25,791 INFO L124 PetriNetUnfolderBase]: 5832/9075 cut-off events. [2024-01-27 16:19:25,792 INFO L125 PetriNetUnfolderBase]: For 81434/81908 co-relation queries the response was YES. [2024-01-27 16:19:25,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43338 conditions, 9075 events. 5832/9075 cut-off events. For 81434/81908 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 56353 event pairs, 1706 based on Foata normal form. 607/9244 useless extension candidates. Maximal degree in co-relation 43279. Up to 3904 conditions per place. [2024-01-27 16:19:25,869 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 275 selfloop transitions, 43 changer transitions 0/389 dead transitions. [2024-01-27 16:19:25,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 389 transitions, 5742 flow [2024-01-27 16:19:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-01-27 16:19:25,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842105263157896 [2024-01-27 16:19:25,870 INFO L175 Difference]: Start difference. First operand has 136 places, 310 transitions, 3946 flow. Second operand 5 states and 89 transitions. [2024-01-27 16:19:25,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 389 transitions, 5742 flow [2024-01-27 16:19:26,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 389 transitions, 5596 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-01-27 16:19:26,196 INFO L231 Difference]: Finished difference. Result has 138 places, 311 transitions, 4087 flow [2024-01-27 16:19:26,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3836, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4087, PETRI_PLACES=138, PETRI_TRANSITIONS=311} [2024-01-27 16:19:26,197 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-01-27 16:19:26,197 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 311 transitions, 4087 flow [2024-01-27 16:19:26,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:26,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:26,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:26,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-27 16:19:26,400 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 16:19:26,401 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 16:19:26,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -352944811, now seen corresponding path program 1 times [2024-01-27 16:19:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177581690] [2024-01-27 16:19:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177581690] [2024-01-27 16:19:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177581690] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773801573] [2024-01-27 16:19:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:27,189 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 16:19:27,194 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 16:19:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:27,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 16:19:27,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:27,334 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 16:19:27,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-01-27 16:19:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:27,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:27,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-01-27 16:19:27,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:19:27,960 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 70 treesize of output 62 [2024-01-27 16:19:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773801573] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:28,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2024-01-27 16:19:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258730683] [2024-01-27 16:19:28,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:28,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-01-27 16:19:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-01-27 16:19:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-01-27 16:19:28,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2024-01-27 16:19:28,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 311 transitions, 4087 flow. Second operand has 29 states, 29 states have (on average 8.137931034482758) internal successors, (236), 29 states have internal predecessors, (236), 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 16:19:28,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:28,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2024-01-27 16:19:28,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:32,204 INFO L124 PetriNetUnfolderBase]: 13309/19363 cut-off events. [2024-01-27 16:19:32,205 INFO L125 PetriNetUnfolderBase]: For 116497/116788 co-relation queries the response was YES. [2024-01-27 16:19:32,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87076 conditions, 19363 events. 13309/19363 cut-off events. For 116497/116788 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 115669 event pairs, 1373 based on Foata normal form. 245/19584 useless extension candidates. Maximal degree in co-relation 85305. Up to 10992 conditions per place. [2024-01-27 16:19:32,334 INFO L140 encePairwiseOnDemand]: 23/38 looper letters, 957 selfloop transitions, 227 changer transitions 3/1218 dead transitions. [2024-01-27 16:19:32,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1218 transitions, 16792 flow [2024-01-27 16:19:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-27 16:19:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-01-27 16:19:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 476 transitions. [2024-01-27 16:19:32,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817813765182186 [2024-01-27 16:19:32,337 INFO L175 Difference]: Start difference. First operand has 138 places, 311 transitions, 4087 flow. Second operand 26 states and 476 transitions. [2024-01-27 16:19:32,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1218 transitions, 16792 flow [2024-01-27 16:19:33,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1218 transitions, 16695 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:19:33,550 INFO L231 Difference]: Finished difference. Result has 179 places, 543 transitions, 7468 flow [2024-01-27 16:19:33,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=7468, PETRI_PLACES=179, PETRI_TRANSITIONS=543} [2024-01-27 16:19:33,551 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 139 predicate places. [2024-01-27 16:19:33,551 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 543 transitions, 7468 flow [2024-01-27 16:19:33,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.137931034482758) internal successors, (236), 29 states have internal predecessors, (236), 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 16:19:33,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:33,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:33,563 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 16:19:33,762 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 16:19:33,763 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 16:19:33,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1869960215, now seen corresponding path program 2 times [2024-01-27 16:19:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754222678] [2024-01-27 16:19:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:34,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754222678] [2024-01-27 16:19:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754222678] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:34,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841409966] [2024-01-27 16:19:34,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:19:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:34,193 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 16:19:34,193 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 16:19:34,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:19:34,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:34,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 41 conjunts are in the unsatisfiable core [2024-01-27 16:19:34,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:34,319 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 16:19:34,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:19:34,555 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 17 treesize of output 15 [2024-01-27 16:19:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:34,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:35,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-01-27 16:19:35,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:19:35,087 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 70 treesize of output 62 [2024-01-27 16:19:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841409966] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:35,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:35,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2024-01-27 16:19:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200966433] [2024-01-27 16:19:35,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:35,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-01-27 16:19:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:35,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-01-27 16:19:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2024-01-27 16:19:35,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2024-01-27 16:19:35,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 543 transitions, 7468 flow. Second operand has 37 states, 37 states have (on average 6.027027027027027) internal successors, (223), 37 states have internal predecessors, (223), 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 16:19:35,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:35,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2024-01-27 16:19:35,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:48,616 INFO L124 PetriNetUnfolderBase]: 38310/53839 cut-off events. [2024-01-27 16:19:48,617 INFO L125 PetriNetUnfolderBase]: For 480802/480802 co-relation queries the response was YES. [2024-01-27 16:19:49,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299159 conditions, 53839 events. 38310/53839 cut-off events. For 480802/480802 co-relation queries the response was YES. Maximal size of possible extension queue 1485. Compared 333032 event pairs, 2753 based on Foata normal form. 3/53842 useless extension candidates. Maximal degree in co-relation 297093. Up to 22088 conditions per place. [2024-01-27 16:19:49,430 INFO L140 encePairwiseOnDemand]: 20/38 looper letters, 1804 selfloop transitions, 990 changer transitions 11/2806 dead transitions. [2024-01-27 16:19:49,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 2806 transitions, 40297 flow [2024-01-27 16:19:49,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-01-27 16:19:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-01-27 16:19:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1347 transitions. [2024-01-27 16:19:49,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3617078410311493 [2024-01-27 16:19:49,435 INFO L175 Difference]: Start difference. First operand has 179 places, 543 transitions, 7468 flow. Second operand 98 states and 1347 transitions. [2024-01-27 16:19:49,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 2806 transitions, 40297 flow [2024-01-27 16:19:55,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 2806 transitions, 39953 flow, removed 171 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:55,916 INFO L231 Difference]: Finished difference. Result has 344 places, 1527 transitions, 25032 flow [2024-01-27 16:19:55,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=7376, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=25032, PETRI_PLACES=344, PETRI_TRANSITIONS=1527} [2024-01-27 16:19:55,917 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 304 predicate places. [2024-01-27 16:19:55,917 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 1527 transitions, 25032 flow [2024-01-27 16:19:55,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.027027027027027) internal successors, (223), 37 states have internal predecessors, (223), 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 16:19:55,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:55,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:55,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-01-27 16:19:56,118 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 16:19:56,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 16:19:56,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1773127533, now seen corresponding path program 3 times [2024-01-27 16:19:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:56,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543404315] [2024-01-27 16:19:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543404315] [2024-01-27 16:19:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543404315] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198845044] [2024-01-27 16:19:56,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:19:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:56,528 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 16:19:56,529 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 16:19:56,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 16:19:56,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:56,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 41 conjunts are in the unsatisfiable core [2024-01-27 16:19:56,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:56,664 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 16:19:56,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:19:56,859 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 17 treesize of output 15 [2024-01-27 16:19:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:56,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:57,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-01-27 16:19:57,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:19:57,302 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 70 treesize of output 62 [2024-01-27 16:19:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198845044] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:57,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2024-01-27 16:19:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065107198] [2024-01-27 16:19:57,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-01-27 16:19:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-01-27 16:19:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2024-01-27 16:19:57,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2024-01-27 16:19:57,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1527 transitions, 25032 flow. Second operand has 36 states, 36 states have (on average 5.972222222222222) internal successors, (215), 36 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:57,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:57,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2024-01-27 16:19:57,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand