./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/weaver/unroll-cond-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:38:10,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:38:10,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:38:10,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:38:10,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:38:10,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:38:10,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:38:10,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:38:10,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:38:10,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:38:10,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:38:10,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:38:10,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:38:10,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:38:10,950 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:38:10,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:38:10,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:38:10,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:38:10,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:38:10,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:38:10,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:38:10,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:38:10,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:38:10,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:38:10,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:38:10,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:38:10,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:38:10,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:38:10,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:38:10,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:38:10,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:38:10,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:38:10,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:38:10,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:38:10,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:38:10,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:38:10,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:38:10,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:38:10,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:38:10,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:38:10,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:38:10,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:38:10,961 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 -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2024-11-10 10:38:11,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:38:11,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:38:11,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:38:11,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:38:11,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:38:11,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2024-11-10 10:38:12,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:38:12,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:38:12,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2024-11-10 10:38:12,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2decc847f/315276ec4345402ca4b0f508a96be1b7/FLAG000dc5a85 [2024-11-10 10:38:12,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2decc847f/315276ec4345402ca4b0f508a96be1b7 [2024-11-10 10:38:12,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:38:12,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:38:12,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:38:12,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:38:12,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:38:12,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:38:12" (1/1) ... [2024-11-10 10:38:12,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3654ad3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:12, skipping insertion in model container [2024-11-10 10:38:12,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:38:12" (1/1) ... [2024-11-10 10:38:12,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:38:13,168 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/weaver/unroll-cond-4.wvr.c[2834,2847] [2024-11-10 10:38:13,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:38:13,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:38:13,230 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/weaver/unroll-cond-4.wvr.c[2834,2847] [2024-11-10 10:38:13,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:38:13,260 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:38:13,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13 WrapperNode [2024-11-10 10:38:13,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:38:13,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:38:13,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:38:13,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:38:13,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,307 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 173 [2024-11-10 10:38:13,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:38:13,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:38:13,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:38:13,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:38:13,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,337 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 10:38:13,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:38:13,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:38:13,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:38:13,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:38:13,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (1/1) ... [2024-11-10 10:38:13,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:38:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:38:13,405 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-10 10:38:13,412 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-10 10:38:13,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:38:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:38:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:38:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:38:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:38:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:38:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:38:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:38:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:38:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 10:38:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:38:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:38:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:38:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:38:13,469 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:38:13,579 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:38:13,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:38:13,903 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:38:13,903 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:38:14,217 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:38:14,218 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:38:14,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:38:14 BoogieIcfgContainer [2024-11-10 10:38:14,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:38:14,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:38:14,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:38:14,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:38:14,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:38:12" (1/3) ... [2024-11-10 10:38:14,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123f996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:38:14, skipping insertion in model container [2024-11-10 10:38:14,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:38:13" (2/3) ... [2024-11-10 10:38:14,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123f996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:38:14, skipping insertion in model container [2024-11-10 10:38:14,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:38:14" (3/3) ... [2024-11-10 10:38:14,230 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-11-10 10:38:14,247 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:38:14,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:38:14,247 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:38:14,300 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:38:14,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 29 transitions, 72 flow [2024-11-10 10:38:14,380 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2024-11-10 10:38:14,380 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:38:14,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-11-10 10:38:14,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 29 transitions, 72 flow [2024-11-10 10:38:14,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 64 flow [2024-11-10 10:38:14,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:38:14,411 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;@7e8c594a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:38:14,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:38:14,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:38:14,427 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2024-11-10 10:38:14,427 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:38:14,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:14,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:14,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:14,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash -684887431, now seen corresponding path program 1 times [2024-11-10 10:38:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247605608] [2024-11-10 10:38:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:14,643 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-10 10:38:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247605608] [2024-11-10 10:38:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247605608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:38:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624418657] [2024-11-10 10:38:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:38:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:14,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:38:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:38:14,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:38:14,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10 10:38:14,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:14,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:38:14,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:14,781 INFO L124 PetriNetUnfolderBase]: 38/82 cut-off events. [2024-11-10 10:38:14,783 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 10:38:14,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 82 events. 38/82 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 189 event pairs, 22 based on Foata normal form. 16/87 useless extension candidates. Maximal degree in co-relation 130. Up to 70 conditions per place. [2024-11-10 10:38:14,787 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2024-11-10 10:38:14,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 90 flow [2024-11-10 10:38:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:38:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:38:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2024-11-10 10:38:14,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-10 10:38:14,801 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 64 flow. Second operand 2 states and 37 transitions. [2024-11-10 10:38:14,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 90 flow [2024-11-10 10:38:14,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 82 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:38:14,808 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2024-11-10 10:38:14,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2024-11-10 10:38:14,814 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2024-11-10 10:38:14,815 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2024-11-10 10:38:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10 10:38:14,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:14,815 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] [2024-11-10 10:38:14,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:38:14,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:14,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash -374607054, now seen corresponding path program 1 times [2024-11-10 10:38:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555130045] [2024-11-10 10:38:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:15,135 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-10 10:38:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555130045] [2024-11-10 10:38:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555130045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:38:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35428221] [2024-11-10 10:38:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:38:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:15,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:38:15,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:38:15,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-10 10:38:15,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10 10:38:15,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:15,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-10 10:38:15,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:15,296 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2024-11-10 10:38:15,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:38:15,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 84 events. 38/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 190 event pairs, 22 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 159. Up to 71 conditions per place. [2024-11-10 10:38:15,301 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 16 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-11-10 10:38:15,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 88 flow [2024-11-10 10:38:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:38:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:38:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2024-11-10 10:38:15,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2024-11-10 10:38:15,307 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 43 transitions. [2024-11-10 10:38:15,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 88 flow [2024-11-10 10:38:15,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 88 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:38:15,310 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2024-11-10 10:38:15,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2024-11-10 10:38:15,314 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2024-11-10 10:38:15,314 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2024-11-10 10:38:15,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10 10:38:15,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:15,314 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:15,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:38:15,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1153700333, now seen corresponding path program 1 times [2024-11-10 10:38:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:15,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636646501] [2024-11-10 10:38:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:15,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636646501] [2024-11-10 10:38:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636646501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:38:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361960172] [2024-11-10 10:38:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:15,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:38:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:38:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:38:15,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-10 10:38:15,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10 10:38:15,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:15,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-10 10:38:15,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:15,921 INFO L124 PetriNetUnfolderBase]: 113/228 cut-off events. [2024-11-10 10:38:15,922 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:38:15,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 228 events. 113/228 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 822 event pairs, 42 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 444. Up to 112 conditions per place. [2024-11-10 10:38:15,924 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-11-10 10:38:15,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 48 transitions, 201 flow [2024-11-10 10:38:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:38:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:38:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-11-10 10:38:15,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5379310344827586 [2024-11-10 10:38:15,928 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 5 states and 78 transitions. [2024-11-10 10:38:15,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 48 transitions, 201 flow [2024-11-10 10:38:15,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:38:15,931 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 96 flow [2024-11-10 10:38:15,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2024-11-10 10:38:15,933 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2024-11-10 10:38:15,933 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 96 flow [2024-11-10 10:38:15,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10 10:38:15,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:15,934 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:15,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:38:15,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:15,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash 337405933, now seen corresponding path program 2 times [2024-11-10 10:38:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:15,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639848919] [2024-11-10 10:38:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:16,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639848919] [2024-11-10 10:38:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639848919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:16,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:16,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:38:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476641827] [2024-11-10 10:38:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:16,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:38:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:16,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:38:16,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:38:16,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-10 10:38:16,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10 10:38:16,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:16,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-10 10:38:16,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:16,441 INFO L124 PetriNetUnfolderBase]: 186/367 cut-off events. [2024-11-10 10:38:16,441 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2024-11-10 10:38:16,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 367 events. 186/367 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1579 event pairs, 76 based on Foata normal form. 4/316 useless extension candidates. Maximal degree in co-relation 926. Up to 199 conditions per place. [2024-11-10 10:38:16,445 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 46 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2024-11-10 10:38:16,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 62 transitions, 334 flow [2024-11-10 10:38:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:38:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:38:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-11-10 10:38:16,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47783251231527096 [2024-11-10 10:38:16,450 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 96 flow. Second operand 7 states and 97 transitions. [2024-11-10 10:38:16,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 62 transitions, 334 flow [2024-11-10 10:38:16,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:38:16,455 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 180 flow [2024-11-10 10:38:16,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-11-10 10:38:16,456 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2024-11-10 10:38:16,456 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 180 flow [2024-11-10 10:38:16,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10 10:38:16,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:16,457 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:16,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:38:16,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:16,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2122949069, now seen corresponding path program 3 times [2024-11-10 10:38:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719381823] [2024-11-10 10:38:16,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:16,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719381823] [2024-11-10 10:38:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719381823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:16,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:38:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354644702] [2024-11-10 10:38:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:16,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:38:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:16,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:38:16,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:38:16,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-10 10:38:16,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10 10:38:16,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:16,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-10 10:38:16,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:16,844 INFO L124 PetriNetUnfolderBase]: 208/404 cut-off events. [2024-11-10 10:38:16,845 INFO L125 PetriNetUnfolderBase]: For 868/871 co-relation queries the response was YES. [2024-11-10 10:38:16,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 404 events. 208/404 cut-off events. For 868/871 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1759 event pairs, 81 based on Foata normal form. 5/367 useless extension candidates. Maximal degree in co-relation 1326. Up to 188 conditions per place. [2024-11-10 10:38:16,849 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 43 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2024-11-10 10:38:16,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 423 flow [2024-11-10 10:38:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:38:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:38:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-10 10:38:16,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-10 10:38:16,852 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 180 flow. Second operand 5 states and 80 transitions. [2024-11-10 10:38:16,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 423 flow [2024-11-10 10:38:16,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 415 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-10 10:38:16,856 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 294 flow [2024-11-10 10:38:16,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-11-10 10:38:16,857 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2024-11-10 10:38:16,857 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 294 flow [2024-11-10 10:38:16,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10 10:38:16,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:16,858 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:38:16,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash -429536573, now seen corresponding path program 4 times [2024-11-10 10:38:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33484930] [2024-11-10 10:38:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33484930] [2024-11-10 10:38:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33484930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:38:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011053268] [2024-11-10 10:38:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:38:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:17,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:38:17,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:38:17,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-10 10:38:17,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10 10:38:17,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:17,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-10 10:38:17,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:17,308 INFO L124 PetriNetUnfolderBase]: 203/404 cut-off events. [2024-11-10 10:38:17,309 INFO L125 PetriNetUnfolderBase]: For 1532/1536 co-relation queries the response was YES. [2024-11-10 10:38:17,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 404 events. 203/404 cut-off events. For 1532/1536 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1779 event pairs, 87 based on Foata normal form. 5/370 useless extension candidates. Maximal degree in co-relation 1500. Up to 261 conditions per place. [2024-11-10 10:38:17,313 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 35 selfloop transitions, 20 changer transitions 0/60 dead transitions. [2024-11-10 10:38:17,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 514 flow [2024-11-10 10:38:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:38:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:38:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-11-10 10:38:17,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-11-10 10:38:17,314 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 294 flow. Second operand 5 states and 74 transitions. [2024-11-10 10:38:17,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 514 flow [2024-11-10 10:38:17,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 495 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-10 10:38:17,320 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 424 flow [2024-11-10 10:38:17,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-11-10 10:38:17,321 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2024-11-10 10:38:17,321 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 424 flow [2024-11-10 10:38:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-10 10:38:17,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:17,322 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:17,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:38:17,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:17,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1282793097, now seen corresponding path program 5 times [2024-11-10 10:38:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793471478] [2024-11-10 10:38:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793471478] [2024-11-10 10:38:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793471478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:38:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713618141] [2024-11-10 10:38:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:17,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:38:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:38:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:38:17,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-10 10:38:17,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10 10:38:17,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:17,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-10 10:38:17,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:17,945 INFO L124 PetriNetUnfolderBase]: 197/395 cut-off events. [2024-11-10 10:38:17,945 INFO L125 PetriNetUnfolderBase]: For 2065/2073 co-relation queries the response was YES. [2024-11-10 10:38:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 395 events. 197/395 cut-off events. For 2065/2073 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1737 event pairs, 69 based on Foata normal form. 8/370 useless extension candidates. Maximal degree in co-relation 1606. Up to 190 conditions per place. [2024-11-10 10:38:17,949 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 45 selfloop transitions, 18 changer transitions 0/68 dead transitions. [2024-11-10 10:38:17,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 619 flow [2024-11-10 10:38:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:38:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:38:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-11-10 10:38:17,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 10:38:17,951 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 424 flow. Second operand 6 states and 87 transitions. [2024-11-10 10:38:17,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 619 flow [2024-11-10 10:38:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 573 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-11-10 10:38:17,957 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 449 flow [2024-11-10 10:38:17,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-10 10:38:17,958 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 36 predicate places. [2024-11-10 10:38:17,958 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 449 flow [2024-11-10 10:38:17,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10 10:38:17,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:17,959 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:17,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:38:17,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:17,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1654130361, now seen corresponding path program 6 times [2024-11-10 10:38:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202242754] [2024-11-10 10:38:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202242754] [2024-11-10 10:38:18,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202242754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:38:18,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:38:18,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:38:18,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405272638] [2024-11-10 10:38:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:38:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:38:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:18,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:38:18,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:38:18,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-10 10:38:18,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10 10:38:18,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:18,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-10 10:38:18,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:18,296 INFO L124 PetriNetUnfolderBase]: 188/375 cut-off events. [2024-11-10 10:38:18,297 INFO L125 PetriNetUnfolderBase]: For 2154/2162 co-relation queries the response was YES. [2024-11-10 10:38:18,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 375 events. 188/375 cut-off events. For 2154/2162 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1609 event pairs, 85 based on Foata normal form. 8/346 useless extension candidates. Maximal degree in co-relation 1512. Up to 242 conditions per place. [2024-11-10 10:38:18,300 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 39 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2024-11-10 10:38:18,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 625 flow [2024-11-10 10:38:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:38:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:38:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-11-10 10:38:18,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-11-10 10:38:18,301 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 449 flow. Second operand 6 states and 84 transitions. [2024-11-10 10:38:18,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 625 flow [2024-11-10 10:38:18,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 589 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 10:38:18,307 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 506 flow [2024-11-10 10:38:18,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2024-11-10 10:38:18,308 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 42 predicate places. [2024-11-10 10:38:18,308 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 506 flow [2024-11-10 10:38:18,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10 10:38:18,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:38:18,308 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:38:18,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:38:18,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:38:18,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:38:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 455127854, now seen corresponding path program 1 times [2024-11-10 10:38:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:38:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850619138] [2024-11-10 10:38:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:38:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:38:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:38:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850619138] [2024-11-10 10:38:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850619138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:38:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239897540] [2024-11-10 10:38:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:38:18,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:38:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:38:18,500 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-10 10:38:18,502 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-10 10:38:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:38:18,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 10:38:18,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:38:18,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:38:19,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 10:38:19,261 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-10 10:38:19,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:38:31,565 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 33 treesize of output 29 [2024-11-10 10:38:31,577 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 10:38:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2024-11-10 10:38:31,629 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-10 10:38:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239897540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:38:31,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:38:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 23 [2024-11-10 10:38:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095858253] [2024-11-10 10:38:31,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:38:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 10:38:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:38:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 10:38:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-11-10 10:38:32,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-10 10:38:32,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 506 flow. Second operand has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 23 states have internal predecessors, (188), 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-10 10:38:32,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:38:32,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-10 10:38:32,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:38:44,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:39:00,742 WARN L286 SmtUtils]: Spent 14.43s on a formula simplification. DAG size of input: 134 DAG size of output: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 10:39:16,679 WARN L286 SmtUtils]: Spent 9.95s on a formula simplification. DAG size of input: 120 DAG size of output: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 10:39:21,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:39:25,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:39:32,048 INFO L124 PetriNetUnfolderBase]: 850/1697 cut-off events. [2024-11-10 10:39:32,050 INFO L125 PetriNetUnfolderBase]: For 9085/9097 co-relation queries the response was YES. [2024-11-10 10:39:32,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6477 conditions, 1697 events. 850/1697 cut-off events. For 9085/9097 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10505 event pairs, 39 based on Foata normal form. 24/1514 useless extension candidates. Maximal degree in co-relation 6451. Up to 355 conditions per place. [2024-11-10 10:39:32,070 INFO L140 encePairwiseOnDemand]: 16/29 looper letters, 162 selfloop transitions, 111 changer transitions 58/335 dead transitions. [2024-11-10 10:39:32,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 335 transitions, 3030 flow [2024-11-10 10:39:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-10 10:39:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-11-10 10:39:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 504 transitions. [2024-11-10 10:39:32,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4573502722323049 [2024-11-10 10:39:32,098 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 506 flow. Second operand 38 states and 504 transitions. [2024-11-10 10:39:32,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 335 transitions, 3030 flow [2024-11-10 10:39:32,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 335 transitions, 2830 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-11-10 10:39:32,119 INFO L231 Difference]: Finished difference. Result has 123 places, 146 transitions, 1644 flow [2024-11-10 10:39:32,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1644, PETRI_PLACES=123, PETRI_TRANSITIONS=146} [2024-11-10 10:39:32,121 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 96 predicate places. [2024-11-10 10:39:32,121 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 146 transitions, 1644 flow [2024-11-10 10:39:32,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 23 states have internal predecessors, (188), 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-10 10:39:32,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:39:32,122 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:39:32,144 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-10 10:39:32,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:32,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:39:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:39:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1683968110, now seen corresponding path program 2 times [2024-11-10 10:39:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:39:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185361496] [2024-11-10 10:39:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:39:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:39:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:39:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:39:32,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:39:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185361496] [2024-11-10 10:39:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185361496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:39:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68298171] [2024-11-10 10:39:32,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:39:32,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:39:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:39:32,534 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-10 10:39:32,534 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-10 10:39:33,105 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:39:33,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:39:33,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 10:39:33,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:39:33,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:39:33,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 10:39:33,532 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-10 10:39:33,532 INFO L311 TraceCheckSpWp]: Computing backward predicates...