./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/popl20-more-array-sum2.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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:48:09,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:48:09,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:48:09,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:48:09,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:48:09,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:48:09,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:48:09,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:48:09,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:48:09,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:48:09,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:48:09,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:48:09,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:48:09,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:48:09,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:48:09,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:48:09,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:09,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:48:09,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:48:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:48:09,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:48:09,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:48:09,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:48:09,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:48:09,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-03-13 21:48:09,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:48:09,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:48:09,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:48:09,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:48:09,944 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:48:09,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-13 21:48:11,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f65b5f2/b843c525514f4031a62e1675644c67ce/FLAGb63da21e9 [2025-03-13 21:48:11,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:48:11,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-13 21:48:11,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f65b5f2/b843c525514f4031a62e1675644c67ce/FLAGb63da21e9 [2025-03-13 21:48:11,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f65b5f2/b843c525514f4031a62e1675644c67ce [2025-03-13 21:48:11,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:48:11,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:48:11,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:11,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:48:11,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:48:11,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd50b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11, skipping insertion in model container [2025-03-13 21:48:11,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:48:11,424 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/popl20-more-array-sum2.wvr.c[2638,2651] [2025-03-13 21:48:11,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:11,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:48:11,454 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/popl20-more-array-sum2.wvr.c[2638,2651] [2025-03-13 21:48:11,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:11,467 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:48:11,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11 WrapperNode [2025-03-13 21:48:11,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:11,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:11,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:48:11,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:48:11,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,495 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-03-13 21:48:11,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:11,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:48:11,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:48:11,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:48:11,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,517 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:48:11,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:48:11,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:48:11,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:48:11,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:48:11,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (1/1) ... [2025-03-13 21:48:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:11,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:11,558 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) [2025-03-13 21:48:11,560 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 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:48:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:48:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:48:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:48:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:48:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:48:11,580 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:48:11,660 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:48:11,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:48:12,027 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:48:12,028 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:48:12,029 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:48:12,362 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:48:12,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:12 BoogieIcfgContainer [2025-03-13 21:48:12,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:48:12,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:48:12,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:48:12,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:48:12,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:48:11" (1/3) ... [2025-03-13 21:48:12,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba984a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:12, skipping insertion in model container [2025-03-13 21:48:12,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:11" (2/3) ... [2025-03-13 21:48:12,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba984a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:12, skipping insertion in model container [2025-03-13 21:48:12,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:12" (3/3) ... [2025-03-13 21:48:12,371 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-03-13 21:48:12,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:48:12,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 31 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-13 21:48:12,384 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:48:12,427 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:48:12,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 91 flow [2025-03-13 21:48:12,485 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-13 21:48:12,487 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:48:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 5/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-13 21:48:12,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 91 flow [2025-03-13 21:48:12,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 31 transitions, 80 flow [2025-03-13 21:48:12,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:48:12,513 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;@2e49a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:48:12,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:48:12,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:48:12,528 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-03-13 21:48:12,528 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:48:12,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:12,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:12,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -341138598, now seen corresponding path program 1 times [2025-03-13 21:48:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:12,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152956857] [2025-03-13 21:48:12,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:48:12,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:48:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:12,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152956857] [2025-03-13 21:48:12,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152956857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:12,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:12,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124526673] [2025-03-13 21:48:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:12,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:12,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:12,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:12,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-13 21:48:12,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) [2025-03-13 21:48:12,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:12,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-13 21:48:12,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:13,077 INFO L124 PetriNetUnfolderBase]: 618/958 cut-off events. [2025-03-13 21:48:13,078 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-13 21:48:13,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 958 events. 618/958 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3829 event pairs, 126 based on Foata normal form. 1/953 useless extension candidates. Maximal degree in co-relation 1717. Up to 677 conditions per place. [2025-03-13 21:48:13,084 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-03-13 21:48:13,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 217 flow [2025-03-13 21:48:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-13 21:48:13,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-13 21:48:13,093 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 80 flow. Second operand 3 states and 66 transitions. [2025-03-13 21:48:13,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 217 flow [2025-03-13 21:48:13,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:48:13,100 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 94 flow [2025-03-13 21:48:13,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-03-13 21:48:13,104 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2025-03-13 21:48:13,104 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 94 flow [2025-03-13 21:48:13,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) [2025-03-13 21:48:13,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:13,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:13,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:48:13,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:13,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash -426723595, now seen corresponding path program 1 times [2025-03-13 21:48:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021387228] [2025-03-13 21:48:13,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:13,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:48:13,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:48:13,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:13,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:13,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021387228] [2025-03-13 21:48:13,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021387228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:13,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:13,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:48:13,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527308614] [2025-03-13 21:48:13,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:13,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:13,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:13,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:13,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-13 21:48:13,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2025-03-13 21:48:13,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:13,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-13 21:48:13,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:13,460 INFO L124 PetriNetUnfolderBase]: 618/969 cut-off events. [2025-03-13 21:48:13,460 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-03-13 21:48:13,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 969 events. 618/969 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4055 event pairs, 407 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 812. Up to 897 conditions per place. [2025-03-13 21:48:13,465 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 4 changer transitions 1/37 dead transitions. [2025-03-13 21:48:13,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 166 flow [2025-03-13 21:48:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:48:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:48:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-13 21:48:13,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2025-03-13 21:48:13,466 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 94 flow. Second operand 4 states and 61 transitions. [2025-03-13 21:48:13,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 166 flow [2025-03-13 21:48:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:13,467 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 116 flow [2025-03-13 21:48:13,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-03-13 21:48:13,468 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-13 21:48:13,468 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 116 flow [2025-03-13 21:48:13,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2025-03-13 21:48:13,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:13,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:13,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:48:13,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1703795047, now seen corresponding path program 1 times [2025-03-13 21:48:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964662349] [2025-03-13 21:48:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:13,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:48:13,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:48:13,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:13,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964662349] [2025-03-13 21:48:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964662349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:13,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:13,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:48:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461025238] [2025-03-13 21:48:13,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:13,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:13,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:13,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:13,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-13 21:48:13,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2025-03-13 21:48:13,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:13,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-13 21:48:13,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:13,752 INFO L124 PetriNetUnfolderBase]: 791/1162 cut-off events. [2025-03-13 21:48:13,752 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-13 21:48:13,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 1162 events. 791/1162 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4524 event pairs, 246 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-13 21:48:13,759 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-13 21:48:13,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 248 flow [2025-03-13 21:48:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:48:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:48:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-13 21:48:13,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-13 21:48:13,761 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 116 flow. Second operand 4 states and 65 transitions. [2025-03-13 21:48:13,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 248 flow [2025-03-13 21:48:13,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 238 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:48:13,763 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 127 flow [2025-03-13 21:48:13,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-13 21:48:13,763 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-13 21:48:13,763 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 127 flow [2025-03-13 21:48:13,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2025-03-13 21:48:13,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:13,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:13,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:48:13,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:13,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2012892907, now seen corresponding path program 1 times [2025-03-13 21:48:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843128931] [2025-03-13 21:48:13,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:13,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:48:13,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:48:13,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:13,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843128931] [2025-03-13 21:48:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843128931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151431406] [2025-03-13 21:48:13,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:13,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:13,919 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) [2025-03-13 21:48:13,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:48:13,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:48:14,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:48:14,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:14,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:14,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:48:14,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:14,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:48:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151431406] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:14,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:48:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-13 21:48:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835327142] [2025-03-13 21:48:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:14,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:48:14,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:14,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:48:14,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:48:14,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-13 21:48:14,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-03-13 21:48:14,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:14,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-13 21:48:14,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:14,263 INFO L124 PetriNetUnfolderBase]: 847/1272 cut-off events. [2025-03-13 21:48:14,263 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-03-13 21:48:14,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 1272 events. 847/1272 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5382 event pairs, 228 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 3141. Up to 666 conditions per place. [2025-03-13 21:48:14,271 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-13 21:48:14,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 277 flow [2025-03-13 21:48:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:48:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:48:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-13 21:48:14,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4228571428571429 [2025-03-13 21:48:14,272 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 127 flow. Second operand 5 states and 74 transitions. [2025-03-13 21:48:14,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 277 flow [2025-03-13 21:48:14,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:48:14,275 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 146 flow [2025-03-13 21:48:14,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-13 21:48:14,276 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-13 21:48:14,276 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 146 flow [2025-03-13 21:48:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-03-13 21:48:14,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:14,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:14,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:48:14,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:14,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:14,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:14,482 INFO L85 PathProgramCache]: Analyzing trace with hash 631004318, now seen corresponding path program 1 times [2025-03-13 21:48:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91310301] [2025-03-13 21:48:14,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:14,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:48:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:48:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:15,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:15,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91310301] [2025-03-13 21:48:15,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91310301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:15,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796178792] [2025-03-13 21:48:15,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:15,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:15,376 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) [2025-03-13 21:48:15,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:48:15,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:48:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:48:15,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:15,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:15,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-13 21:48:15,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:15,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-13 21:48:15,528 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 [2025-03-13 21:48:15,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:48:15,570 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 11 treesize of output 11 [2025-03-13 21:48:15,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-03-13 21:48:15,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-13 21:48:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:15,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:48:24,896 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-03-13 21:48:24,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1578 treesize of output 1148 [2025-03-13 21:48:24,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:24,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 823 treesize of output 759 [2025-03-13 21:48:27,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2025-03-13 21:48:27,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,404 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 21 [2025-03-13 21:48:27,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,420 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,421 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-13 21:48:27,461 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 1 [2025-03-13 21:48:27,469 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 1 [2025-03-13 21:48:27,476 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,476 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 68 treesize of output 1 [2025-03-13 21:48:27,485 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,485 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 61 treesize of output 1 [2025-03-13 21:48:27,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2025-03-13 21:48:27,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,498 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 21 [2025-03-13 21:48:27,507 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,508 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 118 treesize of output 1 [2025-03-13 21:48:27,515 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 1 [2025-03-13 21:48:27,521 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 1 [2025-03-13 21:48:27,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,528 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,528 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2025-03-13 21:48:27,535 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,536 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 77 treesize of output 1 [2025-03-13 21:48:27,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,542 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,542 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2025-03-13 21:48:27,549 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 1 [2025-03-13 21:48:27,562 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,562 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 85 treesize of output 1 [2025-03-13 21:48:27,571 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,571 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 44 treesize of output 1 [2025-03-13 21:48:27,583 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,583 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 101 treesize of output 1 [2025-03-13 21:48:27,588 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 1 [2025-03-13 21:48:27,602 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1 [2025-03-13 21:48:27,618 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 1 [2025-03-13 21:48:27,625 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 1 [2025-03-13 21:48:27,632 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,632 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 68 treesize of output 1 [2025-03-13 21:48:27,637 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,637 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 61 treesize of output 1 [2025-03-13 21:48:27,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2025-03-13 21:48:27,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,646 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 21 [2025-03-13 21:48:27,655 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 1 [2025-03-13 21:48:27,662 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,662 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 94 treesize of output 1 [2025-03-13 21:48:27,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,672 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,673 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2025-03-13 21:48:27,680 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,680 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 77 treesize of output 1 [2025-03-13 21:48:27,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,686 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,686 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 21:48:27,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:48:27,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2025-03-13 21:48:27,693 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-13 21:48:27,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 1 [2025-03-13 21:48:27,698 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,698 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 85 treesize of output 1 [2025-03-13 21:48:27,707 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:48:27,707 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 44 treesize of output 1 [2025-03-13 21:48:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796178792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:48:31,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:48:31,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2025-03-13 21:48:31,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432419079] [2025-03-13 21:48:31,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:48:31,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:48:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:31,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:48:31,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=652, Unknown=3, NotChecked=0, Total=756 [2025-03-13 21:48:36,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:48:40,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:48:40,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2025-03-13 21:48:40,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 146 flow. Second operand has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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) [2025-03-13 21:48:40,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:40,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2025-03-13 21:48:40,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:44,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:48:48,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:48:49,796 INFO L124 PetriNetUnfolderBase]: 2074/2966 cut-off events. [2025-03-13 21:48:49,796 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-03-13 21:48:49,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8257 conditions, 2966 events. 2074/2966 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12116 event pairs, 240 based on Foata normal form. 1/2773 useless extension candidates. Maximal degree in co-relation 7278. Up to 1808 conditions per place. [2025-03-13 21:48:49,813 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 115 selfloop transitions, 46 changer transitions 1/163 dead transitions. [2025-03-13 21:48:49,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 163 transitions, 888 flow [2025-03-13 21:48:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:48:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:48:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 227 transitions. [2025-03-13 21:48:49,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3603174603174603 [2025-03-13 21:48:49,817 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 146 flow. Second operand 18 states and 227 transitions. [2025-03-13 21:48:49,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 163 transitions, 888 flow [2025-03-13 21:48:49,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 163 transitions, 873 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:48:49,823 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 452 flow [2025-03-13 21:48:49,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=452, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2025-03-13 21:48:49,825 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2025-03-13 21:48:49,825 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 452 flow [2025-03-13 21:48:49,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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) [2025-03-13 21:48:49,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:49,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:49,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:48:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:50,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash -716895094, now seen corresponding path program 2 times [2025-03-13 21:48:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502766889] [2025-03-13 21:48:50,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:48:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:50,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:48:50,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:48:50,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:48:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502766889] [2025-03-13 21:48:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502766889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682208133] [2025-03-13 21:48:51,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:48:51,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:51,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:51,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:48:51,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:48:51,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:48:51,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:48:51,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:48:51,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:51,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 21:48:51,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:51,234 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 [2025-03-13 21:48:51,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:51,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-13 21:48:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:51,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:48:51,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:51,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-13 21:48:51,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:51,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 190 [2025-03-13 21:48:51,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:51,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 134 [2025-03-13 21:48:52,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:52,032 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 112 treesize of output 104 [2025-03-13 21:48:52,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:48:52,046 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 84 treesize of output 68 [2025-03-13 21:48:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682208133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:48:52,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:48:52,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2025-03-13 21:48:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715537905] [2025-03-13 21:48:52,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:48:52,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 21:48:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:52,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 21:48:52,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-03-13 21:48:52,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-03-13 21:48:52,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 452 flow. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 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) [2025-03-13 21:48:52,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:52,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-03-13 21:48:52,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:54,225 INFO L124 PetriNetUnfolderBase]: 1992/3060 cut-off events. [2025-03-13 21:48:54,226 INFO L125 PetriNetUnfolderBase]: For 4020/4058 co-relation queries the response was YES. [2025-03-13 21:48:54,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9704 conditions, 3060 events. 1992/3060 cut-off events. For 4020/4058 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14959 event pairs, 125 based on Foata normal form. 37/3095 useless extension candidates. Maximal degree in co-relation 7303. Up to 1647 conditions per place. [2025-03-13 21:48:54,245 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 135 selfloop transitions, 68 changer transitions 1/208 dead transitions. [2025-03-13 21:48:54,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 208 transitions, 1383 flow [2025-03-13 21:48:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 21:48:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 21:48:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 306 transitions. [2025-03-13 21:48:54,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974025974025974 [2025-03-13 21:48:54,248 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 452 flow. Second operand 22 states and 306 transitions. [2025-03-13 21:48:54,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 208 transitions, 1383 flow [2025-03-13 21:48:54,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 208 transitions, 1299 flow, removed 38 selfloop flow, removed 2 redundant places. [2025-03-13 21:48:54,259 INFO L231 Difference]: Finished difference. Result has 87 places, 112 transitions, 780 flow [2025-03-13 21:48:54,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=780, PETRI_PLACES=87, PETRI_TRANSITIONS=112} [2025-03-13 21:48:54,260 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2025-03-13 21:48:54,261 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 112 transitions, 780 flow [2025-03-13 21:48:54,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 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) [2025-03-13 21:48:54,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:54,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:54,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:48:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:54,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:54,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash 666809064, now seen corresponding path program 3 times [2025-03-13 21:48:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89515607] [2025-03-13 21:48:54,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:48:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:54,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:48:54,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-03-13 21:48:54,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:48:54,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:54,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89515607] [2025-03-13 21:48:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89515607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:54,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:54,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:48:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299016354] [2025-03-13 21:48:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:54,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:48:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:54,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:48:54,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:48:55,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-13 21:48:55,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 112 transitions, 780 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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) [2025-03-13 21:48:55,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:55,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-13 21:48:55,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:55,813 INFO L124 PetriNetUnfolderBase]: 3327/4781 cut-off events. [2025-03-13 21:48:55,813 INFO L125 PetriNetUnfolderBase]: For 8655/8670 co-relation queries the response was YES. [2025-03-13 21:48:55,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16608 conditions, 4781 events. 3327/4781 cut-off events. For 8655/8670 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22479 event pairs, 280 based on Foata normal form. 13/4791 useless extension candidates. Maximal degree in co-relation 15041. Up to 3113 conditions per place. [2025-03-13 21:48:55,839 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 135 selfloop transitions, 76 changer transitions 1/214 dead transitions. [2025-03-13 21:48:55,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 214 transitions, 1707 flow [2025-03-13 21:48:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:48:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:48:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-13 21:48:55,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-13 21:48:55,840 INFO L175 Difference]: Start difference. First operand has 87 places, 112 transitions, 780 flow. Second operand 11 states and 168 transitions. [2025-03-13 21:48:55,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 214 transitions, 1707 flow [2025-03-13 21:48:55,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 214 transitions, 1610 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-03-13 21:48:55,857 INFO L231 Difference]: Finished difference. Result has 97 places, 156 transitions, 1316 flow [2025-03-13 21:48:55,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1316, PETRI_PLACES=97, PETRI_TRANSITIONS=156} [2025-03-13 21:48:55,858 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 61 predicate places. [2025-03-13 21:48:55,858 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 156 transitions, 1316 flow [2025-03-13 21:48:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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) [2025-03-13 21:48:55,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:55,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:55,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:48:55,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:48:55,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash 64380806, now seen corresponding path program 4 times [2025-03-13 21:48:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289564339] [2025-03-13 21:48:55,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:48:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:55,865 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:48:55,884 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:48:55,884 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:48:55,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289564339] [2025-03-13 21:48:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289564339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653368119] [2025-03-13 21:48:56,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:48:56,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:56,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:56,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:48:56,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:48:56,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:48:56,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:48:56,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:48:56,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:56,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-13 21:48:56,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:56,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-13 21:48:56,569 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 [2025-03-13 21:48:56,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:48:56,601 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 11 treesize of output 11 [2025-03-13 21:48:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-03-13 21:48:56,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-13 21:48:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:56,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:01,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653368119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:01,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:01,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 28 [2025-03-13 21:49:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477664270] [2025-03-13 21:49:01,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:01,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-13 21:49:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:01,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-13 21:49:01,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=696, Unknown=1, NotChecked=0, Total=812 [2025-03-13 21:49:05,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:09,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:13,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:13,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2025-03-13 21:49:13,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 156 transitions, 1316 flow. Second operand has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 29 states have internal predecessors, (183), 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) [2025-03-13 21:49:13,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:13,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2025-03-13 21:49:13,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:17,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:21,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:26,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:30,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:34,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:38,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:42,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:46,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:49:50,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]