./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:26:47,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:26:48,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:26:48,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:26:48,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:26:48,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:26:48,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:26:48,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:26:48,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:26:48,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:26:48,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:26:48,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:26:48,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:26:48,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:26:48,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:26:48,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:26:48,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:26:48,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:26:48,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:26:48,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:26:48,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:26:48,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:26:48,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:26:48,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:26:48,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:26:48,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:26:48,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:26:48,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:26:48,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:26:48,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:26:48,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:26:48,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:26:48,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:26:48,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:26:48,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:26:48,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:26:48,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:26:48,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:26:48,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:26:48,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:26:48,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:26:48,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:26:48,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2024-11-22 13:26:48,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:26:48,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:26:48,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:26:48,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:26:48,323 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:26:48,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2024-11-22 13:26:49,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:26:49,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:26:49,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2024-11-22 13:26:49,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930761aec/50902fd619774b318640f9f4c09535d4/FLAGa368a38f9 [2024-11-22 13:26:49,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930761aec/50902fd619774b318640f9f4c09535d4 [2024-11-22 13:26:49,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:26:49,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:26:49,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:26:49,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:26:49,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:26:49,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:26:49" (1/1) ... [2024-11-22 13:26:49,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0a21cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:49, skipping insertion in model container [2024-11-22 13:26:49,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:26:49" (1/1) ... [2024-11-22 13:26:49,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:26:50,341 WARN L250 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-11-22 13:26:50,349 WARN L250 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-11-22 13:26:50,353 WARN L250 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-11-22 13:26:50,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:26:50,373 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:26:50,415 WARN L250 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-11-22 13:26:50,416 WARN L250 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-11-22 13:26:50,421 WARN L250 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-11-22 13:26:50,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:26:50,471 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:26:50,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50 WrapperNode [2024-11-22 13:26:50,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:26:50,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:26:50,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:26:50,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:26:50,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,529 INFO L138 Inliner]: procedures = 274, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 289 [2024-11-22 13:26:50,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:26:50,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:26:50,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:26:50,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:26:50,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,574 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2024-11-22 13:26:50,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:26:50,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:26:50,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:26:50,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:26:50,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (1/1) ... [2024-11-22 13:26:50,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:26:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:26:50,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:26:50,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:26:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-22 13:26:50,693 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-22 13:26:50,694 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 13:26:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 13:26:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 13:26:50,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 13:26:50,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:26:50,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:26:50,697 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:26:50,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:26:50,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:26:51,195 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:26:51,195 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:26:51,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:26:51,553 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 13:26:51,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:51 BoogieIcfgContainer [2024-11-22 13:26:51,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:26:51,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:26:51,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:26:51,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:26:51,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:26:49" (1/3) ... [2024-11-22 13:26:51,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d5c4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:26:51, skipping insertion in model container [2024-11-22 13:26:51,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:50" (2/3) ... [2024-11-22 13:26:51,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d5c4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:26:51, skipping insertion in model container [2024-11-22 13:26:51,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:51" (3/3) ... [2024-11-22 13:26:51,608 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-11-22 13:26:51,625 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:26:51,625 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 13:26:51,625 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:26:51,673 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-22 13:26:51,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 106 flow [2024-11-22 13:26:51,726 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-11-22 13:26:51,727 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 13:26:51,729 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 84 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-11-22 13:26:51,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 46 transitions, 106 flow [2024-11-22 13:26:51,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 93 flow [2024-11-22 13:26:51,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:26:51,752 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;@30b36e87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:26:51,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 13:26:51,758 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:26:51,759 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-22 13:26:51,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 13:26:51,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:51,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 13:26:51,760 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-11-22 13:26:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 728439, now seen corresponding path program 1 times [2024-11-22 13:26:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929299479] [2024-11-22 13:26:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:26:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:51,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929299479] [2024-11-22 13:26:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929299479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:26:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893360740] [2024-11-22 13:26:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:51,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:26:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:26:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:26:52,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:52,007 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-11-22 13:26:52,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:52,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:52,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:52,214 INFO L124 PetriNetUnfolderBase]: 425/767 cut-off events. [2024-11-22 13:26:52,216 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-22 13:26:52,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 767 events. 425/767 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3464 event pairs, 331 based on Foata normal form. 47/725 useless extension candidates. Maximal degree in co-relation 1440. Up to 693 conditions per place. [2024-11-22 13:26:52,224 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2024-11-22 13:26:52,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 143 flow [2024-11-22 13:26:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:26:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 13:26:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2024-11-22 13:26:52,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-11-22 13:26:52,237 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 93 flow. Second operand 2 states and 53 transitions. [2024-11-22 13:26:52,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 143 flow [2024-11-22 13:26:52,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:26:52,241 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2024-11-22 13:26:52,242 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-11-22 13:26:52,245 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-22 13:26:52,245 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2024-11-22 13:26:52,245 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-11-22 13:26:52,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:52,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:26:52,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:26:52,250 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-11-22 13:26:52,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1716952597, now seen corresponding path program 1 times [2024-11-22 13:26:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:52,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724602937] [2024-11-22 13:26:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:26:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724602937] [2024-11-22 13:26:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724602937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:26:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684660989] [2024-11-22 13:26:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:52,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:26:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:26:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:26:52,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:52,392 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-11-22 13:26:52,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:52,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:52,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:52,520 INFO L124 PetriNetUnfolderBase]: 405/747 cut-off events. [2024-11-22 13:26:52,520 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-22 13:26:52,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 747 events. 405/747 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3505 event pairs, 304 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 1446. Up to 623 conditions per place. [2024-11-22 13:26:52,524 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-11-22 13:26:52,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2024-11-22 13:26:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:26:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:26:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-22 13:26:52,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-11-22 13:26:52,525 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 72 transitions. [2024-11-22 13:26:52,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2024-11-22 13:26:52,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:26:52,527 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 80 flow [2024-11-22 13:26:52,527 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-11-22 13:26:52,528 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2024-11-22 13:26:52,528 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 80 flow [2024-11-22 13:26:52,528 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-11-22 13:26:52,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:52,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:26:52,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:26:52,529 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-11-22 13:26:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1685924698, now seen corresponding path program 1 times [2024-11-22 13:26:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575436453] [2024-11-22 13:26:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:26:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575436453] [2024-11-22 13:26:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575436453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:52,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:26:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960581650] [2024-11-22 13:26:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:52,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:26:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:26:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:26:52,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:52,775 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-11-22 13:26:52,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:52,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:52,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:53,025 INFO L124 PetriNetUnfolderBase]: 674/1238 cut-off events. [2024-11-22 13:26:53,025 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-22 13:26:53,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1238 events. 674/1238 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6158 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-11-22 13:26:53,031 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 70 selfloop transitions, 10 changer transitions 3/90 dead transitions. [2024-11-22 13:26:53,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 367 flow [2024-11-22 13:26:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:26:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:26:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-22 13:26:53,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2024-11-22 13:26:53,033 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 80 flow. Second operand 6 states and 145 transitions. [2024-11-22 13:26:53,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 367 flow [2024-11-22 13:26:53,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:26:53,035 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 144 flow [2024-11-22 13:26:53,035 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-11-22 13:26:53,036 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-11-22 13:26:53,036 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 144 flow [2024-11-22 13:26:53,036 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-11-22 13:26:53,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:53,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:26:53,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:26:53,037 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-11-22 13:26:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1031076533, now seen corresponding path program 1 times [2024-11-22 13:26:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262005860] [2024-11-22 13:26:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:26:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262005860] [2024-11-22 13:26:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262005860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:53,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:26:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031747253] [2024-11-22 13:26:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:26:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:26:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:26:53,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:53,097 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-11-22 13:26:53,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:53,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:53,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:53,228 INFO L124 PetriNetUnfolderBase]: 421/811 cut-off events. [2024-11-22 13:26:53,229 INFO L125 PetriNetUnfolderBase]: For 151/154 co-relation queries the response was YES. [2024-11-22 13:26:53,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 811 events. 421/811 cut-off events. For 151/154 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3544 event pairs, 215 based on Foata normal form. 28/815 useless extension candidates. Maximal degree in co-relation 1669. Up to 416 conditions per place. [2024-11-22 13:26:53,232 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2024-11-22 13:26:53,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 213 flow [2024-11-22 13:26:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:26:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:26:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-22 13:26:53,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2024-11-22 13:26:53,233 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 144 flow. Second operand 3 states and 73 transitions. [2024-11-22 13:26:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 213 flow [2024-11-22 13:26:53,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:26:53,234 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2024-11-22 13:26:53,235 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-11-22 13:26:53,235 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-11-22 13:26:53,235 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 106 flow [2024-11-22 13:26:53,236 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-11-22 13:26:53,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:53,236 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-11-22 13:26:53,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:26:53,236 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-11-22 13:26:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -154484162, now seen corresponding path program 1 times [2024-11-22 13:26:53,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:53,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989964111] [2024-11-22 13:26:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:26:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:53,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989964111] [2024-11-22 13:26:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989964111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:26:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290000220] [2024-11-22 13:26:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:53,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:26:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:26:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:26:53,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:53,322 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-11-22 13:26:53,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:53,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:53,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:53,404 INFO L124 PetriNetUnfolderBase]: 249/543 cut-off events. [2024-11-22 13:26:53,404 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-22 13:26:53,405 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 2174 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-11-22 13:26:53,406 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-11-22 13:26:53,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2024-11-22 13:26:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:26:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:26:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-22 13:26:53,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-11-22 13:26:53,408 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 106 flow. Second operand 3 states and 70 transitions. [2024-11-22 13:26:53,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2024-11-22 13:26:53,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 197 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-22 13:26:53,410 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2024-11-22 13:26:53,410 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-11-22 13:26:53,410 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-11-22 13:26:53,410 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2024-11-22 13:26:53,411 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-11-22 13:26:53,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:53,411 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-11-22 13:26:53,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:26:53,411 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-11-22 13:26:53,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 764459331, now seen corresponding path program 1 times [2024-11-22 13:26:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053246850] [2024-11-22 13:26:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:26:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053246850] [2024-11-22 13:26:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053246850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:54,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:54,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:26:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129986408] [2024-11-22 13:26:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:54,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:26:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:26:54,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:26:54,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:54,613 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-11-22 13:26:54,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:54,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:54,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:54,975 INFO L124 PetriNetUnfolderBase]: 357/784 cut-off events. [2024-11-22 13:26:54,975 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-11-22 13:26:54,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 784 events. 357/784 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3763 event pairs, 76 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 1698. Up to 264 conditions per place. [2024-11-22 13:26:54,978 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 64 selfloop transitions, 14 changer transitions 8/92 dead transitions. [2024-11-22 13:26:54,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 451 flow [2024-11-22 13:26:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:26:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:26:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-11-22 13:26:54,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2024-11-22 13:26:54,980 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 9 states and 176 transitions. [2024-11-22 13:26:54,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 451 flow [2024-11-22 13:26:54,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:26:54,982 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 200 flow [2024-11-22 13:26:54,982 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-22 13:26:54,982 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-11-22 13:26:54,982 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 200 flow [2024-11-22 13:26:54,983 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-11-22 13:26:54,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:54,983 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-11-22 13:26:54,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:26:54,983 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-11-22 13:26:54,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1500297411, now seen corresponding path program 2 times [2024-11-22 13:26:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:54,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713917935] [2024-11-22 13:26:54,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:26:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:55,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:26:55,022 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:26:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713917935] [2024-11-22 13:26:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713917935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:26:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917574455] [2024-11-22 13:26:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:26:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:55,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:26:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:26:55,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:55,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 200 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-11-22 13:26:55,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:55,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:55,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:56,260 INFO L124 PetriNetUnfolderBase]: 466/1032 cut-off events. [2024-11-22 13:26:56,261 INFO L125 PetriNetUnfolderBase]: For 810/811 co-relation queries the response was YES. [2024-11-22 13:26:56,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 1032 events. 466/1032 cut-off events. For 810/811 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5712 event pairs, 131 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 2673. Up to 607 conditions per place. [2024-11-22 13:26:56,265 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 68 selfloop transitions, 15 changer transitions 4/93 dead transitions. [2024-11-22 13:26:56,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 564 flow [2024-11-22 13:26:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:26:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:26:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-11-22 13:26:56,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2024-11-22 13:26:56,267 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 200 flow. Second operand 9 states and 166 transitions. [2024-11-22 13:26:56,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 564 flow [2024-11-22 13:26:56,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 546 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-22 13:26:56,274 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 345 flow [2024-11-22 13:26:56,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-22 13:26:56,275 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-11-22 13:26:56,276 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 345 flow [2024-11-22 13:26:56,276 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-11-22 13:26:56,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:56,277 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-11-22 13:26:56,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:26:56,277 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-11-22 13:26:56,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1126709941, now seen corresponding path program 3 times [2024-11-22 13:26:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:56,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496001121] [2024-11-22 13:26:56,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:26:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:56,312 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:26:56,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:26:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496001121] [2024-11-22 13:26:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496001121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:57,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:26:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354445014] [2024-11-22 13:26:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:57,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:26:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:57,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:26:57,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:26:57,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:57,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 345 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-11-22 13:26:57,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:57,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:57,787 INFO L124 PetriNetUnfolderBase]: 586/1286 cut-off events. [2024-11-22 13:26:57,787 INFO L125 PetriNetUnfolderBase]: For 1638/1640 co-relation queries the response was YES. [2024-11-22 13:26:57,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 1286 events. 586/1286 cut-off events. For 1638/1640 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7325 event pairs, 58 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 3591. Up to 293 conditions per place. [2024-11-22 13:26:57,796 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 88 selfloop transitions, 32 changer transitions 6/132 dead transitions. [2024-11-22 13:26:57,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 878 flow [2024-11-22 13:26:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:26:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 13:26:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-11-22 13:26:57,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-11-22 13:26:57,798 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 345 flow. Second operand 12 states and 230 transitions. [2024-11-22 13:26:57,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 878 flow [2024-11-22 13:26:57,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 132 transitions, 832 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-22 13:26:57,810 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 463 flow [2024-11-22 13:26:57,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=463, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-11-22 13:26:57,811 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-11-22 13:26:57,812 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 463 flow [2024-11-22 13:26:57,813 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-11-22 13:26:57,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:57,813 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-11-22 13:26:57,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:26:57,813 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-11-22 13:26:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash -570065181, now seen corresponding path program 4 times [2024-11-22 13:26:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059384612] [2024-11-22 13:26:57,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:26:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:57,858 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:26:57,858 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:26:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:26:58,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:26:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059384612] [2024-11-22 13:26:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059384612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:26:58,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:26:58,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 13:26:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340781732] [2024-11-22 13:26:58,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:26:58,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:26:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:26:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:26:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:26:58,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-11-22 13:26:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 463 flow. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 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-11-22 13:26:58,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:26:58,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-11-22 13:26:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:26:59,245 INFO L124 PetriNetUnfolderBase]: 685/1518 cut-off events. [2024-11-22 13:26:59,246 INFO L125 PetriNetUnfolderBase]: For 2939/2942 co-relation queries the response was YES. [2024-11-22 13:26:59,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4593 conditions, 1518 events. 685/1518 cut-off events. For 2939/2942 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8894 event pairs, 119 based on Foata normal form. 3/1508 useless extension candidates. Maximal degree in co-relation 4570. Up to 648 conditions per place. [2024-11-22 13:26:59,254 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 89 selfloop transitions, 28 changer transitions 8/131 dead transitions. [2024-11-22 13:26:59,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 994 flow [2024-11-22 13:26:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 13:26:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 13:26:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-11-22 13:26:59,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2024-11-22 13:26:59,256 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 463 flow. Second operand 10 states and 195 transitions. [2024-11-22 13:26:59,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 994 flow [2024-11-22 13:26:59,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 918 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-11-22 13:26:59,264 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 645 flow [2024-11-22 13:26:59,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=645, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-11-22 13:26:59,264 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-11-22 13:26:59,265 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 645 flow [2024-11-22 13:26:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 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-11-22 13:26:59,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:26:59,265 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-11-22 13:26:59,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:26:59,265 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-11-22 13:26:59,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:26:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash 269827766, now seen corresponding path program 1 times [2024-11-22 13:26:59,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:26:59,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045496951] [2024-11-22 13:26:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:26:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:26:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045496951] [2024-11-22 13:27:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045496951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761707576] [2024-11-22 13:27:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:00,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:27:00,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:27:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:00,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 13:27:00,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:00,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-22 13:27:00,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:00,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2024-11-22 13:27:00,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 13:27:00,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:00,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2024-11-22 13:27:00,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-22 13:27:01,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:01,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 35 [2024-11-22 13:27:01,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:01,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:27:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:01,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:01,872 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:01,873 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-11-22 13:27:01,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:01,885 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-11-22 13:27:02,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:02,982 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-11-22 13:27:02,994 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:02,996 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-11-22 13:27:04,389 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:04,390 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-11-22 13:27:04,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:04,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 4517 treesize of output 2740 [2024-11-22 13:27:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761707576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:27:06,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:27:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-11-22 13:27:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492833097] [2024-11-22 13:27:06,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:27:06,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 13:27:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:06,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 13:27:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-11-22 13:27:06,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-22 13:27:06,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 645 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-11-22 13:27:06,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:06,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-22 13:27:06,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:08,549 INFO L124 PetriNetUnfolderBase]: 1031/2108 cut-off events. [2024-11-22 13:27:08,553 INFO L125 PetriNetUnfolderBase]: For 5537/5537 co-relation queries the response was YES. [2024-11-22 13:27:08,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7122 conditions, 2108 events. 1031/2108 cut-off events. For 5537/5537 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12202 event pairs, 103 based on Foata normal form. 31/2124 useless extension candidates. Maximal degree in co-relation 7091. Up to 661 conditions per place. [2024-11-22 13:27:08,591 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 126 selfloop transitions, 71 changer transitions 11/213 dead transitions. [2024-11-22 13:27:08,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 213 transitions, 1760 flow [2024-11-22 13:27:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 13:27:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-22 13:27:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 334 transitions. [2024-11-22 13:27:08,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38215102974828374 [2024-11-22 13:27:08,594 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 645 flow. Second operand 19 states and 334 transitions. [2024-11-22 13:27:08,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 213 transitions, 1760 flow [2024-11-22 13:27:08,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 213 transitions, 1657 flow, removed 50 selfloop flow, removed 1 redundant places. [2024-11-22 13:27:08,625 INFO L231 Difference]: Finished difference. Result has 119 places, 128 transitions, 1219 flow [2024-11-22 13:27:08,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1219, PETRI_PLACES=119, PETRI_TRANSITIONS=128} [2024-11-22 13:27:08,626 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-11-22 13:27:08,633 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 128 transitions, 1219 flow [2024-11-22 13:27:08,634 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-11-22 13:27:08,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:08,634 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-11-22 13:27:08,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 13:27:08,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 13:27:08,836 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-11-22 13:27:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -253107702, now seen corresponding path program 2 times [2024-11-22 13:27:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101998612] [2024-11-22 13:27:08,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:27:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:09,012 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:27:09,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:10,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101998612] [2024-11-22 13:27:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101998612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788572487] [2024-11-22 13:27:10,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:27:10,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:10,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:10,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:27:10,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:27:10,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:27:10,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:10,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 13:27:10,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:10,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-22 13:27:10,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:10,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2024-11-22 13:27:10,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 13:27:10,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-22 13:27:11,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:11,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2024-11-22 13:27:11,739 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-22 13:27:11,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 62 [2024-11-22 13:27:11,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:11,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2024-11-22 13:27:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:11,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:11,977 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:11,978 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-11-22 13:27:11,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:11,985 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-11-22 13:27:12,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:12,911 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-11-22 13:27:12,921 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:12,922 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-11-22 13:27:13,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-22 13:27:13,540 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 24 treesize of output 18 [2024-11-22 13:27:13,550 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 20 treesize of output 18 [2024-11-22 13:27:13,553 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 52 treesize of output 46 [2024-11-22 13:27:13,592 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 20 treesize of output 18 [2024-11-22 13:27:13,599 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 52 treesize of output 46 [2024-11-22 13:27:13,696 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 20 treesize of output 18 [2024-11-22 13:27:13,706 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 52 treesize of output 46 [2024-11-22 13:27:13,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-22 13:27:13,737 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 24 treesize of output 18 [2024-11-22 13:27:13,999 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-11-22 13:27:14,009 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:14,009 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-11-22 13:27:14,048 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-22 13:27:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788572487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:27:14,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:27:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2024-11-22 13:27:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701271194] [2024-11-22 13:27:14,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:27:14,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 13:27:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:14,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 13:27:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-11-22 13:27:14,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-22 13:27:14,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 128 transitions, 1219 flow. Second operand has 27 states, 27 states have (on average 11.518518518518519) internal successors, (311), 27 states have internal predecessors, (311), 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-11-22 13:27:14,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:14,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-22 13:27:14,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:17,090 INFO L124 PetriNetUnfolderBase]: 1099/2282 cut-off events. [2024-11-22 13:27:17,093 INFO L125 PetriNetUnfolderBase]: For 8810/8814 co-relation queries the response was YES. [2024-11-22 13:27:17,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9090 conditions, 2282 events. 1099/2282 cut-off events. For 8810/8814 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 14109 event pairs, 236 based on Foata normal form. 18/2296 useless extension candidates. Maximal degree in co-relation 9047. Up to 1570 conditions per place. [2024-11-22 13:27:17,139 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 147 selfloop transitions, 32 changer transitions 2/186 dead transitions. [2024-11-22 13:27:17,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 186 transitions, 1924 flow [2024-11-22 13:27:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:27:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 13:27:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-11-22 13:27:17,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2024-11-22 13:27:17,141 INFO L175 Difference]: Start difference. First operand has 119 places, 128 transitions, 1219 flow. Second operand 12 states and 208 transitions. [2024-11-22 13:27:17,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 186 transitions, 1924 flow [2024-11-22 13:27:17,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 186 transitions, 1816 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-11-22 13:27:17,193 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 1342 flow [2024-11-22 13:27:17,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1342, PETRI_PLACES=133, PETRI_TRANSITIONS=140} [2024-11-22 13:27:17,194 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-11-22 13:27:17,195 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 1342 flow [2024-11-22 13:27:17,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.518518518518519) internal successors, (311), 27 states have internal predecessors, (311), 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-11-22 13:27:17,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:17,195 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-11-22 13:27:17,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:27:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 13:27:17,401 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-11-22 13:27:17,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1117167426, now seen corresponding path program 3 times [2024-11-22 13:27:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:17,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015194307] [2024-11-22 13:27:17,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:27:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:17,544 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:27:17,551 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015194307] [2024-11-22 13:27:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015194307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925516198] [2024-11-22 13:27:19,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:27:19,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:19,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:19,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:27:19,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:27:19,296 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:27:19,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:19,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 13:27:19,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:19,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-22 13:27:19,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:19,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2024-11-22 13:27:19,530 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 19 treesize of output 11 [2024-11-22 13:27:19,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-22 13:27:19,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2024-11-22 13:27:20,670 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-22 13:27:20,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 62 [2024-11-22 13:27:20,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:20,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2024-11-22 13:27:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:20,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:20,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:20,945 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-11-22 13:27:20,960 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:20,961 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-11-22 13:27:21,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:21,894 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-11-22 13:27:21,911 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:21,912 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-11-22 13:27:22,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:22,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 2269 treesize of output 1448 [2024-11-22 13:27:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925516198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:27:24,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:27:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-22 13:27:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297147002] [2024-11-22 13:27:24,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:27:24,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 13:27:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:24,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 13:27:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2024-11-22 13:27:27,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 13:27:27,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2024-11-22 13:27:27,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 1342 flow. Second operand has 29 states, 29 states have (on average 10.482758620689655) internal successors, (304), 29 states have internal predecessors, (304), 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-11-22 13:27:27,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:27,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2024-11-22 13:27:27,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:30,744 INFO L124 PetriNetUnfolderBase]: 1714/3358 cut-off events. [2024-11-22 13:27:30,744 INFO L125 PetriNetUnfolderBase]: For 14492/14492 co-relation queries the response was YES. [2024-11-22 13:27:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13533 conditions, 3358 events. 1714/3358 cut-off events. For 14492/14492 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 20873 event pairs, 189 based on Foata normal form. 47/3402 useless extension candidates. Maximal degree in co-relation 13483. Up to 709 conditions per place. [2024-11-22 13:27:30,778 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 187 selfloop transitions, 99 changer transitions 8/298 dead transitions. [2024-11-22 13:27:30,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 298 transitions, 2981 flow [2024-11-22 13:27:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:27:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-22 13:27:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 326 transitions. [2024-11-22 13:27:30,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39371980676328505 [2024-11-22 13:27:30,784 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 1342 flow. Second operand 18 states and 326 transitions. [2024-11-22 13:27:30,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 298 transitions, 2981 flow [2024-11-22 13:27:30,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 298 transitions, 2911 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-22 13:27:30,828 INFO L231 Difference]: Finished difference. Result has 154 places, 176 transitions, 2004 flow [2024-11-22 13:27:30,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2004, PETRI_PLACES=154, PETRI_TRANSITIONS=176} [2024-11-22 13:27:30,829 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-11-22 13:27:30,830 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 176 transitions, 2004 flow [2024-11-22 13:27:30,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.482758620689655) internal successors, (304), 29 states have internal predecessors, (304), 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-11-22 13:27:30,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:30,831 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-11-22 13:27:30,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 13:27:31,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:31,033 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-11-22 13:27:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 723359414, now seen corresponding path program 4 times [2024-11-22 13:27:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304366757] [2024-11-22 13:27:31,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:27:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:31,073 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:27:31,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304366757] [2024-11-22 13:27:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304366757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:31,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994954812] [2024-11-22 13:27:31,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:27:31,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:31,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:31,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:27:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 13:27:32,091 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:27:32,091 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:32,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 13:27:32,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:32,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-11-22 13:27:32,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:32,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 44 [2024-11-22 13:27:32,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 13:27:32,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:27:32,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-22 13:27:32,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2024-11-22 13:27:33,563 INFO L349 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2024-11-22 13:27:33,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 137 treesize of output 71 [2024-11-22 13:27:33,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:33,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 55 [2024-11-22 13:27:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:33,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:33,796 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:33,796 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-11-22 13:27:33,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:33,806 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-11-22 13:27:34,839 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:34,839 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-11-22 13:27:34,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:34,849 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-11-22 13:27:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994954812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:27:37,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:27:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-11-22 13:27:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549269876] [2024-11-22 13:27:37,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:27:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 13:27:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 13:27:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2024-11-22 13:27:37,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-22 13:27:37,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 176 transitions, 2004 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-11-22 13:27:37,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:37,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-22 13:27:37,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:41,436 INFO L124 PetriNetUnfolderBase]: 1743/3557 cut-off events. [2024-11-22 13:27:41,436 INFO L125 PetriNetUnfolderBase]: For 29309/29309 co-relation queries the response was YES. [2024-11-22 13:27:41,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17350 conditions, 3557 events. 1743/3557 cut-off events. For 29309/29309 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23317 event pairs, 164 based on Foata normal form. 7/3560 useless extension candidates. Maximal degree in co-relation 17290. Up to 706 conditions per place. [2024-11-22 13:27:41,469 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 212 selfloop transitions, 107 changer transitions 4/328 dead transitions. [2024-11-22 13:27:41,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 328 transitions, 4037 flow [2024-11-22 13:27:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:27:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-22 13:27:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 326 transitions. [2024-11-22 13:27:41,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39371980676328505 [2024-11-22 13:27:41,473 INFO L175 Difference]: Start difference. First operand has 154 places, 176 transitions, 2004 flow. Second operand 18 states and 326 transitions. [2024-11-22 13:27:41,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 328 transitions, 4037 flow [2024-11-22 13:27:41,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 328 transitions, 3844 flow, removed 72 selfloop flow, removed 8 redundant places. [2024-11-22 13:27:41,559 INFO L231 Difference]: Finished difference. Result has 171 places, 208 transitions, 2622 flow [2024-11-22 13:27:41,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2622, PETRI_PLACES=171, PETRI_TRANSITIONS=208} [2024-11-22 13:27:41,560 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-11-22 13:27:41,560 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 208 transitions, 2622 flow [2024-11-22 13:27:41,561 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-11-22 13:27:41,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:41,561 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-11-22 13:27:41,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 13:27:41,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:41,762 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-11-22 13:27:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1585975318, now seen corresponding path program 5 times [2024-11-22 13:27:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493545612] [2024-11-22 13:27:41,763 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:27:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:41,807 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:27:41,807 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493545612] [2024-11-22 13:27:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493545612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730019774] [2024-11-22 13:27:42,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:27:42,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:42,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:42,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:27:42,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 13:27:42,893 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:27:42,893 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:42,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-22 13:27:42,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:42,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-22 13:27:42,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:42,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2024-11-22 13:27:43,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 13:27:43,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-22 13:27:43,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:43,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2024-11-22 13:27:44,029 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2024-11-22 13:27:44,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 70 [2024-11-22 13:27:44,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:44,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 42 [2024-11-22 13:27:44,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-11-22 13:27:44,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:44,251 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:44,252 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-11-22 13:27:44,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:44,264 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-11-22 13:27:45,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:45,170 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-11-22 13:27:45,196 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:45,197 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-11-22 13:27:45,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-22 13:27:45,782 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 24 treesize of output 18 [2024-11-22 13:27:45,793 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 20 treesize of output 18 [2024-11-22 13:27:45,797 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 114 treesize of output 102 [2024-11-22 13:27:45,836 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 20 treesize of output 18 [2024-11-22 13:27:45,841 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 52 treesize of output 46 [2024-11-22 13:27:45,871 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 20 treesize of output 18 [2024-11-22 13:27:45,877 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 52 treesize of output 46 [2024-11-22 13:27:45,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-22 13:27:45,933 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 24 treesize of output 18 [2024-11-22 13:27:45,943 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 20 treesize of output 18 [2024-11-22 13:27:45,951 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 52 treesize of output 46 [2024-11-22 13:27:46,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:46,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 686 treesize of output 481 [2024-11-22 13:27:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730019774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:27:48,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:27:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-11-22 13:27:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132925128] [2024-11-22 13:27:48,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:27:48,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 13:27:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 13:27:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-11-22 13:27:48,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-11-22 13:27:48,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 208 transitions, 2622 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-11-22 13:27:48,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:48,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-11-22 13:27:48,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:51,370 INFO L124 PetriNetUnfolderBase]: 2114/4338 cut-off events. [2024-11-22 13:27:51,370 INFO L125 PetriNetUnfolderBase]: For 43377/43377 co-relation queries the response was YES. [2024-11-22 13:27:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22397 conditions, 4338 events. 2114/4338 cut-off events. For 43377/43377 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 30198 event pairs, 407 based on Foata normal form. 17/4351 useless extension candidates. Maximal degree in co-relation 22330. Up to 2569 conditions per place. [2024-11-22 13:27:51,408 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 273 selfloop transitions, 65 changer transitions 2/345 dead transitions. [2024-11-22 13:27:51,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 345 transitions, 4626 flow [2024-11-22 13:27:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:27:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-22 13:27:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 333 transitions. [2024-11-22 13:27:51,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2024-11-22 13:27:51,410 INFO L175 Difference]: Start difference. First operand has 171 places, 208 transitions, 2622 flow. Second operand 18 states and 333 transitions. [2024-11-22 13:27:51,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 345 transitions, 4626 flow [2024-11-22 13:27:51,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 345 transitions, 4377 flow, removed 91 selfloop flow, removed 9 redundant places. [2024-11-22 13:27:51,548 INFO L231 Difference]: Finished difference. Result has 190 places, 248 transitions, 3352 flow [2024-11-22 13:27:51,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2479, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3352, PETRI_PLACES=190, PETRI_TRANSITIONS=248} [2024-11-22 13:27:51,549 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places. [2024-11-22 13:27:51,549 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 248 transitions, 3352 flow [2024-11-22 13:27:51,550 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-11-22 13:27:51,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:51,550 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:27:51,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 13:27:51,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-22 13:27:51,754 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-11-22 13:27:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash -430736747, now seen corresponding path program 1 times [2024-11-22 13:27:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067874291] [2024-11-22 13:27:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:27:51,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:27:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:27:51,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:27:51,823 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:27:51,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-22 13:27:51,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-22 13:27:51,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-22 13:27:51,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 13:27:51,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-11-22 13:27:51,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-11-22 13:27:51,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-22 13:27:51,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 13:27:51,825 INFO L407 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1] [2024-11-22 13:27:51,883 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 13:27:51,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:27:51,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:27:51 BasicIcfg [2024-11-22 13:27:51,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:27:51,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:27:51,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:27:51,887 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:27:51,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:51" (3/4) ... [2024-11-22 13:27:51,888 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 13:27:51,947 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 13:27:51,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:27:51,948 INFO L158 Benchmark]: Toolchain (without parser) took 62051.32ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 97.3MB in the beginning and 642.9MB in the end (delta: -545.6MB). Peak memory consumption was 474.8MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,948 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory was 128.4MB in the beginning and 128.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:27:51,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.79ms. Allocated memory is still 169.9MB. Free memory was 97.2MB in the beginning and 116.5MB in the end (delta: -19.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.18ms. Allocated memory is still 169.9MB. Free memory was 116.5MB in the beginning and 113.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,948 INFO L158 Benchmark]: Boogie Preprocessor took 75.94ms. Allocated memory is still 169.9MB. Free memory was 113.6MB in the beginning and 110.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,948 INFO L158 Benchmark]: RCFGBuilder took 945.14ms. Allocated memory is still 169.9MB. Free memory was 110.1MB in the beginning and 56.7MB in the end (delta: 53.4MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,949 INFO L158 Benchmark]: TraceAbstraction took 60286.92ms. Allocated memory was 260.0MB in the beginning and 1.2GB in the end (delta: 929.0MB). Free memory was 221.7MB in the beginning and 654.4MB in the end (delta: -432.7MB). Peak memory consumption was 496.4MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,949 INFO L158 Benchmark]: Witness Printer took 60.58ms. Allocated memory is still 1.2GB. Free memory was 654.4MB in the beginning and 642.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 13:27:51,950 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory was 128.4MB in the beginning and 128.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.79ms. Allocated memory is still 169.9MB. Free memory was 97.2MB in the beginning and 116.5MB in the end (delta: -19.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.18ms. Allocated memory is still 169.9MB. Free memory was 116.5MB in the beginning and 113.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.94ms. Allocated memory is still 169.9MB. Free memory was 113.6MB in the beginning and 110.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 945.14ms. Allocated memory is still 169.9MB. Free memory was 110.1MB in the beginning and 56.7MB in the end (delta: 53.4MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * TraceAbstraction took 60286.92ms. Allocated memory was 260.0MB in the beginning and 1.2GB in the end (delta: 929.0MB). Free memory was 221.7MB in the beginning and 654.4MB in the end (delta: -432.7MB). Peak memory consumption was 496.4MB. Max. memory is 16.1GB. * Witness Printer took 60.58ms. Allocated memory is still 1.2GB. Free memory was 654.4MB in the beginning and 642.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(20) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1037] COND TRUE 2 i<(20) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 60.1s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1631 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1587 mSDsluCounter, 1259 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8911 IncrementalHoareTripleChecker+Invalid, 9037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 31 mSDtfsCounter, 8911 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 194 SyntacticMatches, 8 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1777 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3352occurred in iteration=14, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 35.3s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 542 ConstructedInterpolants, 111 QuantifiedInterpolants, 82988 SizeOfPredicates, 204 NumberOfNonLiveVariables, 1770 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 13:27:51,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE