./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.5-dev-84cfde4 [2024-10-11 14:08:46,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:08:46,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:08:46,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:08:46,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:08:46,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:08:46,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:08:46,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:08:46,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:08:46,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:08:46,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:08:46,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:08:46,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:08:46,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:08:46,389 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:08:46,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:08:46,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:08:46,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:08:46,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:08:46,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:08:46,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:08:46,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:08:46,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:08:46,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:08:46,392 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:08:46,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:08:46,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:08:46,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:08:46,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:08:46,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:08:46,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:08:46,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:08:46,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:08:46,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:08:46,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:08:46,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:08:46,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:08:46,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:08:46,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:08:46,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:08:46,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:08:46,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:08:46,400 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-clean/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-clean/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-10-11 14:08:46,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:08:46,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:08:46,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:08:46,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:08:46,683 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:08:46,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2024-10-11 14:08:48,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:08:48,368 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:08:48,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2024-10-11 14:08:48,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6822a625d/016f220830be4448966eba8765e0f03c/FLAG77853dd0f [2024-10-11 14:08:48,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6822a625d/016f220830be4448966eba8765e0f03c [2024-10-11 14:08:48,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:08:48,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:08:48,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:08:48,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:08:48,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:08:48,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:08:48" (1/1) ... [2024-10-11 14:08:48,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a86b365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:48, skipping insertion in model container [2024-10-11 14:08:48,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:08:48" (1/1) ... [2024-10-11 14:08:48,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:08:48,881 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43284,43297] [2024-10-11 14:08:48,888 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43491,43504] [2024-10-11 14:08:48,890 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43772,43785] [2024-10-11 14:08:48,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:08:48,905 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:08:48,965 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43284,43297] [2024-10-11 14:08:48,966 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43491,43504] [2024-10-11 14:08:48,968 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i[43772,43785] [2024-10-11 14:08:48,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:08:49,036 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:08:49,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49 WrapperNode [2024-10-11 14:08:49,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:08:49,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:08:49,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:08:49,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:08:49,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,107 INFO L138 Inliner]: procedures = 274, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-10-11 14:08:49,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:08:49,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:08:49,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:08:49,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:08:49,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,158 INFO L175 MemorySlicer]: Split 51 memory accesses to 5 slices as follows [2, 32, 8, 5, 4]. 63 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 0, 8, 5, 0]. The 18 writes are split as follows [0, 15, 0, 0, 3]. [2024-10-11 14:08:49,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:08:49,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:08:49,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:08:49,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:08:49,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (1/1) ... [2024-10-11 14:08:49,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:08:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:08:49,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:08:49,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:08:49,280 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 14:08:49,281 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 14:08:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 14:08:49,293 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 14:08:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:08:49,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:08:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:08:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:08:49,298 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:08:49,437 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:08:49,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:08:49,792 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:08:49,792 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:08:50,086 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:08:50,087 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:08:50,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:50 BoogieIcfgContainer [2024-10-11 14:08:50,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:08:50,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:08:50,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:08:50,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:08:50,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:08:48" (1/3) ... [2024-10-11 14:08:50,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad9951e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:08:50, skipping insertion in model container [2024-10-11 14:08:50,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:49" (2/3) ... [2024-10-11 14:08:50,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad9951e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:08:50, skipping insertion in model container [2024-10-11 14:08:50,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:50" (3/3) ... [2024-10-11 14:08:50,096 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-10-11 14:08:50,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:08:50,112 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 14:08:50,113 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:08:50,208 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:08:50,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 106 flow [2024-10-11 14:08:50,322 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-10-11 14:08:50,322 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:08:50,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 7/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-10-11 14:08:50,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 46 transitions, 106 flow [2024-10-11 14:08:50,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 93 flow [2024-10-11 14:08:50,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:08:50,348 INFO L333 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, 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;@294cb566, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:08:50,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:08:50,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:08:50,354 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-11 14:08:50,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:08:50,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:50,356 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 14:08:50,357 INFO L396 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-10-11 14:08:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 647013, now seen corresponding path program 1 times [2024-10-11 14:08:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:50,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687855646] [2024-10-11 14:08:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:50,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687855646] [2024-10-11 14:08:50,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687855646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:50,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:50,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:08:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688132957] [2024-10-11 14:08:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:08:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:08:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:08:50,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:50,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 93 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-10-11 14:08:50,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:50,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:50,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:50,775 INFO L124 PetriNetUnfolderBase]: 428/771 cut-off events. [2024-10-11 14:08:50,776 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 14:08:50,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 771 events. 428/771 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3499 event pairs, 334 based on Foata normal form. 47/731 useless extension candidates. Maximal degree in co-relation 1449. Up to 697 conditions per place. [2024-10-11 14:08:50,785 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2024-10-11 14:08:50,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 143 flow [2024-10-11 14:08:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:08:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 14:08:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2024-10-11 14:08:50,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-10-11 14:08:50,799 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 93 flow. Second operand 2 states and 53 transitions. [2024-10-11 14:08:50,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 143 flow [2024-10-11 14:08:50,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:08:50,804 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2024-10-11 14:08:50,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2024-10-11 14:08:50,810 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-10-11 14:08:50,811 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2024-10-11 14:08:50,811 INFO L472 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-10-11 14:08:50,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:50,811 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:08:50,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:08:50,812 INFO L396 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-10-11 14:08:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1703533609, now seen corresponding path program 1 times [2024-10-11 14:08:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099665680] [2024-10-11 14:08:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099665680] [2024-10-11 14:08:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099665680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:08:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595066087] [2024-10-11 14:08:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:51,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:08:51,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:08:51,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:08:51,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:51,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 78 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-10-11 14:08:51,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:51,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:51,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:51,218 INFO L124 PetriNetUnfolderBase]: 408/749 cut-off events. [2024-10-11 14:08:51,218 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 14:08:51,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 749 events. 408/749 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3501 event pairs, 307 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 1452. Up to 627 conditions per place. [2024-10-11 14:08:51,226 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-10-11 14:08:51,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2024-10-11 14:08:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:08:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:08:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-10-11 14:08:51,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-10-11 14:08:51,230 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 72 transitions. [2024-10-11 14:08:51,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2024-10-11 14:08:51,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:08:51,232 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 80 flow [2024-10-11 14:08:51,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2024-10-11 14:08:51,234 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2024-10-11 14:08:51,235 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 80 flow [2024-10-11 14:08:51,235 INFO L472 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-10-11 14:08:51,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:51,236 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:08:51,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:08:51,236 INFO L396 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-10-11 14:08:51,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:51,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1269932666, now seen corresponding path program 1 times [2024-10-11 14:08:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384030036] [2024-10-11 14:08:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384030036] [2024-10-11 14:08:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384030036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:51,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:08:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403320440] [2024-10-11 14:08:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:51,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:08:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:08:51,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:08:51,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:51,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 80 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-10-11 14:08:51,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:51,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:51,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:52,015 INFO L124 PetriNetUnfolderBase]: 674/1238 cut-off events. [2024-10-11 14:08:52,015 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-10-11 14:08:52,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1238 events. 674/1238 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6150 event pairs, 74 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2419. Up to 658 conditions per place. [2024-10-11 14:08:52,022 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 70 selfloop transitions, 10 changer transitions 3/90 dead transitions. [2024-10-11 14:08:52,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 367 flow [2024-10-11 14:08:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:08:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:08:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-10-11 14:08:52,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2024-10-11 14:08:52,027 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 80 flow. Second operand 6 states and 145 transitions. [2024-10-11 14:08:52,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 367 flow [2024-10-11 14:08:52,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:08:52,031 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 144 flow [2024-10-11 14:08:52,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2024-10-11 14:08:52,032 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-10-11 14:08:52,033 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 144 flow [2024-10-11 14:08:52,033 INFO L472 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-10-11 14:08:52,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:52,034 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:08:52,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:08:52,034 INFO L396 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-10-11 14:08:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1989387445, now seen corresponding path program 1 times [2024-10-11 14:08:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603703706] [2024-10-11 14:08:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:52,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603703706] [2024-10-11 14:08:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603703706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:08:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410340509] [2024-10-11 14:08:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:52,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:08:52,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:52,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:08:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:08:52,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:52,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 144 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-10-11 14:08:52,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:52,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:52,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:52,312 INFO L124 PetriNetUnfolderBase]: 419/804 cut-off events. [2024-10-11 14:08:52,312 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2024-10-11 14:08:52,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 804 events. 419/804 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3522 event pairs, 215 based on Foata normal form. 29/811 useless extension candidates. Maximal degree in co-relation 1662. Up to 416 conditions per place. [2024-10-11 14:08:52,317 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2024-10-11 14:08:52,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 213 flow [2024-10-11 14:08:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:08:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:08:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-10-11 14:08:52,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2024-10-11 14:08:52,318 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 144 flow. Second operand 3 states and 73 transitions. [2024-10-11 14:08:52,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 213 flow [2024-10-11 14:08:52,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:08:52,320 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2024-10-11 14:08:52,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-10-11 14:08:52,323 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-10-11 14:08:52,323 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 106 flow [2024-10-11 14:08:52,323 INFO L472 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-10-11 14:08:52,323 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:52,323 INFO L204 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-10-11 14:08:52,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:08:52,324 INFO L396 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-10-11 14:08:52,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 969934260, now seen corresponding path program 1 times [2024-10-11 14:08:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237599222] [2024-10-11 14:08:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237599222] [2024-10-11 14:08:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237599222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:08:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17561659] [2024-10-11 14:08:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:52,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:08:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:52,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:08:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:08:52,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:52,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 106 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-10-11 14:08:52,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:52,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:52,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:52,586 INFO L124 PetriNetUnfolderBase]: 249/543 cut-off events. [2024-10-11 14:08:52,587 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-11 14:08:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 543 events. 249/543 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2146 event pairs, 85 based on Foata normal form. 32/565 useless extension candidates. Maximal degree in co-relation 1121. Up to 252 conditions per place. [2024-10-11 14:08:52,590 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-10-11 14:08:52,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2024-10-11 14:08:52,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:08:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:08:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-10-11 14:08:52,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-10-11 14:08:52,591 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 106 flow. Second operand 3 states and 70 transitions. [2024-10-11 14:08:52,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2024-10-11 14:08:52,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 197 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 14:08:52,594 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2024-10-11 14:08:52,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-10-11 14:08:52,598 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-10-11 14:08:52,598 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2024-10-11 14:08:52,598 INFO L472 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-10-11 14:08:52,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:52,599 INFO L204 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-10-11 14:08:52,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:08:52,599 INFO L396 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-10-11 14:08:52,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash 677134911, now seen corresponding path program 1 times [2024-10-11 14:08:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192582426] [2024-10-11 14:08:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192582426] [2024-10-11 14:08:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192582426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:08:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652143306] [2024-10-11 14:08:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:08:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:08:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:08:54,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:54,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 108 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-10-11 14:08:54,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:54,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:54,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:54,725 INFO L124 PetriNetUnfolderBase]: 358/783 cut-off events. [2024-10-11 14:08:54,726 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-10-11 14:08:54,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 783 events. 358/783 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3656 event pairs, 67 based on Foata normal form. 6/776 useless extension candidates. Maximal degree in co-relation 1712. Up to 260 conditions per place. [2024-10-11 14:08:54,730 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 63 selfloop transitions, 16 changer transitions 6/91 dead transitions. [2024-10-11 14:08:54,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 91 transitions, 450 flow [2024-10-11 14:08:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:08:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:08:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-10-11 14:08:54,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4227053140096618 [2024-10-11 14:08:54,733 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 9 states and 175 transitions. [2024-10-11 14:08:54,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 91 transitions, 450 flow [2024-10-11 14:08:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 91 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:08:54,738 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 214 flow [2024-10-11 14:08:54,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-10-11 14:08:54,739 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-10-11 14:08:54,739 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 214 flow [2024-10-11 14:08:54,739 INFO L472 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-10-11 14:08:54,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:54,740 INFO L204 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-10-11 14:08:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:08:54,740 INFO L396 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-10-11 14:08:54,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash -340202185, now seen corresponding path program 2 times [2024-10-11 14:08:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799986643] [2024-10-11 14:08:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799986643] [2024-10-11 14:08:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799986643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:08:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543846038] [2024-10-11 14:08:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:08:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:08:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:08:55,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:55,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 214 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-10-11 14:08:55,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:55,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:55,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:56,168 INFO L124 PetriNetUnfolderBase]: 473/1039 cut-off events. [2024-10-11 14:08:56,168 INFO L125 PetriNetUnfolderBase]: For 858/859 co-relation queries the response was YES. [2024-10-11 14:08:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2744 conditions, 1039 events. 473/1039 cut-off events. For 858/859 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5608 event pairs, 131 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 2731. Up to 621 conditions per place. [2024-10-11 14:08:56,175 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 15 changer transitions 4/94 dead transitions. [2024-10-11 14:08:56,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 580 flow [2024-10-11 14:08:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:08:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:08:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-10-11 14:08:56,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2024-10-11 14:08:56,177 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 214 flow. Second operand 9 states and 166 transitions. [2024-10-11 14:08:56,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 580 flow [2024-10-11 14:08:56,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 562 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-10-11 14:08:56,187 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 359 flow [2024-10-11 14:08:56,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-10-11 14:08:56,188 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-10-11 14:08:56,188 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 359 flow [2024-10-11 14:08:56,188 INFO L472 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-10-11 14:08:56,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:56,189 INFO L204 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-10-11 14:08:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:08:56,189 INFO L396 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-10-11 14:08:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1004554051, now seen corresponding path program 3 times [2024-10-11 14:08:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701152868] [2024-10-11 14:08:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701152868] [2024-10-11 14:08:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701152868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:57,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:57,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:08:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207601795] [2024-10-11 14:08:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:57,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:08:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:57,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:08:57,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:08:57,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:57,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 359 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-10-11 14:08:57,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:57,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:57,899 INFO L124 PetriNetUnfolderBase]: 590/1297 cut-off events. [2024-10-11 14:08:57,901 INFO L125 PetriNetUnfolderBase]: For 1670/1672 co-relation queries the response was YES. [2024-10-11 14:08:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1297 events. 590/1297 cut-off events. For 1670/1672 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7298 event pairs, 40 based on Foata normal form. 0/1286 useless extension candidates. Maximal degree in co-relation 3636. Up to 337 conditions per place. [2024-10-11 14:08:57,911 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 91 selfloop transitions, 32 changer transitions 6/135 dead transitions. [2024-10-11 14:08:57,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 909 flow [2024-10-11 14:08:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:08:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:08:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-10-11 14:08:57,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-10-11 14:08:57,913 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 359 flow. Second operand 12 states and 230 transitions. [2024-10-11 14:08:57,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 909 flow [2024-10-11 14:08:57,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 135 transitions, 863 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-10-11 14:08:57,925 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 492 flow [2024-10-11 14:08:57,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=492, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2024-10-11 14:08:57,926 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2024-10-11 14:08:57,927 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 492 flow [2024-10-11 14:08:57,927 INFO L472 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-10-11 14:08:57,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:57,928 INFO L204 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-10-11 14:08:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:08:57,928 INFO L396 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-10-11 14:08:57,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1525330111, now seen corresponding path program 4 times [2024-10-11 14:08:57,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:57,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573544171] [2024-10-11 14:08:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:57,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573544171] [2024-10-11 14:08:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573544171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:58,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:08:58,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172076123] [2024-10-11 14:08:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:08:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:08:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:08:58,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:08:58,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 492 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-10-11 14:08:58,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:58,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:08:58,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:59,496 INFO L124 PetriNetUnfolderBase]: 676/1487 cut-off events. [2024-10-11 14:08:59,496 INFO L125 PetriNetUnfolderBase]: For 2812/2812 co-relation queries the response was YES. [2024-10-11 14:08:59,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 1487 events. 676/1487 cut-off events. For 2812/2812 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8836 event pairs, 158 based on Foata normal form. 0/1468 useless extension candidates. Maximal degree in co-relation 4478. Up to 676 conditions per place. [2024-10-11 14:08:59,509 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 88 selfloop transitions, 23 changer transitions 8/125 dead transitions. [2024-10-11 14:08:59,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 975 flow [2024-10-11 14:08:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:08:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:08:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-10-11 14:08:59,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4323671497584541 [2024-10-11 14:08:59,512 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 492 flow. Second operand 9 states and 179 transitions. [2024-10-11 14:08:59,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 975 flow [2024-10-11 14:08:59,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 902 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-10-11 14:08:59,527 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 633 flow [2024-10-11 14:08:59,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=77, 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=633, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-10-11 14:08:59,528 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-10-11 14:08:59,528 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 633 flow [2024-10-11 14:08:59,531 INFO L472 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-10-11 14:08:59,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:59,532 INFO L204 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-10-11 14:08:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:08:59,532 INFO L396 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-10-11 14:08:59,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 646577159, now seen corresponding path program 5 times [2024-10-11 14:08:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324324471] [2024-10-11 14:08:59,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:00,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324324471] [2024-10-11 14:09:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324324471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:00,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:09:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875023564] [2024-10-11 14:09:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:00,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:09:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:09:00,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:09:00,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-10-11 14:09:00,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 633 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-10-11 14:09:00,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:00,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-10-11 14:09:00,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:00,924 INFO L124 PetriNetUnfolderBase]: 727/1596 cut-off events. [2024-10-11 14:09:00,924 INFO L125 PetriNetUnfolderBase]: For 3483/3483 co-relation queries the response was YES. [2024-10-11 14:09:00,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4959 conditions, 1596 events. 727/1596 cut-off events. For 3483/3483 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9579 event pairs, 136 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 4929. Up to 763 conditions per place. [2024-10-11 14:09:00,934 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 99 selfloop transitions, 26 changer transitions 6/137 dead transitions. [2024-10-11 14:09:00,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 137 transitions, 1113 flow [2024-10-11 14:09:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:09:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:09:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 218 transitions. [2024-10-11 14:09:00,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39492753623188404 [2024-10-11 14:09:00,936 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 633 flow. Second operand 12 states and 218 transitions. [2024-10-11 14:09:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 137 transitions, 1113 flow [2024-10-11 14:09:00,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 1041 flow, removed 34 selfloop flow, removed 1 redundant places. [2024-10-11 14:09:00,952 INFO L231 Difference]: Finished difference. Result has 102 places, 86 transitions, 683 flow [2024-10-11 14:09:00,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=683, PETRI_PLACES=102, PETRI_TRANSITIONS=86} [2024-10-11 14:09:00,953 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2024-10-11 14:09:00,953 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 86 transitions, 683 flow [2024-10-11 14:09:00,953 INFO L472 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-10-11 14:09:00,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:00,954 INFO L204 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-10-11 14:09:00,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:09:00,954 INFO L396 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-10-11 14:09:00,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1855109312, now seen corresponding path program 1 times [2024-10-11 14:09:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:00,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888615013] [2024-10-11 14:09:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888615013] [2024-10-11 14:09:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888615013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766347307] [2024-10-11 14:09:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:02,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:02,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:02,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:02,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:09:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:02,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 14:09:02,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:02,408 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-10-11 14:09:02,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 14:09:02,655 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 102 treesize of output 96 [2024-10-11 14:09:02,727 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-10-11 14:09:02,996 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 113 treesize of output 105 [2024-10-11 14:09:03,031 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-10-11 14:09:03,051 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-10-11 14:09:03,065 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 59 treesize of output 50 [2024-10-11 14:09:03,568 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 36 treesize of output 30 [2024-10-11 14:09:03,573 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 71 treesize of output 57 [2024-10-11 14:09:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:03,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:04,272 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:04,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-10-11 14:09:04,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:04,285 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-10-11 14:09:05,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:05,764 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-10-11 14:09:05,832 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:05,832 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-10-11 14:09:08,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:08,625 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 8283 treesize of output 4532 [2024-10-11 14:09:10,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:10,012 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 60 treesize of output 59 [2024-10-11 14:09:15,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (select .cse1 .cse3))) (let ((.cse20 (* .cse21 4)) (.cse22 (= .cse21 22)) (.cse6 (+ |c_~#queue~0.offset| 80)) (.cse23 (= .cse21 21))) (let ((.cse8 (not .cse23)) (.cse25 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|)) (.cse26 (not .cse22)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse13 (+ .cse21 1)) (.cse2 (+ |c_~#queue~0.offset| .cse20)) (.cse27 (= (mod c_~enqueue_flag~0 256) 0))) (and (or (let ((.cse0 (select |c_#memory_int#4| |c_~#stored_elements~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_~value~0#1_17| Int)) (or (forall ((v_DerPreprocessor_17 Int) (|v_t1Thread1of1ForFork0_~i~0#1_19| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_19| 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| |v_t1Thread1of1ForFork0_~value~0#1_17|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_19| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_17) |c_~#stored_elements~0.offset|) 1)))) (not (= 20 (select (store .cse1 .cse2 |v_t1Thread1of1ForFork0_~value~0#1_17|) .cse3))))) (or (and (forall ((|v_t1Thread1of1ForFork0_~i~0#1_19| Int)) (or (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_17 Int)) (or (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| (+ (- 1) v_DerPreprocessor_35)) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_19| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_17) |c_~#stored_elements~0.offset|) 1)) (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_34 Int)) (not (= (let ((.cse4 (+ (* v_DerPreprocessor_35 4) |c_~#queue~0.offset|))) (select (store (store (store .cse1 .cse4 v_DerPreprocessor_24) .cse5 v_DerPreprocessor_25) .cse3 (+ v_DerPreprocessor_35 1)) (+ (* (select (store (store (store .cse1 .cse5 v_DerPreprocessor_34) .cse3 v_DerPreprocessor_35) .cse4 v_DerPreprocessor_24) .cse6) 4) |c_~#queue~0.offset|))) 0))))) (< |v_t1Thread1of1ForFork0_~i~0#1_19| 0))) (forall ((v_prenex_67 Int)) (or (< v_prenex_67 0) (forall ((v_DerPreprocessor_35 Int) (v_prenex_65 Int)) (or (forall ((v_DerPreprocessor_34 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_19 Int)) (= (let ((.cse7 (+ (* v_DerPreprocessor_35 4) |c_~#queue~0.offset|))) (select (store (store (store .cse1 .cse7 v_DerPreprocessor_18) .cse5 v_DerPreprocessor_19) .cse3 (+ v_DerPreprocessor_35 1)) (+ (* (select (store (store (store .cse1 .cse5 v_DerPreprocessor_34) .cse3 v_DerPreprocessor_35) .cse7 v_DerPreprocessor_18) .cse6) 4) |c_~#queue~0.offset|))) 0)) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| (+ (- 1) v_DerPreprocessor_35)) (+ (* v_prenex_67 4) |c_~#stored_elements~0.offset| 4) v_prenex_65) |c_~#stored_elements~0.offset|) 0))))))) .cse8) (forall ((|v_t1Thread1of1ForFork0_~value~0#1_17| Int)) (or (not (= 20 (select (store .cse1 .cse2 |v_t1Thread1of1ForFork0_~value~0#1_17|) .cse3))) (forall ((v_prenex_59 Int) (v_prenex_61 Int)) (or (< v_prenex_61 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| |v_t1Thread1of1ForFork0_~value~0#1_17|) (+ (* v_prenex_61 4) |c_~#stored_elements~0.offset| 4) v_prenex_59) |c_~#stored_elements~0.offset|) 0)))))) (or (let ((.cse12 (+ .cse21 2)) (.cse15 (= .cse21 19)) (.cse14 (= .cse21 20)) (.cse11 (+ |c_~#queue~0.offset| .cse20 4))) (and (or (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int) (|v_t1Thread1of1ForFork0_~i~0#1_19| Int)) (let ((.cse10 (store .cse1 .cse2 v_DerPreprocessor_31))) (let ((.cse9 (store (store .cse10 .cse5 v_DerPreprocessor_32) .cse3 .cse13))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_19| 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| (select .cse9 .cse2)) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_19| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_17) |c_~#stored_elements~0.offset|) 0)) (= (select (store (store (store .cse10 .cse11 v_DerPreprocessor_18) .cse5 v_DerPreprocessor_19) .cse3 .cse12) (+ (* (select (store .cse9 .cse11 v_DerPreprocessor_18) .cse6) 4) |c_~#queue~0.offset|)) 0))))) .cse14 .cse15) (or .cse14 (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int) (v_prenex_62 Int) (v_prenex_64 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int)) (let ((.cse17 (store .cse1 .cse2 v_DerPreprocessor_31))) (let ((.cse16 (store (store .cse17 .cse5 v_DerPreprocessor_32) .cse3 .cse13))) (or (< v_prenex_64 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| (select .cse16 .cse2)) (+ (* v_prenex_64 4) |c_~#stored_elements~0.offset| 4) v_prenex_62) |c_~#stored_elements~0.offset|) 1)) (not (= (select (store (store (store .cse17 .cse11 v_DerPreprocessor_24) .cse5 v_DerPreprocessor_25) .cse3 .cse12) (+ |c_~#queue~0.offset| (* (select (store .cse16 .cse11 v_DerPreprocessor_24) .cse6) 4))) 0)))))) .cse15) (or (forall ((v_DerPreprocessor_17 Int) (v_ArrVal_391 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int) (|v_t1Thread1of1ForFork0_~i~0#1_19| Int)) (let ((.cse18 (store (store (store .cse1 .cse2 v_DerPreprocessor_31) .cse5 v_DerPreprocessor_32) .cse3 .cse13))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_19| 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| (select .cse18 .cse2)) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_19| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_17) |c_~#stored_elements~0.offset|) 0)) (not (= 20 (select (store .cse18 .cse11 v_ArrVal_391) .cse3)))))) .cse14) (or .cse14 (forall ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int)) (let ((.cse19 (store (store (store .cse1 .cse2 v_DerPreprocessor_31) .cse5 v_DerPreprocessor_32) .cse3 .cse13))) (or (< v_prenex_64 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| (select .cse19 .cse2)) (+ (* v_prenex_64 4) |c_~#stored_elements~0.offset| 4) v_prenex_62) |c_~#stored_elements~0.offset|) 1)) (not (= 20 (select (store .cse19 .cse11 v_prenex_63) .cse3))))))))) .cse22 .cse23) (or (let ((.cse24 (+ 92 |c_~#queue~0.offset|))) (and (or (forall ((v_DerPreprocessor_24 Int) (v_DerPreprocessor_25 Int)) (not (= (select (store (store (store .cse1 .cse24 v_DerPreprocessor_24) .cse5 v_DerPreprocessor_25) .cse3 24) .cse25) 0))) (forall ((v_DerPreprocessor_17 Int) (|v_t1Thread1of1ForFork0_~value~0#1_17| Int) (|v_t1Thread1of1ForFork0_~i~0#1_19| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_19| 0) (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| |v_t1Thread1of1ForFork0_~value~0#1_17|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_19| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_17) |c_~#stored_elements~0.offset|) 1))))) (or (forall ((v_prenex_68 Int) (v_prenex_70 Int) (|v_t1Thread1of1ForFork0_~value~0#1_17| Int)) (or (not (= (select (store (store .cse0 |c_~#stored_elements~0.offset| |v_t1Thread1of1ForFork0_~value~0#1_17|) (+ |c_~#stored_elements~0.offset| (* v_prenex_70 4) 4) v_prenex_68) |c_~#stored_elements~0.offset|) 0)) (< v_prenex_70 0))) (forall ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_19 Int)) (= (select (store (store (store .cse1 .cse24 v_DerPreprocessor_18) .cse5 v_DerPreprocessor_19) .cse3 24) .cse25) 0))))) .cse26))) .cse27) (or (and (or (and (forall ((v_DerPreprocessor_37 Int)) (= (select (store (store .cse1 .cse5 v_DerPreprocessor_37) .cse3 1) .cse25) 0)) (forall ((v_DerPreprocessor_37 Int)) (not (= (select (store (store .cse1 .cse5 v_DerPreprocessor_37) .cse3 2) .cse25) 0)))) .cse8) (not (= (select (store .cse1 .cse2 1) .cse3) 20)) (or (and (forall ((v_DerPreprocessor_42 Int)) (= (select (store (store .cse1 .cse5 v_DerPreprocessor_42) .cse3 23) .cse25) 0)) (forall ((v_DerPreprocessor_42 Int)) (not (= (select (store (store .cse1 .cse5 v_DerPreprocessor_42) .cse3 23) .cse25) 0)))) .cse26) (or .cse22 .cse23 (and (forall ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_40 Int)) (let ((.cse29 (store .cse1 .cse2 v_DerPreprocessor_39))) (let ((.cse28 (store (store .cse29 .cse5 v_DerPreprocessor_40) .cse3 .cse13))) (or (not (= (select .cse28 .cse2) 1)) (not (= (select .cse28 (+ (* (select .cse29 .cse6) 4) |c_~#queue~0.offset|)) 0)))))) (forall ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_40 Int)) (let ((.cse31 (store .cse1 .cse2 v_DerPreprocessor_39))) (let ((.cse30 (store (store .cse31 .cse5 v_DerPreprocessor_40) .cse3 .cse13))) (or (not (= (select .cse30 .cse2) 0)) (= (select .cse30 (+ (* (select .cse31 .cse6) 4) |c_~#queue~0.offset|)) 0)))))))) (not .cse27))))))) is different from false [2024-10-11 14:09:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766347307] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:16,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-11 14:09:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23520951] [2024-10-11 14:09:16,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:16,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 14:09:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 14:09:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=571, Unknown=2, NotChecked=50, Total=756 [2024-10-11 14:09:16,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2024-10-11 14:09:16,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 86 transitions, 683 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-10-11 14:09:16,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:16,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2024-10-11 14:09:16,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:19,030 INFO L124 PetriNetUnfolderBase]: 1471/2740 cut-off events. [2024-10-11 14:09:19,030 INFO L125 PetriNetUnfolderBase]: For 5687/5687 co-relation queries the response was YES. [2024-10-11 14:09:19,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8545 conditions, 2740 events. 1471/2740 cut-off events. For 5687/5687 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15686 event pairs, 313 based on Foata normal form. 18/2749 useless extension candidates. Maximal degree in co-relation 8512. Up to 1570 conditions per place. [2024-10-11 14:09:19,054 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 114 selfloop transitions, 46 changer transitions 4/167 dead transitions. [2024-10-11 14:09:19,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 167 transitions, 1418 flow [2024-10-11 14:09:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:09:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:09:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-10-11 14:09:19,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3675889328063241 [2024-10-11 14:09:19,056 INFO L175 Difference]: Start difference. First operand has 102 places, 86 transitions, 683 flow. Second operand 11 states and 186 transitions. [2024-10-11 14:09:19,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 167 transitions, 1418 flow [2024-10-11 14:09:19,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 167 transitions, 1299 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-10-11 14:09:19,080 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 1015 flow [2024-10-11 14:09:19,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1015, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2024-10-11 14:09:19,081 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-10-11 14:09:19,081 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 1015 flow [2024-10-11 14:09:19,081 INFO L472 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-10-11 14:09:19,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:19,082 INFO L204 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-10-11 14:09:19,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:09:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 14:09:19,287 INFO L396 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-10-11 14:09:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 353751728, now seen corresponding path program 2 times [2024-10-11 14:09:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793904675] [2024-10-11 14:09:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:20,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793904675] [2024-10-11 14:09:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793904675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163938844] [2024-10-11 14:09:20,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:09:20,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:20,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:20,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:20,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:09:20,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:09:20,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:09:20,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 14:09:20,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:20,675 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-10-11 14:09:20,682 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-10-11 14:09:20,765 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-10-11 14:09:20,797 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-10-11 14:09:21,136 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 37 treesize of output 32 [2024-10-11 14:09:21,194 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 94 treesize of output 79 [2024-10-11 14:09:21,972 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 116 treesize of output 96 [2024-10-11 14:09:21,976 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 94 treesize of output 86 [2024-10-11 14:09:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:22,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:22,403 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:22,403 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-10-11 14:09:22,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:22,416 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-10-11 14:09:23,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:23,791 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-10-11 14:09:23,851 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:23,852 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-10-11 14:09:28,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| |c_~#queue~0.base|)) (.cse7 (+ 84 |c_~#queue~0.offset|))) (let ((.cse19 (select .cse5 .cse7)) (.cse13 (+ |c_~#queue~0.offset| 80))) (let ((.cse2 (select |c_#memory_int#4| |c_~#stored_elements~0.base|)) (.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse8 (+ (* (select .cse5 .cse13) 4) |c_~#queue~0.offset|)) (.cse16 (= .cse19 22)) (.cse14 (+ |c_~#queue~0.offset| (* .cse19 4))) (.cse17 (= .cse19 21))) (let ((.cse4 (not .cse17)) (.cse12 (+ .cse19 1)) (.cse15 (= .cse19 20)) (.cse9 (forall ((v_ArrVal_510 Int)) (not (= (select (store .cse5 .cse14 v_ArrVal_510) .cse7) 20)))) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse10 (not .cse16)) (.cse0 (= (select .cse5 .cse8) 0)) (.cse1 (select .cse2 .cse3))) (and (or (not .cse0) (not (= .cse1 1))) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_24| Int) (v_DerPreprocessor_58 Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_24| 0) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_~i~0#1_24| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_58) .cse3) 0)))) (and (or .cse4 (forall ((v_DerPreprocessor_62 Int) (v_DerPreprocessor_63 Int)) (or (= (select (store (store .cse5 .cse6 v_DerPreprocessor_62) .cse7 v_DerPreprocessor_63) .cse8) 0) (= v_DerPreprocessor_63 21)))) .cse9 (or (forall ((v_DerPreprocessor_64 Int)) (= (select (store (store .cse5 .cse6 v_DerPreprocessor_64) .cse7 23) .cse8) 0)) .cse10) (or (forall ((v_DerPreprocessor_59 Int) (v_DerPreprocessor_60 Int)) (= (let ((.cse11 (store .cse5 .cse14 v_DerPreprocessor_59))) (select (store (store .cse11 .cse6 v_DerPreprocessor_60) .cse7 .cse12) (+ |c_~#queue~0.offset| (* (select .cse11 .cse13) 4)))) 0)) .cse15 .cse16 .cse17))) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_24| Int) (v_DerPreprocessor_58 Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_24| 0) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_~i~0#1_24| 4) |c_~#stored_elements~0.offset| 4) v_DerPreprocessor_58) .cse3) 1)))) (and (or (forall ((v_DerPreprocessor_66 Int) (v_DerPreprocessor_65 Int)) (or (= v_DerPreprocessor_66 21) (not (= (select (store (store .cse5 .cse6 v_DerPreprocessor_65) .cse7 v_DerPreprocessor_66) .cse8) 0)))) .cse4) (or (forall ((v_DerPreprocessor_68 Int) (v_DerPreprocessor_67 Int)) (not (= (let ((.cse18 (store .cse5 .cse14 v_DerPreprocessor_67))) (select (store (store .cse18 .cse6 v_DerPreprocessor_68) .cse7 .cse12) (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse13))))) 0))) .cse15 .cse16 .cse17) .cse9 (or (forall ((v_DerPreprocessor_69 Int)) (not (= (select (store (store .cse5 .cse6 v_DerPreprocessor_69) .cse7 23) .cse8) 0))) .cse10))) (or .cse0 (not (= .cse1 0)))))))) is different from false [2024-10-11 14:09:29,128 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:29,129 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-10-11 14:09:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163938844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:29,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:29,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-11 14:09:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647852585] [2024-10-11 14:09:29,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:29,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 14:09:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 14:09:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=581, Unknown=1, NotChecked=50, Total=756 [2024-10-11 14:09:29,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2024-10-11 14:09:29,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 1015 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-10-11 14:09:29,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:29,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2024-10-11 14:09:29,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:32,592 INFO L124 PetriNetUnfolderBase]: 2059/3844 cut-off events. [2024-10-11 14:09:32,592 INFO L125 PetriNetUnfolderBase]: For 11760/11760 co-relation queries the response was YES. [2024-10-11 14:09:32,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13069 conditions, 3844 events. 2059/3844 cut-off events. For 11760/11760 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 22697 event pairs, 356 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 13032. Up to 1569 conditions per place. [2024-10-11 14:09:32,622 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 190 selfloop transitions, 55 changer transitions 8/256 dead transitions. [2024-10-11 14:09:32,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 256 transitions, 2321 flow [2024-10-11 14:09:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:09:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 14:09:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 289 transitions. [2024-10-11 14:09:32,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39266304347826086 [2024-10-11 14:09:32,626 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 1015 flow. Second operand 16 states and 289 transitions. [2024-10-11 14:09:32,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 256 transitions, 2321 flow [2024-10-11 14:09:32,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 256 transitions, 2258 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-10-11 14:09:32,669 INFO L231 Difference]: Finished difference. Result has 126 places, 137 transitions, 1483 flow [2024-10-11 14:09:32,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1483, PETRI_PLACES=126, PETRI_TRANSITIONS=137} [2024-10-11 14:09:32,670 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2024-10-11 14:09:32,670 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 137 transitions, 1483 flow [2024-10-11 14:09:32,670 INFO L472 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-10-11 14:09:32,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:32,670 INFO L204 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-10-11 14:09:32,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:09:32,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:32,871 INFO L396 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-10-11 14:09:32,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1228420974, now seen corresponding path program 3 times [2024-10-11 14:09:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157897524] [2024-10-11 14:09:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157897524] [2024-10-11 14:09:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157897524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94313926] [2024-10-11 14:09:34,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:09:34,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:34,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:34,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:34,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:09:34,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 14:09:34,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:09:34,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 14:09:34,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:34,306 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-10-11 14:09:34,312 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-10-11 14:09:34,380 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 102 treesize of output 96 [2024-10-11 14:09:34,384 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-10-11 14:09:34,422 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-10-11 14:09:34,748 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 57 [2024-10-11 14:09:34,777 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-10-11 14:09:35,407 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 114 treesize of output 98 [2024-10-11 14:09:35,411 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 106 treesize of output 92 [2024-10-11 14:09:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:35,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:35,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:35,737 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-10-11 14:09:35,783 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:35,784 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-10-11 14:09:36,874 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:36,874 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-10-11 14:09:36,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:36,882 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-10-11 14:09:38,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:38,451 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-10-11 14:09:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94313926] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:38,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-11 14:09:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461917958] [2024-10-11 14:09:38,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 14:09:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 14:09:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-10-11 14:09:39,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-10-11 14:09:39,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 137 transitions, 1483 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-10-11 14:09:39,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:39,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-10-11 14:09:39,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:44,220 INFO L124 PetriNetUnfolderBase]: 1726/3551 cut-off events. [2024-10-11 14:09:44,220 INFO L125 PetriNetUnfolderBase]: For 18295/18297 co-relation queries the response was YES. [2024-10-11 14:09:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14330 conditions, 3551 events. 1726/3551 cut-off events. For 18295/18297 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23575 event pairs, 135 based on Foata normal form. 0/3530 useless extension candidates. Maximal degree in co-relation 14283. Up to 628 conditions per place. [2024-10-11 14:09:44,253 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 185 selfloop transitions, 123 changer transitions 9/322 dead transitions. [2024-10-11 14:09:44,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 322 transitions, 3467 flow [2024-10-11 14:09:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 14:09:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 14:09:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 402 transitions. [2024-10-11 14:09:44,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39723320158102765 [2024-10-11 14:09:44,257 INFO L175 Difference]: Start difference. First operand has 126 places, 137 transitions, 1483 flow. Second operand 22 states and 402 transitions. [2024-10-11 14:09:44,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 322 transitions, 3467 flow [2024-10-11 14:09:44,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 322 transitions, 3321 flow, removed 54 selfloop flow, removed 6 redundant places. [2024-10-11 14:09:44,313 INFO L231 Difference]: Finished difference. Result has 152 places, 183 transitions, 2370 flow [2024-10-11 14:09:44,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2370, PETRI_PLACES=152, PETRI_TRANSITIONS=183} [2024-10-11 14:09:44,314 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-10-11 14:09:44,314 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 183 transitions, 2370 flow [2024-10-11 14:09:44,315 INFO L472 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-10-11 14:09:44,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:44,315 INFO L204 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-10-11 14:09:44,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:09:44,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:44,520 INFO L396 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-10-11 14:09:44,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1516634384, now seen corresponding path program 4 times [2024-10-11 14:09:44,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:44,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332656421] [2024-10-11 14:09:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332656421] [2024-10-11 14:09:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332656421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099776009] [2024-10-11 14:09:45,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 14:09:45,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:45,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:45,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:09:45,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 14:09:45,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:09:45,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 14:09:45,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:45,646 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-10-11 14:09:45,652 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-10-11 14:09:45,746 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 102 treesize of output 96 [2024-10-11 14:09:45,805 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-10-11 14:09:45,944 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 113 treesize of output 105 [2024-10-11 14:09:45,961 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-10-11 14:09:45,976 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 59 treesize of output 50 [2024-10-11 14:09:46,393 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 69 treesize of output 59 [2024-10-11 14:09:46,397 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 45 treesize of output 35 [2024-10-11 14:09:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:46,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:46,769 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:46,769 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-10-11 14:09:46,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:46,818 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-10-11 14:09:47,962 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:47,962 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-10-11 14:09:47,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:47,973 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-10-11 14:09:49,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:49,293 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-10-11 14:09:49,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-10-11 14:09:49,369 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 14:09:49,403 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 14:09:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:50,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099776009] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:50,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:50,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-10-11 14:09:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509910505] [2024-10-11 14:09:50,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:50,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 14:09:50,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:50,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 14:09:50,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-10-11 14:09:50,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-10-11 14:09:50,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 183 transitions, 2370 flow. Second operand has 30 states, 30 states have (on average 11.266666666666667) internal successors, (338), 30 states have internal predecessors, (338), 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-10-11 14:09:50,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:50,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-10-11 14:09:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:52,950 INFO L124 PetriNetUnfolderBase]: 1050/2295 cut-off events. [2024-10-11 14:09:52,951 INFO L125 PetriNetUnfolderBase]: For 16796/16798 co-relation queries the response was YES. [2024-10-11 14:09:52,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10040 conditions, 2295 events. 1050/2295 cut-off events. For 16796/16798 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14731 event pairs, 76 based on Foata normal form. 95/2383 useless extension candidates. Maximal degree in co-relation 9981. Up to 481 conditions per place. [2024-10-11 14:09:52,968 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 130 selfloop transitions, 96 changer transitions 11/242 dead transitions. [2024-10-11 14:09:52,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 242 transitions, 2784 flow [2024-10-11 14:09:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 14:09:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 14:09:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 323 transitions. [2024-10-11 14:09:52,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2024-10-11 14:09:52,971 INFO L175 Difference]: Start difference. First operand has 152 places, 183 transitions, 2370 flow. Second operand 19 states and 323 transitions. [2024-10-11 14:09:52,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 242 transitions, 2784 flow [2024-10-11 14:09:53,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 242 transitions, 2522 flow, removed 93 selfloop flow, removed 18 redundant places. [2024-10-11 14:09:53,032 INFO L231 Difference]: Finished difference. Result has 150 places, 154 transitions, 1878 flow [2024-10-11 14:09:53,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1878, PETRI_PLACES=150, PETRI_TRANSITIONS=154} [2024-10-11 14:09:53,034 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2024-10-11 14:09:53,034 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 154 transitions, 1878 flow [2024-10-11 14:09:53,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.266666666666667) internal successors, (338), 30 states have internal predecessors, (338), 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-10-11 14:09:53,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:53,035 INFO L204 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-10-11 14:09:53,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:09:53,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 14:09:53,235 INFO L396 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-10-11 14:09:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 468998180, now seen corresponding path program 5 times [2024-10-11 14:09:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332212100] [2024-10-11 14:09:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332212100] [2024-10-11 14:09:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332212100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764408503] [2024-10-11 14:09:54,709 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 14:09:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:54,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:54,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:54,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:09:54,867 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:09:54,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:09:54,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 14:09:54,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:54,881 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-10-11 14:09:54,884 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-10-11 14:09:54,939 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 102 treesize of output 96 [2024-10-11 14:09:54,992 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-10-11 14:09:55,213 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 37 treesize of output 32 [2024-10-11 14:09:55,241 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 98 treesize of output 81 [2024-10-11 14:09:55,826 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 114 treesize of output 102 [2024-10-11 14:09:55,828 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 92 [2024-10-11 14:09:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:55,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:56,091 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:56,091 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-10-11 14:09:56,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:56,098 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-10-11 14:09:58,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:58,832 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-10-11 14:09:58,845 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:58,846 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-10-11 14:10:00,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-11 14:10:00,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:10:00,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 126 [2024-10-11 14:10:00,498 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-10-11 14:10:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 130 [2024-10-11 14:10:00,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:10:00,521 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-10-11 14:10:00,848 WARN L214 Elim1Store]: Array PQE input equivalent to true