./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.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-two-queue.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 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:23:30,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:23:30,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:23:30,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:23:30,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:23:30,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:23:30,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:23:30,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:23:30,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:23:30,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:23:30,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:23:30,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:23:30,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:23:30,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:23:30,965 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:23:30,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:23:30,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:23:30,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:23:30,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:23:30,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:23:30,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:23:30,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:23:30,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:23:30,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:23:30,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:23:30,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:23:30,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:23:30,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:23:30,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:23:30,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:23:30,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:23:30,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:23:30,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:23:30,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:23:30,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:23:30,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:23:30,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:23:30,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:23:30,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:23:30,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:23:30,977 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:23:30,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:23:30,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:23:30,977 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 -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:23:31,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:23:31,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:23:31,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:23:31,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:23:31,286 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:23:31,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-02-19 15:23:32,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:23:32,530 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:23:32,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-02-19 15:23:32,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc41df818/c767006566944850b1ec9961f5f03e78/FLAG06325baee [2024-02-19 15:23:32,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc41df818/c767006566944850b1ec9961f5f03e78 [2024-02-19 15:23:32,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:23:32,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:23:32,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:23:32,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:23:32,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:23:32,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739e5990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32, skipping insertion in model container [2024-02-19 15:23:32,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,579 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:23:32,744 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-two-queue.wvr.c[2987,3000] [2024-02-19 15:23:32,762 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:23:32,772 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:23:32,803 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-two-queue.wvr.c[2987,3000] [2024-02-19 15:23:32,811 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:23:32,832 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:23:32,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32 WrapperNode [2024-02-19 15:23:32,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:23:32,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:23:32,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:23:32,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:23:32,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,888 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 208 [2024-02-19 15:23:32,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:23:32,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:23:32,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:23:32,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:23:32,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,931 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 6, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2024-02-19 15:23:32,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:23:32,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:23:32,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:23:32,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:23:32,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (1/1) ... [2024-02-19 15:23:32,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:23:32,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:23:32,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:23:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:23:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:23:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:23:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:23:33,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:23:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:23:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:23:33,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:23:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:23:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:23:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:23:33,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:23:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:23:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:23:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:23:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:23:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:23:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:23:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:23:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:23:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:23:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:23:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:23:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:23:33,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:23:33,051 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:23:33,171 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:23:33,174 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:23:33,449 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:23:33,449 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:23:33,670 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:23:33,671 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:23:33,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:23:33 BoogieIcfgContainer [2024-02-19 15:23:33,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:23:33,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:23:33,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:23:33,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:23:33,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:23:32" (1/3) ... [2024-02-19 15:23:33,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e582ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:23:33, skipping insertion in model container [2024-02-19 15:23:33,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:23:32" (2/3) ... [2024-02-19 15:23:33,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e582ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:23:33, skipping insertion in model container [2024-02-19 15:23:33,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:23:33" (3/3) ... [2024-02-19 15:23:33,680 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-02-19 15:23:33,695 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:23:33,695 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:23:33,695 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:23:33,724 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:23:33,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2024-02-19 15:23:33,784 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-02-19 15:23:33,785 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:23:33,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2024-02-19 15:23:33,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2024-02-19 15:23:33,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 60 flow [2024-02-19 15:23:33,803 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:23:33,808 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;@2cb3cde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:23:33,808 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:23:33,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:23:33,820 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-02-19 15:23:33,820 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:23:33,820 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:33,821 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:23:33,821 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:23:33,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash 616914278, now seen corresponding path program 1 times [2024-02-19 15:23:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:23:33,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512541052] [2024-02-19 15:23:33,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:33,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:23:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:23:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:23:34,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512541052] [2024-02-19 15:23:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512541052] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:23:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:23:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:23:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910803557] [2024-02-19 15:23:34,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:23:34,185 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:23:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:23:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:23:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:23:34,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-02-19 15:23:34,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:23:34,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-02-19 15:23:34,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:34,324 INFO L124 PetriNetUnfolderBase]: 106/203 cut-off events. [2024-02-19 15:23:34,325 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-02-19 15:23:34,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 203 events. 106/203 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 711 event pairs, 24 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 332. Up to 131 conditions per place. [2024-02-19 15:23:34,328 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 29 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2024-02-19 15:23:34,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 159 flow [2024-02-19 15:23:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:23:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:23:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-02-19 15:23:34,337 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2024-02-19 15:23:34,339 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2024-02-19 15:23:34,339 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 36 transitions, 159 flow [2024-02-19 15:23:34,340 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,340 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:34,340 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:23:34,340 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:23:34,340 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:23:34,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1908615879, now seen corresponding path program 1 times [2024-02-19 15:23:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:23:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011307218] [2024-02-19 15:23:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:23:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:23:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:23:34,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011307218] [2024-02-19 15:23:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011307218] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:23:34,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:23:34,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:23:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060420371] [2024-02-19 15:23:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:23:34,447 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:23:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:23:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:23:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:23:34,448 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-02-19 15:23:34,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 36 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:23:34,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-02-19 15:23:34,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:34,526 INFO L124 PetriNetUnfolderBase]: 92/183 cut-off events. [2024-02-19 15:23:34,526 INFO L125 PetriNetUnfolderBase]: For 37/43 co-relation queries the response was YES. [2024-02-19 15:23:34,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 183 events. 92/183 cut-off events. For 37/43 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 577 event pairs, 19 based on Foata normal form. 6/184 useless extension candidates. Maximal degree in co-relation 411. Up to 126 conditions per place. [2024-02-19 15:23:34,528 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-02-19 15:23:34,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 243 flow [2024-02-19 15:23:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:23:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:23:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2024-02-19 15:23:34,529 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-19 15:23:34,530 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2024-02-19 15:23:34,530 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 39 transitions, 243 flow [2024-02-19 15:23:34,530 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,530 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:34,531 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:23:34,531 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:23:34,531 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:23:34,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1963675987, now seen corresponding path program 1 times [2024-02-19 15:23:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:23:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121730279] [2024-02-19 15:23:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:23:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:23:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:23:34,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121730279] [2024-02-19 15:23:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121730279] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:23:34,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:23:34,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:23:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262792930] [2024-02-19 15:23:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:23:34,632 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:23:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:23:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:23:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:23:34,633 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-02-19 15:23:34,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 39 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:23:34,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-02-19 15:23:34,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:34,691 INFO L124 PetriNetUnfolderBase]: 86/174 cut-off events. [2024-02-19 15:23:34,691 INFO L125 PetriNetUnfolderBase]: For 51/55 co-relation queries the response was YES. [2024-02-19 15:23:34,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 174 events. 86/174 cut-off events. For 51/55 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 469 event pairs, 27 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 525. Up to 120 conditions per place. [2024-02-19 15:23:34,693 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 30 selfloop transitions, 3 changer transitions 9/45 dead transitions. [2024-02-19 15:23:34,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 45 transitions, 366 flow [2024-02-19 15:23:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:23:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:23:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-02-19 15:23:34,694 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-02-19 15:23:34,694 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2024-02-19 15:23:34,694 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 45 transitions, 366 flow [2024-02-19 15:23:34,694 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,694 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:34,694 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:23:34,694 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:23:34,695 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:23:34,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1150726720, now seen corresponding path program 1 times [2024-02-19 15:23:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:23:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714402798] [2024-02-19 15:23:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:23:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:34,831 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 15:23:34,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:23:34,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714402798] [2024-02-19 15:23:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714402798] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:23:34,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:23:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:23:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579630638] [2024-02-19 15:23:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:23:34,835 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:23:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:23:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:23:34,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:23:34,838 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-02-19 15:23:34,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 45 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:23:34,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-02-19 15:23:34,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:34,915 INFO L124 PetriNetUnfolderBase]: 102/221 cut-off events. [2024-02-19 15:23:34,915 INFO L125 PetriNetUnfolderBase]: For 124/136 co-relation queries the response was YES. [2024-02-19 15:23:34,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 221 events. 102/221 cut-off events. For 124/136 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 691 event pairs, 34 based on Foata normal form. 6/223 useless extension candidates. Maximal degree in co-relation 654. Up to 163 conditions per place. [2024-02-19 15:23:34,919 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 32 selfloop transitions, 2 changer transitions 26/63 dead transitions. [2024-02-19 15:23:34,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 63 transitions, 645 flow [2024-02-19 15:23:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:23:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:23:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2024-02-19 15:23:34,921 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-02-19 15:23:34,923 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2024-02-19 15:23:34,923 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 63 transitions, 645 flow [2024-02-19 15:23:34,923 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:34,923 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:34,923 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] [2024-02-19 15:23:34,923 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:23:34,923 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:23:34,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash -755227514, now seen corresponding path program 1 times [2024-02-19 15:23:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:23:34,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892875572] [2024-02-19 15:23:34,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:23:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:23:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:23:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892875572] [2024-02-19 15:23:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892875572] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:23:35,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:23:35,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:23:35,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272271829] [2024-02-19 15:23:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:23:35,044 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:23:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:23:35,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:23:35,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:23:35,046 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-02-19 15:23:35,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 63 transitions, 645 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:35,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:23:35,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-02-19 15:23:35,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:35,130 INFO L124 PetriNetUnfolderBase]: 126/293 cut-off events. [2024-02-19 15:23:35,130 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-02-19 15:23:35,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 293 events. 126/293 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1120 event pairs, 52 based on Foata normal form. 14/301 useless extension candidates. Maximal degree in co-relation 779. Up to 205 conditions per place. [2024-02-19 15:23:35,132 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 33 selfloop transitions, 2 changer transitions 52/90 dead transitions. [2024-02-19 15:23:35,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 90 transitions, 1116 flow [2024-02-19 15:23:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:23:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:23:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2024-02-19 15:23:35,138 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-19 15:23:35,139 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2024-02-19 15:23:35,139 INFO L507 AbstractCegarLoop]: Abstraction has has 39 places, 90 transitions, 1116 flow [2024-02-19 15:23:35,140 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:35,140 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:35,140 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:23:35,140 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:23:35,140 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:23:35,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1576580726, now seen corresponding path program 1 times [2024-02-19 15:23:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:23:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199472660] [2024-02-19 15:23:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:23:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:36,547 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 15:23:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:23:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199472660] [2024-02-19 15:23:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199472660] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:23:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043927754] [2024-02-19 15:23:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:36,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:23:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:23:36,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:23:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:23:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:36,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-19 15:23:36,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:23:36,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-19 15:23:37,188 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 15:23:37,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:23:38,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:23:38,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2024-02-19 15:23:38,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:23:38,414 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 22 treesize of output 18 [2024-02-19 15:23:38,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:38,433 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-02-19 15:23:38,446 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:23:38,447 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 22 treesize of output 1 [2024-02-19 15:23:38,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:38,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-02-19 15:23:39,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:23:39,146 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 35 treesize of output 31 [2024-02-19 15:23:39,168 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:23:39,169 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 28 treesize of output 1 [2024-02-19 15:23:39,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:39,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-02-19 15:23:39,193 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:23:39,193 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 35 treesize of output 1 [2024-02-19 15:23:39,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:39,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-02-19 15:23:39,222 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:23:39,223 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 28 treesize of output 1 [2024-02-19 15:23:39,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:39,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-02-19 15:23:39,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:39,241 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-02-19 15:23:39,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:23:39,251 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-02-19 15:23:39,260 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:23:39,260 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 35 treesize of output 1 [2024-02-19 15:23:39,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:23:39,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 101 treesize of output 85 [2024-02-19 15:23:39,486 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 15:23:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043927754] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:23:39,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:23:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2024-02-19 15:23:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812351000] [2024-02-19 15:23:39,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:23:39,488 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-02-19 15:23:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:23:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-02-19 15:23:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2024-02-19 15:23:39,512 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2024-02-19 15:23:39,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 90 transitions, 1116 flow. Second operand has 39 states, 39 states have (on average 4.666666666666667) internal successors, (182), 39 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:39,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:23:39,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2024-02-19 15:23:39,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:45,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:23:49,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:23:53,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:23:57,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:24:01,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:24:05,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-02-19 15:24:07,861 INFO L124 PetriNetUnfolderBase]: 691/1358 cut-off events. [2024-02-19 15:24:07,861 INFO L125 PetriNetUnfolderBase]: For 4159/4159 co-relation queries the response was YES. [2024-02-19 15:24:07,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8334 conditions, 1358 events. 691/1358 cut-off events. For 4159/4159 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7079 event pairs, 71 based on Foata normal form. 60/1407 useless extension candidates. Maximal degree in co-relation 4240. Up to 1009 conditions per place. [2024-02-19 15:24:07,869 INFO L140 encePairwiseOnDemand]: 11/27 looper letters, 166 selfloop transitions, 146 changer transitions 114/427 dead transitions. [2024-02-19 15:24:07,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 427 transitions, 5633 flow [2024-02-19 15:24:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-02-19 15:24:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-02-19 15:24:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 604 transitions. [2024-02-19 15:24:07,873 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.31507563901930097 [2024-02-19 15:24:07,873 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 82 predicate places. [2024-02-19 15:24:07,874 INFO L507 AbstractCegarLoop]: Abstraction has has 109 places, 427 transitions, 5633 flow [2024-02-19 15:24:07,874 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.666666666666667) internal successors, (182), 39 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:24:07,874 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:24:07,874 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:24:07,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:24:08,086 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 15:24:08,086 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:24:08,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:24:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 987270702, now seen corresponding path program 2 times [2024-02-19 15:24:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:24:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574421425] [2024-02-19 15:24:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:24:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:24:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:24:09,038 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 15:24:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:24:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574421425] [2024-02-19 15:24:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574421425] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:24:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899473550] [2024-02-19 15:24:09,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:24:09,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:24:09,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:24:09,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:24:09,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 15:24:09,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:24:09,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:24:09,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjunts are in the unsatisfiable core [2024-02-19 15:24:09,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:24:09,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-02-19 15:24:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:24:09,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:24:09,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:24:09,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:24:09,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:24:09,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:24:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:24:09,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:24:09,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:24:09,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:24:09,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-19 15:24:09,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-19 15:24:09,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-19 15:24:09,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:24:09,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-02-19 15:24:09,829 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 15:24:09,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:24:11,106 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2024-02-19 15:24:11,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 349 treesize of output 359 [2024-02-19 15:24:11,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:24:11,135 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 231 treesize of output 227 [2024-02-19 15:24:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 Killed by 15