./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:56:12,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:56:12,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:56:12,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:56:12,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:56:12,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:56:12,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:56:12,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:56:12,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:56:12,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:56:12,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:56:12,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:56:12,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:56:12,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:56:12,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:56:12,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:56:12,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:56:12,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:56:12,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:56:12,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:56:12,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:56:12,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:56:12,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:56:12,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:56:12,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:56:12,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:56:12,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:56:12,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:56:12,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:56:12,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:56:12,445 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-19 01:56:12,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:56:12,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:56:12,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:56:12,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:56:12,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:56:12,681 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-19 01:56:13,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:56:14,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:56:14,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2024-11-19 01:56:14,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410ec47ef/bc4adac1b81040d085abbfb02f1af052/FLAG9d42d6fd9 [2024-11-19 01:56:14,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/410ec47ef/bc4adac1b81040d085abbfb02f1af052 [2024-11-19 01:56:14,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:56:14,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:56:14,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:56:14,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:56:14,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:56:14,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ae8f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14, skipping insertion in model container [2024-11-19 01:56:14,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:56:14,264 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-19 01:56:14,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:56:14,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:56:14,298 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-19 01:56:14,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:56:14,313 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:56:14,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14 WrapperNode [2024-11-19 01:56:14,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:56:14,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:56:14,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:56:14,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:56:14,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,341 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 176 [2024-11-19 01:56:14,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:56:14,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:56:14,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:56:14,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:56:14,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,367 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-19 01:56:14,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:56:14,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:56:14,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:56:14,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:56:14,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (1/1) ... [2024-11-19 01:56:14,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:56:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:56:14,409 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-19 01:56:14,411 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-19 01:56:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:56:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:56:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:56:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:56:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:56:14,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:56:14,445 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:56:14,524 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:56:14,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:56:14,767 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:56:14,768 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:56:15,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:56:15,001 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 01:56:15,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:56:15 BoogieIcfgContainer [2024-11-19 01:56:15,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:56:15,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:56:15,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:56:15,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:56:15,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:56:14" (1/3) ... [2024-11-19 01:56:15,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f038978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:56:15, skipping insertion in model container [2024-11-19 01:56:15,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:14" (2/3) ... [2024-11-19 01:56:15,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f038978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:56:15, skipping insertion in model container [2024-11-19 01:56:15,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:56:15" (3/3) ... [2024-11-19 01:56:15,010 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-11-19 01:56:15,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:56:15,024 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:56:15,024 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:56:15,062 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 01:56:15,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-11-19 01:56:15,109 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-11-19 01:56:15,109 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:56:15,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-11-19 01:56:15,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-11-19 01:56:15,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-11-19 01:56:15,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:56:15,127 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;@4cda467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:56:15,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:56:15,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:56:15,138 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-11-19 01:56:15,138 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:56:15,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:15,139 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:15,139 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-19 01:56:15,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1952885711, now seen corresponding path program 1 times [2024-11-19 01:56:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539469344] [2024-11-19 01:56:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:15,467 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-19 01:56:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:15,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539469344] [2024-11-19 01:56:15,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539469344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:15,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:15,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:56:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701490735] [2024-11-19 01:56:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:15,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:56:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:56:15,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:56:15,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:15,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:15,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:15,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:15,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:15,782 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2024-11-19 01:56:15,782 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-19 01:56:15,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2024-11-19 01:56:15,783 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-11-19 01:56:15,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2024-11-19 01:56:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:56:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:56:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-11-19 01:56:15,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-11-19 01:56:15,796 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2024-11-19 01:56:15,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2024-11-19 01:56:15,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 01:56:15,799 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2024-11-19 01:56:15,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2024-11-19 01:56:15,803 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-11-19 01:56:15,803 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2024-11-19 01:56:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:15,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:15,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:56:15,804 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-19 01:56:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1234725516, now seen corresponding path program 1 times [2024-11-19 01:56:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286459475] [2024-11-19 01:56:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286459475] [2024-11-19 01:56:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286459475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:56:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460331382] [2024-11-19 01:56:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:16,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:16,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:16,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:16,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:16,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:16,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:16,199 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2024-11-19 01:56:16,199 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:56:16,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2024-11-19 01:56:16,201 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-11-19 01:56:16,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2024-11-19 01:56:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-11-19 01:56:16,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-11-19 01:56:16,204 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2024-11-19 01:56:16,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2024-11-19 01:56:16,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:16,206 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2024-11-19 01:56:16,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2024-11-19 01:56:16,207 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2024-11-19 01:56:16,208 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2024-11-19 01:56:16,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:16,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:16,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:16,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:56:16,209 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-19 01:56:16,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1963681990, now seen corresponding path program 2 times [2024-11-19 01:56:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044079632] [2024-11-19 01:56:16,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:56:16,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:16,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:56:16,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044079632] [2024-11-19 01:56:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044079632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:56:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948552963] [2024-11-19 01:56:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:16,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:16,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:16,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:16,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:16,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:16,533 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2024-11-19 01:56:16,533 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-19 01:56:16,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 581 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2024-11-19 01:56:16,536 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-11-19 01:56:16,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2024-11-19 01:56:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2024-11-19 01:56:16,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-19 01:56:16,539 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2024-11-19 01:56:16,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2024-11-19 01:56:16,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:16,542 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2024-11-19 01:56:16,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-11-19 01:56:16,543 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-11-19 01:56:16,544 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2024-11-19 01:56:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:16,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:16,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:16,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:56:16,545 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-19 01:56:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash -315186528, now seen corresponding path program 3 times [2024-11-19 01:56:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799534845] [2024-11-19 01:56:16,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:56:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:16,584 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:56:16,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799534845] [2024-11-19 01:56:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799534845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:56:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034192989] [2024-11-19 01:56:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:16,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:16,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:16,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:16,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:16,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:16,884 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2024-11-19 01:56:16,884 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2024-11-19 01:56:16,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 654 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2024-11-19 01:56:16,888 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2024-11-19 01:56:16,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2024-11-19 01:56:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-11-19 01:56:16,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-11-19 01:56:16,890 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2024-11-19 01:56:16,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2024-11-19 01:56:16,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:16,894 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2024-11-19 01:56:16,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-11-19 01:56:16,895 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2024-11-19 01:56:16,895 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2024-11-19 01:56:16,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:16,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:16,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:16,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:56:16,896 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-19 01:56:16,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1798077986, now seen corresponding path program 4 times [2024-11-19 01:56:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674677601] [2024-11-19 01:56:16,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:56:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:16,927 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:56:16,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:17,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674677601] [2024-11-19 01:56:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674677601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:56:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082542010] [2024-11-19 01:56:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:17,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:17,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:17,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:17,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:17,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:17,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:17,172 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2024-11-19 01:56:17,173 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2024-11-19 01:56:17,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 640 event pairs, 46 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 160 conditions per place. [2024-11-19 01:56:17,174 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2024-11-19 01:56:17,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 365 flow [2024-11-19 01:56:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-11-19 01:56:17,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-11-19 01:56:17,177 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 5 states and 47 transitions. [2024-11-19 01:56:17,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 365 flow [2024-11-19 01:56:17,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:17,181 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 296 flow [2024-11-19 01:56:17,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-11-19 01:56:17,183 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2024-11-19 01:56:17,183 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 296 flow [2024-11-19 01:56:17,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:17,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:17,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:17,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:56:17,184 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-19 01:56:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -265137648, now seen corresponding path program 5 times [2024-11-19 01:56:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240376407] [2024-11-19 01:56:17,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:56:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:17,213 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:56:17,213 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240376407] [2024-11-19 01:56:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240376407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:56:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170961828] [2024-11-19 01:56:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:17,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:17,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:17,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:17,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:17,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:17,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:17,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:17,448 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2024-11-19 01:56:17,448 INFO L125 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2024-11-19 01:56:17,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 204 events. 107/204 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 668 event pairs, 34 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2024-11-19 01:56:17,450 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2024-11-19 01:56:17,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 432 flow [2024-11-19 01:56:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2024-11-19 01:56:17,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-11-19 01:56:17,452 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 296 flow. Second operand 5 states and 51 transitions. [2024-11-19 01:56:17,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 432 flow [2024-11-19 01:56:17,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 378 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-11-19 01:56:17,457 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 282 flow [2024-11-19 01:56:17,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-11-19 01:56:17,459 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2024-11-19 01:56:17,459 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 282 flow [2024-11-19 01:56:17,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:17,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:17,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:56:17,459 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-19 01:56:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1853489246, now seen corresponding path program 6 times [2024-11-19 01:56:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941449691] [2024-11-19 01:56:17,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 01:56:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:17,477 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 01:56:17,477 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941449691] [2024-11-19 01:56:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941449691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:56:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665158407] [2024-11-19 01:56:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:17,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:56:17,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:17,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:17,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:56:17,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:17,656 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2024-11-19 01:56:17,657 INFO L125 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2024-11-19 01:56:17,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 197 events. 106/197 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 613 event pairs, 45 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2024-11-19 01:56:17,659 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2024-11-19 01:56:17,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 404 flow [2024-11-19 01:56:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-11-19 01:56:17,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-11-19 01:56:17,661 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 282 flow. Second operand 5 states and 47 transitions. [2024-11-19 01:56:17,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 404 flow [2024-11-19 01:56:17,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 370 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 01:56:17,664 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 294 flow [2024-11-19 01:56:17,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-19 01:56:17,664 INFO L277 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2024-11-19 01:56:17,664 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 294 flow [2024-11-19 01:56:17,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 01:56:17,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:17,665 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:56:17,665 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-19 01:56:17,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2116690811, now seen corresponding path program 1 times [2024-11-19 01:56:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239804469] [2024-11-19 01:56:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:56:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239804469] [2024-11-19 01:56:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239804469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:56:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445706396] [2024-11-19 01:56:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:17,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:56:17,856 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-19 01:56:17,857 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-19 01:56:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:17,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 01:56:17,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:56:18,007 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-19 01:56:18,294 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-11-19 01:56:18,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 169 [2024-11-19 01:56:28,339 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 01:56:36,351 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 01:57:00,464 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 01:57:16,524 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 01:57:24,534 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 01:57:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:24,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:31,799 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-19 01:57:31,816 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 01:57:31,816 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-19 01:57:31,849 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 87 treesize of output 77 [2024-11-19 01:57:31,891 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2024-11-19 01:57:31,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 193 [2024-11-19 01:57:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445706396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:32,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2024-11-19 01:57:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130269948] [2024-11-19 01:57:32,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 01:57:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 01:57:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:57:32,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-11-19 01:57:32,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 294 flow. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 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-19 01:57:32,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:32,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-11-19 01:57:32,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:41,910 WARN L286 SmtUtils]: Spent 7.37s on a formula simplification. DAG size of input: 101 DAG size of output: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 01:57:43,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []