./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.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 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:54:08,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:54:08,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:54:08,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:54:08,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:54:08,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:54:08,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:54:08,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:54:08,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:54:08,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:54:08,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:54:08,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:54:08,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:54:08,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:54:08,867 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:54:08,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:54:08,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:54:08,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:54:08,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:54:08,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:54:08,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:54:08,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:54:08,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:54:08,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:54:08,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:54:08,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:54:08,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:54:08,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:54:08,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:54:08,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:54:08,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:54:08,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:54:08,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:54:08,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:54:08,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:54:08,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:54:08,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:54:08,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:54:08,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:54:08,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:54:08,881 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:54:08,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:54:08,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:54:08,882 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 -> 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:54:09,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:54:09,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:54:09,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:54:09,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:54:09,292 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:54:09,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2024-02-19 14:54:10,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:54:10,823 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:54:10,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2024-02-19 14:54:10,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa168566/88e3f609642d484bb03c68f10e77c96c/FLAG1e24fc336 [2024-02-19 14:54:10,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa168566/88e3f609642d484bb03c68f10e77c96c [2024-02-19 14:54:10,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:54:10,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:54:10,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:54:10,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:54:10,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:54:10,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:54:10" (1/1) ... [2024-02-19 14:54:10,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4347edfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:10, skipping insertion in model container [2024-02-19 14:54:10,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:54:10" (1/1) ... [2024-02-19 14:54:10,902 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:54:11,139 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-min-max-dec.wvr.c[3019,3032] [2024-02-19 14:54:11,158 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:54:11,173 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:54:11,215 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-min-max-dec.wvr.c[3019,3032] [2024-02-19 14:54:11,228 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:54:11,246 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:54:11,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11 WrapperNode [2024-02-19 14:54:11,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:54:11,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:54:11,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:54:11,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:54:11,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,311 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-02-19 14:54:11,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:54:11,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:54:11,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:54:11,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:54:11,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,355 INFO L175 MemorySlicer]: Split 20 memory accesses to 6 slices as follows [2, 2, 10, 2, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 2, 1, 1, 1]. [2024-02-19 14:54:11,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:54:11,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:54:11,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:54:11,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:54:11,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (1/1) ... [2024-02-19 14:54:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:54:11,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:54:11,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 14:54:11,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 14:54:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:54:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:54:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:54:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:54:11,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:54:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:54:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-19 14:54:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:54:11,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:54:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:54:11,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:54:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:54:11,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:54:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-19 14:54:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:54:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 14:54:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:54:11,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:54:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:54:11,471 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:54:11,636 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:54:11,639 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:54:12,060 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:54:12,060 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:54:12,295 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:54:12,295 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 14:54:12,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:54:12 BoogieIcfgContainer [2024-02-19 14:54:12,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:54:12,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:54:12,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:54:12,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:54:12,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:54:10" (1/3) ... [2024-02-19 14:54:12,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddd5528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:54:12, skipping insertion in model container [2024-02-19 14:54:12,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:54:11" (2/3) ... [2024-02-19 14:54:12,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddd5528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:54:12, skipping insertion in model container [2024-02-19 14:54:12,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:54:12" (3/3) ... [2024-02-19 14:54:12,305 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2024-02-19 14:54:12,326 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:54:12,326 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:54:12,326 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:54:12,391 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-19 14:54:12,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 120 flow [2024-02-19 14:54:12,478 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2024-02-19 14:54:12,478 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:54:12,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 4/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-02-19 14:54:12,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 120 flow [2024-02-19 14:54:12,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 41 transitions, 106 flow [2024-02-19 14:54:12,505 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:54:12,512 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b37aa38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:54:12,513 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:54:12,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:54:12,536 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-02-19 14:54:12,536 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:54:12,536 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:54:12,537 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:54:12,537 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:54:12,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:54:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash 412258180, now seen corresponding path program 1 times [2024-02-19 14:54:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:54:12,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944716642] [2024-02-19 14:54:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:54:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:54:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:54:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944716642] [2024-02-19 14:54:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944716642] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:54:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:54:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:54:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706796080] [2024-02-19 14:54:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:54:13,027 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:54:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:54:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:54:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:54:13,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:54:13,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:13,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:54:13,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:54:13,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:54:13,845 INFO L124 PetriNetUnfolderBase]: 3334/4776 cut-off events. [2024-02-19 14:54:13,845 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2024-02-19 14:54:13,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9584 conditions, 4776 events. 3334/4776 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 25839 event pairs, 1640 based on Foata normal form. 146/4881 useless extension candidates. Maximal degree in co-relation 8540. Up to 3125 conditions per place. [2024-02-19 14:54:13,893 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-02-19 14:54:13,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 247 flow [2024-02-19 14:54:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:54:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:54:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-19 14:54:13,909 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5543478260869565 [2024-02-19 14:54:13,930 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-02-19 14:54:13,931 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 247 flow [2024-02-19 14:54:13,931 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:13,931 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:54:13,931 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:54:13,931 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:54:13,932 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:54:13,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:54:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash 524795066, now seen corresponding path program 1 times [2024-02-19 14:54:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:54:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054090814] [2024-02-19 14:54:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:54:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:54:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:54:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054090814] [2024-02-19 14:54:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054090814] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:54:14,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:54:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:54:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111570327] [2024-02-19 14:54:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:54:14,097 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:54:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:54:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:54:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:54:14,108 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:54:14,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-02-19 14:54:14,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:54:14,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:54:14,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:54:14,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3NotInUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 6#L113-3true, 46#L56-4true]) [2024-02-19 14:54:14,351 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:54:14,351 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:54:14,351 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:54:14,351 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:54:14,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse1 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse2 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int#2_79|)))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3NotInUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 6#L113-3true, 46#L56-4true]) [2024-02-19 14:54:14,416 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,416 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:54:14,416 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,417 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:54:14,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:54:14,421 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,421 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:54:14,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,422 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:54:14,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse1 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse2 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int#2_79|)))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 46#L56-4true]) [2024-02-19 14:54:14,465 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:54:14,465 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:54:14,465 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:54:14,466 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:54:14,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 37#L114-1true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:54:14,472 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:54:14,473 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:54:14,473 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:54:14,473 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:54:14,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse1 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse2 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int#2_79|)))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 37#L114-1true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 46#L56-4true]) [2024-02-19 14:54:14,509 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:54:14,509 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:54:14,509 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:54:14,509 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:54:14,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse1 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse2 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int#2_79|)))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 12#L74-4true, 46#L56-4true]) [2024-02-19 14:54:14,512 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:54:14,512 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,512 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,512 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:54:14,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 12#L74-4true, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:54:14,513 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:54:14,513 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:54:14,513 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:54:14,513 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:54:14,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse1 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse2 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (= (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse1 .cse2 (+ (- 1) .cse0))) |v_#memory_int#2_79|)))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3InUse, 37#L114-1true, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 46#L56-4true]) [2024-02-19 14:54:14,582 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-02-19 14:54:14,582 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:54:14,582 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:54:14,582 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:54:14,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3InUse, 37#L114-1true, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:54:14,583 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:54:14,583 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,583 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:54:14,584 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:54:14,822 INFO L124 PetriNetUnfolderBase]: 4347/6305 cut-off events. [2024-02-19 14:54:14,822 INFO L125 PetriNetUnfolderBase]: For 2069/2204 co-relation queries the response was YES. [2024-02-19 14:54:14,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18077 conditions, 6305 events. 4347/6305 cut-off events. For 2069/2204 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 34543 event pairs, 1645 based on Foata normal form. 232/6490 useless extension candidates. Maximal degree in co-relation 16572. Up to 4050 conditions per place. [2024-02-19 14:54:14,915 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 75 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2024-02-19 14:54:14,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 540 flow [2024-02-19 14:54:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:54:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:54:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-19 14:54:14,917 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5543478260869565 [2024-02-19 14:54:14,918 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-02-19 14:54:14,918 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 88 transitions, 540 flow [2024-02-19 14:54:14,919 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-02-19 14:54:14,919 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:54:14,919 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:54:14,919 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:54:14,919 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:54:14,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:54:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash 386795485, now seen corresponding path program 1 times [2024-02-19 14:54:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:54:14,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422594419] [2024-02-19 14:54:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:54:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:54:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:54:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422594419] [2024-02-19 14:54:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422594419] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:54:15,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:54:15,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:54:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729013143] [2024-02-19 14:54:15,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:54:15,043 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:54:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:54:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:54:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:54:15,058 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:54:15,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 88 transitions, 540 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:15,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:54:15,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:54:15,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:54:16,047 INFO L124 PetriNetUnfolderBase]: 6118/8923 cut-off events. [2024-02-19 14:54:16,047 INFO L125 PetriNetUnfolderBase]: For 9637/9873 co-relation queries the response was YES. [2024-02-19 14:54:16,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32972 conditions, 8923 events. 6118/8923 cut-off events. For 9637/9873 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 51225 event pairs, 1559 based on Foata normal form. 480/9364 useless extension candidates. Maximal degree in co-relation 30275. Up to 5565 conditions per place. [2024-02-19 14:54:16,154 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 127 selfloop transitions, 6 changer transitions 0/142 dead transitions. [2024-02-19 14:54:16,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 142 transitions, 1151 flow [2024-02-19 14:54:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:54:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:54:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-02-19 14:54:16,157 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5597826086956522 [2024-02-19 14:54:16,157 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-02-19 14:54:16,158 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 142 transitions, 1151 flow [2024-02-19 14:54:16,158 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:16,158 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:54:16,158 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:54:16,159 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:54:16,159 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:54:16,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:54:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2106135688, now seen corresponding path program 1 times [2024-02-19 14:54:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:54:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950081280] [2024-02-19 14:54:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:54:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:54:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:54:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950081280] [2024-02-19 14:54:16,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950081280] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:54:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:54:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:54:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775555651] [2024-02-19 14:54:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:54:16,390 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:54:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:54:16,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:54:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:54:16,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-19 14:54:16,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 142 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:16,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:54:16,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-19 14:54:16,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:54:17,414 INFO L124 PetriNetUnfolderBase]: 6172/9024 cut-off events. [2024-02-19 14:54:17,414 INFO L125 PetriNetUnfolderBase]: For 19204/19534 co-relation queries the response was YES. [2024-02-19 14:54:17,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40854 conditions, 9024 events. 6172/9024 cut-off events. For 19204/19534 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 52150 event pairs, 1685 based on Foata normal form. 120/9105 useless extension candidates. Maximal degree in co-relation 37502. Up to 7578 conditions per place. [2024-02-19 14:54:17,522 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 131 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-02-19 14:54:17,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 143 transitions, 1425 flow [2024-02-19 14:54:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:54:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:54:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-02-19 14:54:17,530 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-02-19 14:54:17,532 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-02-19 14:54:17,533 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 143 transitions, 1425 flow [2024-02-19 14:54:17,533 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:17,533 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:54:17,533 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:54:17,534 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:54:17,535 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:54:17,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:54:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1093007264, now seen corresponding path program 1 times [2024-02-19 14:54:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:54:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59573222] [2024-02-19 14:54:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:54:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:54:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:54:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59573222] [2024-02-19 14:54:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59573222] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:54:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392630624] [2024-02-19 14:54:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:54:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:54:18,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:54:18,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:54:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:18,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjunts are in the unsatisfiable core [2024-02-19 14:54:18,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:54:18,417 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-02-19 14:54:18,613 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-02-19 14:54:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:54:18,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:54:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:54:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392630624] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:54:19,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:54:19,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 22 [2024-02-19 14:54:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631463836] [2024-02-19 14:54:19,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:54:19,243 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-19 14:54:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:54:19,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-19 14:54:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-02-19 14:54:19,295 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-02-19 14:54:19,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 143 transitions, 1425 flow. Second operand has 22 states, 22 states have (on average 15.454545454545455) internal successors, (340), 22 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:19,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:54:19,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-02-19 14:54:19,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:54:37,479 INFO L124 PetriNetUnfolderBase]: 101565/147233 cut-off events. [2024-02-19 14:54:37,480 INFO L125 PetriNetUnfolderBase]: For 246783/247973 co-relation queries the response was YES. [2024-02-19 14:54:37,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782450 conditions, 147233 events. 101565/147233 cut-off events. For 246783/247973 co-relation queries the response was YES. Maximal size of possible extension queue 5367. Compared 1163757 event pairs, 2287 based on Foata normal form. 673/147868 useless extension candidates. Maximal degree in co-relation 773748. Up to 120717 conditions per place. [2024-02-19 14:54:38,854 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 1364 selfloop transitions, 265 changer transitions 1681/3317 dead transitions. [2024-02-19 14:54:38,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 3317 transitions, 40225 flow [2024-02-19 14:54:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-02-19 14:54:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2024-02-19 14:54:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 2438 transitions. [2024-02-19 14:54:38,868 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-02-19 14:54:38,869 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 98 predicate places. [2024-02-19 14:54:38,869 INFO L507 AbstractCegarLoop]: Abstraction has has 148 places, 3317 transitions, 40225 flow [2024-02-19 14:54:38,870 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 15.454545454545455) internal successors, (340), 22 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:38,870 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:54:38,870 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:54:38,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 14:54:39,084 WARN L489 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-02-19 14:54:39,085 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:54:39,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:54:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash 362681906, now seen corresponding path program 2 times [2024-02-19 14:54:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:54:39,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258741511] [2024-02-19 14:54:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:54:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:54:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:54:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 14:54:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:54:39,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258741511] [2024-02-19 14:54:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258741511] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:54:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:54:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:54:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190012504] [2024-02-19 14:54:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:54:39,299 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:54:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:54:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:54:39,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:54:39,304 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-02-19 14:54:39,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 3317 transitions, 40225 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:54:39,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:54:39,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-02-19 14:54:39,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:55:49,154 INFO L124 PetriNetUnfolderBase]: 154273/222083 cut-off events. [2024-02-19 14:55:49,155 INFO L125 PetriNetUnfolderBase]: For 664029/666183 co-relation queries the response was YES. [2024-02-19 14:55:49,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369764 conditions, 222083 events. 154273/222083 cut-off events. For 664029/666183 co-relation queries the response was YES. Maximal size of possible extension queue 7683. Compared 1806505 event pairs, 1773 based on Foata normal form. 843/222898 useless extension candidates. Maximal degree in co-relation 1357801. Up to 182426 conditions per place. [2024-02-19 14:55:50,817 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 1139 selfloop transitions, 2 changer transitions 5763/6927 dead transitions. [2024-02-19 14:55:50,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 6927 transitions, 98163 flow [2024-02-19 14:55:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:55:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:55:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-02-19 14:55:50,819 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6130434782608696 [2024-02-19 14:55:50,819 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 102 predicate places. [2024-02-19 14:55:50,819 INFO L507 AbstractCegarLoop]: Abstraction has has 152 places, 6927 transitions, 98163 flow [2024-02-19 14:55:50,819 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:55:50,820 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:55:50,820 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:55:50,820 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:55:50,820 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:55:50,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:55:50,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1760284662, now seen corresponding path program 3 times [2024-02-19 14:55:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:55:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211274559] [2024-02-19 14:55:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:55:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:55:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:55:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:55:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:55:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211274559] [2024-02-19 14:55:51,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211274559] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:55:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444734825] [2024-02-19 14:55:51,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:55:51,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:55:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:55:51,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:55:51,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 14:55:51,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 14:55:51,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:55:51,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-19 14:55:51,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:55:51,361 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-02-19 14:55:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:55:51,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:55:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:55:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444734825] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 14:55:51,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 14:55:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 18 [2024-02-19 14:55:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78026192] [2024-02-19 14:55:51,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:55:51,616 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:55:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:55:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:55:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-02-19 14:55:51,629 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-02-19 14:55:51,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 6927 transitions, 98163 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:55:51,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:55:51,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-02-19 14:55:51,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand