./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:06:05,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:06:05,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:06:05,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:06:05,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:06:05,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:06:05,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:06:05,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:06:05,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:06:05,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:06:05,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:06:05,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:06:05,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:06:05,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:06:05,249 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:06:05,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:06:05,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:06:05,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:06:05,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:06:05,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:06:05,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:06:05,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:06:05,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:06:05,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:06:05,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:06:05,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:06:05,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:06:05,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:06:05,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:06:05,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:06:05,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:06:05,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:06:05,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:05,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:06:05,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:06:05,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:06:05,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:06:05,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:06:05,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:06:05,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:06:05,256 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:06:05,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:06:05,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:06:05,256 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2024-01-27 16:06:05,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:06:05,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:06:05,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:06:05,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:06:05,523 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:06:05,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-01-27 16:06:06,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:06:06,717 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:06:06,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-01-27 16:06:06,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618b5576c/337409b1f12f44f399aadc97777dbd1d/FLAGcdd64ea42 [2024-01-27 16:06:06,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618b5576c/337409b1f12f44f399aadc97777dbd1d [2024-01-27 16:06:06,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:06:06,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:06:06,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:06,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:06:06,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:06:06,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:06" (1/1) ... [2024-01-27 16:06:06,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cdc1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:06, skipping insertion in model container [2024-01-27 16:06:06,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:06" (1/1) ... [2024-01-27 16:06:06,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:06:07,124 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-01-27 16:06:07,134 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-01-27 16:06:07,138 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-01-27 16:06:07,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:07,162 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:06:07,209 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-01-27 16:06:07,213 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-01-27 16:06:07,216 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-01-27 16:06:07,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:07,273 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:06:07,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07 WrapperNode [2024-01-27 16:06:07,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:07,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:07,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:06:07,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:06:07,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,342 INFO L138 Inliner]: procedures = 275, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2024-01-27 16:06:07,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:07,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:06:07,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:06:07,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:06:07,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,386 INFO L175 MemorySlicer]: Split 55 memory accesses to 7 slices as follows [2, 8, 32, 5, 4, 2, 2]. 58 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 8, 0, 5, 0, 0, 0]. The 20 writes are split as follows [0, 0, 15, 0, 3, 1, 1]. [2024-01-27 16:06:07,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:06:07,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:06:07,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:06:07,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:06:07,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (1/1) ... [2024-01-27 16:06:07,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:07,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:07,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:06:07,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:06:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:06:07,501 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:06:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:06:07,501 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 16:06:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-27 16:06:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 16:06:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-27 16:06:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:06:07,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:06:07,506 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:06:07,625 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:06:07,627 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:06:07,892 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:06:07,893 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:06:08,107 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:06:08,107 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:06:08,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:08 BoogieIcfgContainer [2024-01-27 16:06:08,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:06:08,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:06:08,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:06:08,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:06:08,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:06:06" (1/3) ... [2024-01-27 16:06:08,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb3c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:08, skipping insertion in model container [2024-01-27 16:06:08,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:07" (2/3) ... [2024-01-27 16:06:08,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb3c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:08, skipping insertion in model container [2024-01-27 16:06:08,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:08" (3/3) ... [2024-01-27 16:06:08,114 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-01-27 16:06:08,120 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:06:08,127 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:06:08,127 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-01-27 16:06:08,127 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:06:08,173 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:06:08,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2024-01-27 16:06:08,231 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2024-01-27 16:06:08,231 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:06:08,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 7/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-27 16:06:08,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2024-01-27 16:06:08,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2024-01-27 16:06:08,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:06:08,256 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41515ee7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:06:08,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:06:08,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:06:08,285 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-01-27 16:06:08,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:06:08,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:08,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 16:06:08,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:08,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 659921, now seen corresponding path program 1 times [2024-01-27 16:06:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777369303] [2024-01-27 16:06:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:08,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777369303] [2024-01-27 16:06:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777369303] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:08,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:08,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504605948] [2024-01-27 16:06:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:08,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-27 16:06:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-27 16:06:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-27 16:06:08,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:08,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 95 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:08,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:08,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:08,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:08,717 INFO L124 PetriNetUnfolderBase]: 435/786 cut-off events. [2024-01-27 16:06:08,717 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-27 16:06:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 786 events. 435/786 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3576 event pairs, 339 based on Foata normal form. 48/744 useless extension candidates. Maximal degree in co-relation 1440. Up to 712 conditions per place. [2024-01-27 16:06:08,727 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-01-27 16:06:08,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2024-01-27 16:06:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-27 16:06:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-27 16:06:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-01-27 16:06:08,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-01-27 16:06:08,737 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2024-01-27 16:06:08,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2024-01-27 16:06:08,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:08,741 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2024-01-27 16:06:08,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2024-01-27 16:06:08,745 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-01-27 16:06:08,745 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2024-01-27 16:06:08,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:08,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:08,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:08,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:06:08,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:08,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1514188297, now seen corresponding path program 1 times [2024-01-27 16:06:08,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:08,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696683664] [2024-01-27 16:06:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696683664] [2024-01-27 16:06:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696683664] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074517464] [2024-01-27 16:06:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:08,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:08,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:08,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:08,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:08,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:08,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:09,086 INFO L124 PetriNetUnfolderBase]: 415/766 cut-off events. [2024-01-27 16:06:09,087 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-27 16:06:09,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 766 events. 415/766 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3606 event pairs, 312 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 1484. Up to 642 conditions per place. [2024-01-27 16:06:09,092 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-01-27 16:06:09,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2024-01-27 16:06:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-01-27 16:06:09,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-01-27 16:06:09,097 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2024-01-27 16:06:09,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2024-01-27 16:06:09,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 16:06:09,100 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2024-01-27 16:06:09,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-01-27 16:06:09,105 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-01-27 16:06:09,105 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2024-01-27 16:06:09,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:09,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:09,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:09,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:06:09,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:09,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 304804722, now seen corresponding path program 1 times [2024-01-27 16:06:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:09,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323150631] [2024-01-27 16:06:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323150631] [2024-01-27 16:06:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323150631] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:09,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:09,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:06:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64947021] [2024-01-27 16:06:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:09,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:06:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:06:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:06:09,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:09,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:09,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:09,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:09,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:09,751 INFO L124 PetriNetUnfolderBase]: 690/1269 cut-off events. [2024-01-27 16:06:09,751 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-01-27 16:06:09,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 1269 events. 690/1269 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6392 event pairs, 74 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 2480. Up to 678 conditions per place. [2024-01-27 16:06:09,756 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 72 selfloop transitions, 10 changer transitions 3/92 dead transitions. [2024-01-27 16:06:09,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 92 transitions, 375 flow [2024-01-27 16:06:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:06:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:06:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-01-27 16:06:09,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-01-27 16:06:09,758 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 147 transitions. [2024-01-27 16:06:09,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 92 transitions, 375 flow [2024-01-27 16:06:09,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 92 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:09,762 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2024-01-27 16:06:09,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-01-27 16:06:09,764 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-01-27 16:06:09,764 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2024-01-27 16:06:09,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:09,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:09,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:09,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:06:09,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:09,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash -744303402, now seen corresponding path program 1 times [2024-01-27 16:06:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:09,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148635718] [2024-01-27 16:06:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:09,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:09,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148635718] [2024-01-27 16:06:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148635718] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:09,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936400040] [2024-01-27 16:06:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:09,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:09,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:09,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:09,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:09,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-01-27 16:06:09,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:09,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:09,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:09,944 INFO L124 PetriNetUnfolderBase]: 440/849 cut-off events. [2024-01-27 16:06:09,944 INFO L125 PetriNetUnfolderBase]: For 154/157 co-relation queries the response was YES. [2024-01-27 16:06:09,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 849 events. 440/849 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3791 event pairs, 226 based on Foata normal form. 30/854 useless extension candidates. Maximal degree in co-relation 1746. Up to 436 conditions per place. [2024-01-27 16:06:09,947 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 4/51 dead transitions. [2024-01-27 16:06:09,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 221 flow [2024-01-27 16:06:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-01-27 16:06:09,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-01-27 16:06:09,948 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 75 transitions. [2024-01-27 16:06:09,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 221 flow [2024-01-27 16:06:09,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 215 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:09,950 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2024-01-27 16:06:09,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-01-27 16:06:09,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-01-27 16:06:09,950 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2024-01-27 16:06:09,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-01-27 16:06:09,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:09,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:09,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:06:09,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:09,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 208585633, now seen corresponding path program 1 times [2024-01-27 16:06:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103132039] [2024-01-27 16:06:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:10,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103132039] [2024-01-27 16:06:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103132039] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358084606] [2024-01-27 16:06:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:10,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:10,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:10,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:10,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:10,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:10,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:10,119 INFO L124 PetriNetUnfolderBase]: 265/580 cut-off events. [2024-01-27 16:06:10,120 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-01-27 16:06:10,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 580 events. 265/580 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2355 event pairs, 91 based on Foata normal form. 32/601 useless extension candidates. Maximal degree in co-relation 1191. Up to 266 conditions per place. [2024-01-27 16:06:10,122 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-01-27 16:06:10,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 215 flow [2024-01-27 16:06:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-01-27 16:06:10,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-01-27 16:06:10,123 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 72 transitions. [2024-01-27 16:06:10,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 215 flow [2024-01-27 16:06:10,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 205 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:10,125 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2024-01-27 16:06:10,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-01-27 16:06:10,126 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-01-27 16:06:10,126 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2024-01-27 16:06:10,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:10,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:10,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:10,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:06:10,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:10,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -294807330, now seen corresponding path program 1 times [2024-01-27 16:06:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:10,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759497176] [2024-01-27 16:06:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759497176] [2024-01-27 16:06:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759497176] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:11,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:11,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990857430] [2024-01-27 16:06:11,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:11,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:11,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:11,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:11,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:11,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:11,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:11,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:11,387 INFO L124 PetriNetUnfolderBase]: 384/828 cut-off events. [2024-01-27 16:06:11,388 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-01-27 16:06:11,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 828 events. 384/828 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4003 event pairs, 84 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 1808. Up to 288 conditions per place. [2024-01-27 16:06:11,391 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 67 selfloop transitions, 16 changer transitions 12/101 dead transitions. [2024-01-27 16:06:11,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 491 flow [2024-01-27 16:06:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:06:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:06:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-01-27 16:06:11,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148936170212766 [2024-01-27 16:06:11,393 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 10 states and 195 transitions. [2024-01-27 16:06:11,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 491 flow [2024-01-27 16:06:11,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:06:11,395 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 219 flow [2024-01-27 16:06:11,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=219, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-01-27 16:06:11,396 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-01-27 16:06:11,396 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 219 flow [2024-01-27 16:06:11,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:11,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:11,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:11,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:06:11,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:11,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2016112452, now seen corresponding path program 2 times [2024-01-27 16:06:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587981216] [2024-01-27 16:06:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:12,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:12,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587981216] [2024-01-27 16:06:12,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587981216] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:12,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:12,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105126688] [2024-01-27 16:06:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:12,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:12,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:12,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:12,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:12,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 219 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:12,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:12,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:12,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:12,569 INFO L124 PetriNetUnfolderBase]: 501/1108 cut-off events. [2024-01-27 16:06:12,569 INFO L125 PetriNetUnfolderBase]: For 871/873 co-relation queries the response was YES. [2024-01-27 16:06:12,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 1108 events. 501/1108 cut-off events. For 871/873 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6261 event pairs, 150 based on Foata normal form. 0/1087 useless extension candidates. Maximal degree in co-relation 2880. Up to 661 conditions per place. [2024-01-27 16:06:12,575 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 70 selfloop transitions, 16 changer transitions 6/98 dead transitions. [2024-01-27 16:06:12,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 98 transitions, 595 flow [2024-01-27 16:06:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:06:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:06:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-01-27 16:06:12,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40189125295508277 [2024-01-27 16:06:12,576 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 219 flow. Second operand 9 states and 170 transitions. [2024-01-27 16:06:12,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 98 transitions, 595 flow [2024-01-27 16:06:12,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 579 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:12,582 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 369 flow [2024-01-27 16:06:12,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=369, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-01-27 16:06:12,583 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-01-27 16:06:12,583 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 369 flow [2024-01-27 16:06:12,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:12,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:12,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:12,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:06:12,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:12,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 784245098, now seen corresponding path program 3 times [2024-01-27 16:06:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921894645] [2024-01-27 16:06:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:13,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:13,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921894645] [2024-01-27 16:06:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921894645] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167203930] [2024-01-27 16:06:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:13,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:13,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:13,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 369 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:13,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:13,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:13,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:13,683 INFO L124 PetriNetUnfolderBase]: 628/1383 cut-off events. [2024-01-27 16:06:13,684 INFO L125 PetriNetUnfolderBase]: For 1797/1797 co-relation queries the response was YES. [2024-01-27 16:06:13,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3880 conditions, 1383 events. 628/1383 cut-off events. For 1797/1797 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8038 event pairs, 52 based on Foata normal form. 0/1367 useless extension candidates. Maximal degree in co-relation 3860. Up to 338 conditions per place. [2024-01-27 16:06:13,690 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 92 selfloop transitions, 32 changer transitions 9/139 dead transitions. [2024-01-27 16:06:13,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 139 transitions, 930 flow [2024-01-27 16:06:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:06:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:06:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2024-01-27 16:06:13,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2024-01-27 16:06:13,692 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 369 flow. Second operand 12 states and 236 transitions. [2024-01-27 16:06:13,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 139 transitions, 930 flow [2024-01-27 16:06:13,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 884 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-01-27 16:06:13,701 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 483 flow [2024-01-27 16:06:13,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=483, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-01-27 16:06:13,703 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2024-01-27 16:06:13,703 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 483 flow [2024-01-27 16:06:13,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:13,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:13,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:13,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:06:13,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:13,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1664093566, now seen corresponding path program 4 times [2024-01-27 16:06:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956833054] [2024-01-27 16:06:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956833054] [2024-01-27 16:06:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956833054] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96910583] [2024-01-27 16:06:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:14,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:14,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:14,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 483 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:14,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:14,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:14,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:14,860 INFO L124 PetriNetUnfolderBase]: 722/1590 cut-off events. [2024-01-27 16:06:14,861 INFO L125 PetriNetUnfolderBase]: For 3003/3003 co-relation queries the response was YES. [2024-01-27 16:06:14,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4767 conditions, 1590 events. 722/1590 cut-off events. For 3003/3003 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9807 event pairs, 186 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 4743. Up to 707 conditions per place. [2024-01-27 16:06:14,869 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 89 selfloop transitions, 23 changer transitions 12/130 dead transitions. [2024-01-27 16:06:14,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 130 transitions, 986 flow [2024-01-27 16:06:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:06:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:06:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-01-27 16:06:14,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373522458628842 [2024-01-27 16:06:14,871 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 483 flow. Second operand 9 states and 185 transitions. [2024-01-27 16:06:14,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 130 transitions, 986 flow [2024-01-27 16:06:14,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 908 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-01-27 16:06:14,881 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 619 flow [2024-01-27 16:06:14,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=619, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-01-27 16:06:14,882 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-01-27 16:06:14,882 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 619 flow [2024-01-27 16:06:14,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:14,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:14,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:14,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:06:14,883 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:14,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1276614704, now seen corresponding path program 5 times [2024-01-27 16:06:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367110494] [2024-01-27 16:06:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367110494] [2024-01-27 16:06:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367110494] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969729842] [2024-01-27 16:06:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:15,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:15,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-01-27 16:06:15,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 619 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:15,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:15,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-01-27 16:06:15,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:15,882 INFO L124 PetriNetUnfolderBase]: 702/1516 cut-off events. [2024-01-27 16:06:15,882 INFO L125 PetriNetUnfolderBase]: For 3424/3424 co-relation queries the response was YES. [2024-01-27 16:06:15,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 1516 events. 702/1516 cut-off events. For 3424/3424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8815 event pairs, 164 based on Foata normal form. 28/1526 useless extension candidates. Maximal degree in co-relation 4741. Up to 727 conditions per place. [2024-01-27 16:06:15,890 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 91 selfloop transitions, 29 changer transitions 3/129 dead transitions. [2024-01-27 16:06:15,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 1057 flow [2024-01-27 16:06:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:06:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:06:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-01-27 16:06:15,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40425531914893614 [2024-01-27 16:06:15,892 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 619 flow. Second operand 10 states and 190 transitions. [2024-01-27 16:06:15,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 1057 flow [2024-01-27 16:06:15,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 129 transitions, 972 flow, removed 39 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:15,902 INFO L231 Difference]: Finished difference. Result has 102 places, 86 transitions, 691 flow [2024-01-27 16:06:15,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=102, PETRI_TRANSITIONS=86} [2024-01-27 16:06:15,902 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-01-27 16:06:15,903 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 86 transitions, 691 flow [2024-01-27 16:06:15,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:15,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:15,903 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:15,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:06:15,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:15,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1789652361, now seen corresponding path program 1 times [2024-01-27 16:06:15,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:15,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804239649] [2024-01-27 16:06:15,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:15,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804239649] [2024-01-27 16:06:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804239649] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287407774] [2024-01-27 16:06:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:16,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:16,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:16,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:06:16,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 16:06:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2024-01-27 16:06:16,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:16,965 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 7 treesize of output 6 [2024-01-27 16:06:16,970 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 16 treesize of output 15 [2024-01-27 16:06:17,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-01-27 16:06:17,057 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 8 treesize of output 1 [2024-01-27 16:06:17,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2024-01-27 16:06:17,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2024-01-27 16:06:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 41 [2024-01-27 16:06:18,022 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 117 treesize of output 97 [2024-01-27 16:06:18,026 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 95 treesize of output 85 [2024-01-27 16:06:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:18,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:18,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:18,322 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:18,346 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:18,346 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:23,371 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:23,371 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:23,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:23,384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:24,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:24,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 2322 treesize of output 1549 [2024-01-27 16:06:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287407774] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:50,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:50,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870238887] [2024-01-27 16:06:50,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:50,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:50,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:50,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:50,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=632, Unknown=1, NotChecked=0, Total=756 [2024-01-27 16:06:54,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:06:59,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:06:59,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-01-27 16:06:59,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 86 transitions, 691 flow. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:59,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:59,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-01-27 16:06:59,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:02,386 INFO L124 PetriNetUnfolderBase]: 1436/2664 cut-off events. [2024-01-27 16:07:02,387 INFO L125 PetriNetUnfolderBase]: For 5963/5963 co-relation queries the response was YES. [2024-01-27 16:07:02,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8494 conditions, 2664 events. 1436/2664 cut-off events. For 5963/5963 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15220 event pairs, 465 based on Foata normal form. 0/2649 useless extension candidates. Maximal degree in co-relation 8460. Up to 1864 conditions per place. [2024-01-27 16:07:02,405 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 135 selfloop transitions, 29 changer transitions 3/170 dead transitions. [2024-01-27 16:07:02,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 170 transitions, 1329 flow [2024-01-27 16:07:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:07:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:07:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2024-01-27 16:07:02,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353518821603928 [2024-01-27 16:07:02,408 INFO L175 Difference]: Start difference. First operand has 102 places, 86 transitions, 691 flow. Second operand 13 states and 216 transitions. [2024-01-27 16:07:02,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 170 transitions, 1329 flow [2024-01-27 16:07:02,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 170 transitions, 1255 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-01-27 16:07:02,426 INFO L231 Difference]: Finished difference. Result has 112 places, 100 transitions, 816 flow [2024-01-27 16:07:02,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=816, PETRI_PLACES=112, PETRI_TRANSITIONS=100} [2024-01-27 16:07:02,427 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2024-01-27 16:07:02,427 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 100 transitions, 816 flow [2024-01-27 16:07:02,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:02,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:02,428 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:02,443 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-01-27 16:07:02,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 16:07:02,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:02,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 341538293, now seen corresponding path program 2 times [2024-01-27 16:07:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434271235] [2024-01-27 16:07:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:03,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434271235] [2024-01-27 16:07:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434271235] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:03,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725271970] [2024-01-27 16:07:03,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:07:03,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:03,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:03,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:03,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 16:07:04,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:04,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:04,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 16:07:04,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:04,116 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 16 treesize of output 15 [2024-01-27 16:07:04,120 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 7 treesize of output 6 [2024-01-27 16:07:04,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-01-27 16:07:04,179 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 8 treesize of output 1 [2024-01-27 16:07:04,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2024-01-27 16:07:04,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 55 [2024-01-27 16:07:04,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 61 [2024-01-27 16:07:05,064 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 110 treesize of output 94 [2024-01-27 16:07:05,067 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 102 treesize of output 90 [2024-01-27 16:07:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:05,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:05,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:05,482 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:05,491 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:05,491 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:06,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:06,648 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:06,656 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:06,659 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:08,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:08,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 6643 treesize of output 3700 [2024-01-27 16:07:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:08,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725271970] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:08,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:08,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:07:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584367245] [2024-01-27 16:07:08,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:08,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:07:08,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:08,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:07:08,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:07:09,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-01-27 16:07:09,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 100 transitions, 816 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:09,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:09,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-01-27 16:07:09,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:10,949 INFO L124 PetriNetUnfolderBase]: 1047/2165 cut-off events. [2024-01-27 16:07:10,950 INFO L125 PetriNetUnfolderBase]: For 6673/6675 co-relation queries the response was YES. [2024-01-27 16:07:10,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7706 conditions, 2165 events. 1047/2165 cut-off events. For 6673/6675 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13006 event pairs, 260 based on Foata normal form. 16/2173 useless extension candidates. Maximal degree in co-relation 7667. Up to 1095 conditions per place. [2024-01-27 16:07:10,966 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 130 selfloop transitions, 34 changer transitions 3/172 dead transitions. [2024-01-27 16:07:10,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 172 transitions, 1497 flow [2024-01-27 16:07:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:07:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:07:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2024-01-27 16:07:10,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3971631205673759 [2024-01-27 16:07:10,968 INFO L175 Difference]: Start difference. First operand has 112 places, 100 transitions, 816 flow. Second operand 12 states and 224 transitions. [2024-01-27 16:07:10,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 172 transitions, 1497 flow [2024-01-27 16:07:10,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 172 transitions, 1455 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-01-27 16:07:10,987 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 990 flow [2024-01-27 16:07:10,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=990, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2024-01-27 16:07:10,988 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2024-01-27 16:07:10,988 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 990 flow [2024-01-27 16:07:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:10,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:10,988 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:11,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:11,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-27 16:07:11,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:11,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1240634409, now seen corresponding path program 3 times [2024-01-27 16:07:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392794386] [2024-01-27 16:07:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392794386] [2024-01-27 16:07:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392794386] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114982447] [2024-01-27 16:07:12,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:07:12,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:12,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:12,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:12,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 16:07:12,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 16:07:12,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:12,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 40 conjunts are in the unsatisfiable core [2024-01-27 16:07:12,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:12,331 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 7 treesize of output 6 [2024-01-27 16:07:12,336 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 16 treesize of output 15 [2024-01-27 16:07:12,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-01-27 16:07:12,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2024-01-27 16:07:12,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 47 [2024-01-27 16:07:12,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 57 [2024-01-27 16:07:13,287 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 126 treesize of output 110 [2024-01-27 16:07:13,289 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 118 treesize of output 102 [2024-01-27 16:07:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:13,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:13,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:13,599 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:13,608 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:13,608 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:22,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:22,323 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:22,334 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:22,334 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:29,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 12083 treesize of output 6744 [2024-01-27 16:07:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:29,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114982447] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:29,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:29,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:07:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324730679] [2024-01-27 16:07:29,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:29,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:07:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:29,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:07:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=628, Unknown=3, NotChecked=0, Total=756 [2024-01-27 16:07:34,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:07:38,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:07:38,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-01-27 16:07:38,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 110 transitions, 990 flow. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:38,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:38,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-01-27 16:07:38,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:49,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:07:53,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:07:57,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:08:02,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:08:07,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:08:11,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:08:16,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:08:20,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 16:08:23,546 INFO L124 PetriNetUnfolderBase]: 2383/4359 cut-off events. [2024-01-27 16:08:23,546 INFO L125 PetriNetUnfolderBase]: For 16914/16914 co-relation queries the response was YES. [2024-01-27 16:08:23,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16181 conditions, 4359 events. 2383/4359 cut-off events. For 16914/16914 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 26340 event pairs, 242 based on Foata normal form. 0/4336 useless extension candidates. Maximal degree in co-relation 16137. Up to 862 conditions per place. [2024-01-27 16:08:23,581 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 215 selfloop transitions, 90 changer transitions 8/316 dead transitions. [2024-01-27 16:08:23,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 316 transitions, 2765 flow [2024-01-27 16:08:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 16:08:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 16:08:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 394 transitions. [2024-01-27 16:08:23,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38104448742746616 [2024-01-27 16:08:23,586 INFO L175 Difference]: Start difference. First operand has 123 places, 110 transitions, 990 flow. Second operand 22 states and 394 transitions. [2024-01-27 16:08:23,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 316 transitions, 2765 flow [2024-01-27 16:08:23,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 316 transitions, 2685 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-01-27 16:08:23,623 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 1615 flow [2024-01-27 16:08:23,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1615, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2024-01-27 16:08:23,624 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-01-27 16:08:23,624 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 1615 flow [2024-01-27 16:08:23,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:08:23,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:08:23,624 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:08:23,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 16:08:23,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:08:23,837 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:08:23,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:08:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1528847819, now seen corresponding path program 4 times [2024-01-27 16:08:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:08:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614246956] [2024-01-27 16:08:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:08:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:08:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:08:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:08:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:08:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614246956] [2024-01-27 16:08:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614246956] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:08:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658084144] [2024-01-27 16:08:24,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:08:24,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:08:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:08:24,779 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:08:24,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 16:08:24,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:08:24,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:08:24,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2024-01-27 16:08:24,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:08:24,993 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 16 treesize of output 15 [2024-01-27 16:08:25,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-01-27 16:08:25,233 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 11 treesize of output 7 [2024-01-27 16:08:25,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 55 [2024-01-27 16:08:25,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-01-27 16:08:26,581 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 64 treesize of output 52 [2024-01-27 16:08:26,587 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 62 treesize of output 50 [2024-01-27 16:08:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:08:26,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:08:27,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:08:27,018 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:08:27,101 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:08:27,101 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:08:29,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:08:29,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:08:29,240 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:08:29,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:08:31,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:08:31,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2024-01-27 16:08:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:08:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658084144] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:08:32,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:08:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 30 [2024-01-27 16:08:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033197033] [2024-01-27 16:08:32,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:08:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-01-27 16:08:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:08:32,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-01-27 16:08:32,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2024-01-27 16:08:33,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-01-27 16:08:33,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 1615 flow. Second operand has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:08:33,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:08:33,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-01-27 16:08:33,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:08:42,589 INFO L124 PetriNetUnfolderBase]: 2478/5022 cut-off events. [2024-01-27 16:08:42,589 INFO L125 PetriNetUnfolderBase]: For 48260/48260 co-relation queries the response was YES. [2024-01-27 16:08:42,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24175 conditions, 5022 events. 2478/5022 cut-off events. For 48260/48260 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 34593 event pairs, 166 based on Foata normal form. 172/5178 useless extension candidates. Maximal degree in co-relation 24119. Up to 859 conditions per place. [2024-01-27 16:08:42,635 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 193 selfloop transitions, 115 changer transitions 109/422 dead transitions. [2024-01-27 16:08:42,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 422 transitions, 4977 flow [2024-01-27 16:08:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-01-27 16:08:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-01-27 16:08:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 556 transitions. [2024-01-27 16:08:42,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3816060398078243 [2024-01-27 16:08:42,638 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 1615 flow. Second operand 31 states and 556 transitions. [2024-01-27 16:08:42,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 422 transitions, 4977 flow [2024-01-27 16:08:42,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 422 transitions, 4684 flow, removed 119 selfloop flow, removed 9 redundant places. [2024-01-27 16:08:42,718 INFO L231 Difference]: Finished difference. Result has 187 places, 181 transitions, 2452 flow [2024-01-27 16:08:42,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2452, PETRI_PLACES=187, PETRI_TRANSITIONS=181} [2024-01-27 16:08:42,719 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places. [2024-01-27 16:08:42,720 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 181 transitions, 2452 flow [2024-01-27 16:08:42,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:08:42,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:08:42,720 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:08:42,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 16:08:42,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:08:42,935 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:08:42,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:08:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1261558961, now seen corresponding path program 5 times [2024-01-27 16:08:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:08:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146061340] [2024-01-27 16:08:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:08:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:08:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:08:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:08:43,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:08:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146061340] [2024-01-27 16:08:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146061340] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:08:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324188723] [2024-01-27 16:08:43,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:08:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:08:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:08:43,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:08:43,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 16:08:44,115 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:08:44,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:08:44,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 39 conjunts are in the unsatisfiable core [2024-01-27 16:08:44,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:08:44,133 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 7 treesize of output 6 [2024-01-27 16:08:44,138 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 16 treesize of output 15 [2024-01-27 16:08:44,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-01-27 16:08:44,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2024-01-27 16:08:44,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 55 [2024-01-27 16:08:44,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 53 [2024-01-27 16:08:45,724 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 99 treesize of output 83 [2024-01-27 16:08:45,730 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 91 treesize of output 79 [2024-01-27 16:08:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:08:45,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:08:46,392 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:08:46,392 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:08:46,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:08:46,422 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:08:48,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:08:48,719 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:08:48,750 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:08:48,750 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:08:51,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:08:51,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 2658 treesize of output 1619 [2024-01-27 16:08:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:08:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324188723] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:08:53,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:08:53,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:08:53,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849840905] [2024-01-27 16:08:53,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:08:53,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:08:53,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:08:53,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:08:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:08:53,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-01-27 16:08:53,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 181 transitions, 2452 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:08:53,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:08:53,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-01-27 16:08:53,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:08:59,593 INFO L124 PetriNetUnfolderBase]: 2056/4178 cut-off events. [2024-01-27 16:08:59,593 INFO L125 PetriNetUnfolderBase]: For 90137/90139 co-relation queries the response was YES. [2024-01-27 16:08:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25718 conditions, 4178 events. 2056/4178 cut-off events. For 90137/90139 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 27535 event pairs, 362 based on Foata normal form. 0/4162 useless extension candidates. Maximal degree in co-relation 25643. Up to 2454 conditions per place. [2024-01-27 16:08:59,637 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 211 selfloop transitions, 58 changer transitions 3/277 dead transitions. [2024-01-27 16:08:59,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 277 transitions, 3997 flow [2024-01-27 16:08:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 16:08:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 16:08:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 271 transitions. [2024-01-27 16:08:59,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843971631205674 [2024-01-27 16:08:59,639 INFO L175 Difference]: Start difference. First operand has 187 places, 181 transitions, 2452 flow. Second operand 15 states and 271 transitions. [2024-01-27 16:08:59,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 277 transitions, 3997 flow [2024-01-27 16:08:59,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 277 transitions, 3488 flow, removed 211 selfloop flow, removed 21 redundant places. [2024-01-27 16:08:59,834 INFO L231 Difference]: Finished difference. Result has 175 places, 193 transitions, 2487 flow [2024-01-27 16:08:59,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2487, PETRI_PLACES=175, PETRI_TRANSITIONS=193} [2024-01-27 16:08:59,835 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places. [2024-01-27 16:08:59,835 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 193 transitions, 2487 flow [2024-01-27 16:08:59,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:08:59,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:08:59,836 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:08:59,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 16:09:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 16:09:00,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:09:00,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:09:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1074082430, now seen corresponding path program 1 times [2024-01-27 16:09:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:09:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144125261] [2024-01-27 16:09:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:09:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:09:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:09:00,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:09:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:09:00,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:09:00,133 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:09:00,133 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 16:09:00,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 16:09:00,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 16:09:00,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 16:09:00,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-01-27 16:09:00,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-01-27 16:09:00,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 16:09:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 16:09:00,136 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2024-01-27 16:09:00,141 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:09:00,141 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:09:00,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:09:00 BasicIcfg [2024-01-27 16:09:00,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:09:00,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:09:00,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:09:00,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:09:00,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:08" (3/4) ... [2024-01-27 16:09:00,195 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:09:00,268 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:09:00,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:09:00,269 INFO L158 Benchmark]: Toolchain (without parser) took 173518.41ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 104.3MB in the beginning and 616.9MB in the end (delta: -512.5MB). Peak memory consumption was 780.5MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,272 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:09:00,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.89ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 72.8MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.20ms. Allocated memory is still 159.4MB. Free memory was 72.8MB in the beginning and 69.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,273 INFO L158 Benchmark]: Boogie Preprocessor took 70.67ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 66.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,273 INFO L158 Benchmark]: RCFGBuilder took 693.43ms. Allocated memory is still 159.4MB. Free memory was 66.1MB in the beginning and 68.0MB in the end (delta: -1.9MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,273 INFO L158 Benchmark]: TraceAbstraction took 172083.70ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 67.2MB in the beginning and 628.4MB in the end (delta: -561.2MB). Peak memory consumption was 731.2MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,278 INFO L158 Benchmark]: Witness Printer took 74.99ms. Allocated memory is still 1.5GB. Free memory was 628.4MB in the beginning and 616.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 16:09:00,279 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.89ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 72.8MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.20ms. Allocated memory is still 159.4MB. Free memory was 72.8MB in the beginning and 69.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.67ms. Allocated memory is still 159.4MB. Free memory was 69.8MB in the beginning and 66.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 693.43ms. Allocated memory is still 159.4MB. Free memory was 66.1MB in the beginning and 68.0MB in the end (delta: -1.9MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 172083.70ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 67.2MB in the beginning and 628.4MB in the end (delta: -561.2MB). Peak memory consumption was 731.2MB. Max. memory is 16.1GB. * Witness Printer took 74.99ms. Allocated memory is still 1.5GB. Free memory was 628.4MB in the beginning and 616.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={10:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={9:0}, id2={10:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1037] COND TRUE 2 i<(20) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 71 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 171.9s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 87.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 1984 SdHoareTripleChecker+Valid, 73.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1943 mSDsluCounter, 1125 SdHoareTripleChecker+Invalid, 71.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1097 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9072 IncrementalHoareTripleChecker+Invalid, 9229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 28 mSDtfsCounter, 9072 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2292 ImplicationChecksByTransitivity, 37.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2487occurred in iteration=15, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 81.2s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 564 ConstructedInterpolants, 117 QuantifiedInterpolants, 75193 SizeOfPredicates, 218 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:09:00,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE