./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/parallel-parallel-sum-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:56,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:56,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:26:56,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:56,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:56,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:56,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:56,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:56,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:56,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:56,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:56,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:56,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:56,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:56,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:56,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:56,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:56,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:56,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:56,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:56,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:56,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:56,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:56,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:56,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:56,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:56,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:56,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:56,588 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 ! overflow) ) 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 -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-03-04 15:26:56,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:56,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:56,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:56,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:56,828 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:56,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-04 15:26:57,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bcd6c15/1e6056619838461694ead72d87219e2e/FLAG56dc00a89 [2025-03-04 15:26:58,213 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:58,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-04 15:26:58,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bcd6c15/1e6056619838461694ead72d87219e2e/FLAG56dc00a89 [2025-03-04 15:26:58,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bcd6c15/1e6056619838461694ead72d87219e2e [2025-03-04 15:26:58,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:58,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:58,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:58,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:58,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:58,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c31941c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58, skipping insertion in model container [2025-03-04 15:26:58,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:58,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:58,702 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:58,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:58,739 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:58,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58 WrapperNode [2025-03-04 15:26:58,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:58,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:58,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:58,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:58,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,770 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 299 [2025-03-04 15:26:58,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:58,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:58,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:58,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:58,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,795 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:26:58,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:58,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:58,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:58,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:58,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (1/1) ... [2025-03-04 15:26:58,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:58,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:58,833 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-04 15:26:58,835 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-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:58,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:26:58,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 15:26:58,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:26:58,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:58,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:58,853 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:26:58,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:58,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:59,287 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:59,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:59,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:59,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:59,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:59 BoogieIcfgContainer [2025-03-04 15:26:59,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:59,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:59,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:59,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:59,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:58" (1/3) ... [2025-03-04 15:26:59,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1f30aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:59, skipping insertion in model container [2025-03-04 15:26:59,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:58" (2/3) ... [2025-03-04 15:26:59,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1f30aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:59, skipping insertion in model container [2025-03-04 15:26:59,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:59" (3/3) ... [2025-03-04 15:26:59,575 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-03-04 15:26:59,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:59,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 78 locations, 1 initial locations, 4 loop locations, and 28 error locations. [2025-03-04 15:26:59,591 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:59,683 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-04 15:26:59,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 89 transitions, 218 flow [2025-03-04 15:26:59,772 INFO L124 PetriNetUnfolderBase]: 9/82 cut-off events. [2025-03-04 15:26:59,775 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 15:26:59,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 9/82 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 252 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 77. Up to 3 conditions per place. [2025-03-04 15:26:59,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 89 transitions, 218 flow [2025-03-04 15:26:59,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 80 transitions, 187 flow [2025-03-04 15:26:59,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:59,794 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;@4d3a28f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:59,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-04 15:26:59,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:59,796 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 15:26:59,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:26:59,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:59,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 15:26:59,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:26:59,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 29468, now seen corresponding path program 1 times [2025-03-04 15:26:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615868823] [2025-03-04 15:26:59,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:59,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:26:59,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:26:59,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:59,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:59,934 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-04 15:26:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615868823] [2025-03-04 15:26:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615868823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718711294] [2025-03-04 15:26:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:59,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:59,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:59,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:59,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-03-04 15:26:59,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-04 15:26:59,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:59,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-03-04 15:26:59,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:03,486 INFO L124 PetriNetUnfolderBase]: 38646/51872 cut-off events. [2025-03-04 15:27:03,487 INFO L125 PetriNetUnfolderBase]: For 1933/1933 co-relation queries the response was YES. [2025-03-04 15:27:03,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106411 conditions, 51872 events. 38646/51872 cut-off events. For 1933/1933 co-relation queries the response was YES. Maximal size of possible extension queue 1954. Compared 299706 event pairs, 35544 based on Foata normal form. 1/32844 useless extension candidates. Maximal degree in co-relation 106315. Up to 51843 conditions per place. [2025-03-04 15:27:03,781 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 62 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-03-04 15:27:03,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 293 flow [2025-03-04 15:27:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 15:27:03,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3882783882783883 [2025-03-04 15:27:03,795 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 187 flow. Second operand 3 states and 106 transitions. [2025-03-04 15:27:03,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 293 flow [2025-03-04 15:27:03,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 276 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:27:03,835 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 152 flow [2025-03-04 15:27:03,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-04 15:27:03,841 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -12 predicate places. [2025-03-04 15:27:03,841 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 152 flow [2025-03-04 15:27:03,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-04 15:27:03,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:03,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:27:03,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:03,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:03,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 914307, now seen corresponding path program 1 times [2025-03-04 15:27:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541129834] [2025-03-04 15:27:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:03,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:27:03,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:27:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:03,895 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-04 15:27:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541129834] [2025-03-04 15:27:03,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541129834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:03,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:27:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610865155] [2025-03-04 15:27:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:03,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:03,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:03,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:03,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-03-04 15:27:03,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-04 15:27:03,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:03,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-03-04 15:27:03,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:06,073 INFO L124 PetriNetUnfolderBase]: 31318/42066 cut-off events. [2025-03-04 15:27:06,073 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2025-03-04 15:27:06,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85260 conditions, 42066 events. 31318/42066 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 236731 event pairs, 28618 based on Foata normal form. 0/27811 useless extension candidates. Maximal degree in co-relation 85254. Up to 42037 conditions per place. [2025-03-04 15:27:06,213 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 58 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2025-03-04 15:27:06,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 262 flow [2025-03-04 15:27:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 15:27:06,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2025-03-04 15:27:06,214 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 152 flow. Second operand 3 states and 96 transitions. [2025-03-04 15:27:06,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 262 flow [2025-03-04 15:27:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:06,216 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 145 flow [2025-03-04 15:27:06,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-04 15:27:06,216 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -15 predicate places. [2025-03-04 15:27:06,216 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 145 flow [2025-03-04 15:27:06,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-04 15:27:06,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:06,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:27:06,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:27:06,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash 878677446, now seen corresponding path program 1 times [2025-03-04 15:27:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593997986] [2025-03-04 15:27:06,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:06,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:27:06,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:27:06,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:06,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:06,327 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-04 15:27:06,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593997986] [2025-03-04 15:27:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593997986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:06,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190509730] [2025-03-04 15:27:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:06,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:06,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:06,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-03-04 15:27:06,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:06,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:06,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-03-04 15:27:06,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:08,533 INFO L124 PetriNetUnfolderBase]: 31319/42070 cut-off events. [2025-03-04 15:27:08,534 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2025-03-04 15:27:08,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85270 conditions, 42070 events. 31319/42070 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 236578 event pairs, 28618 based on Foata normal form. 1/27815 useless extension candidates. Maximal degree in co-relation 85263. Up to 42041 conditions per place. [2025-03-04 15:27:08,746 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 60 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-03-04 15:27:08,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 279 flow [2025-03-04 15:27:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-04 15:27:08,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3021978021978022 [2025-03-04 15:27:08,751 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 145 flow. Second operand 4 states and 110 transitions. [2025-03-04 15:27:08,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 279 flow [2025-03-04 15:27:08,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:08,753 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 173 flow [2025-03-04 15:27:08,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-03-04 15:27:08,754 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -11 predicate places. [2025-03-04 15:27:08,754 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 173 flow [2025-03-04 15:27:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:08,755 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:08,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:27:08,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:08,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1145006040, now seen corresponding path program 1 times [2025-03-04 15:27:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797891457] [2025-03-04 15:27:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:08,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:27:08,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:27:08,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:08,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:08,878 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-04 15:27:08,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:08,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797891457] [2025-03-04 15:27:08,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797891457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:08,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789553980] [2025-03-04 15:27:08,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:08,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:08,882 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-04 15:27:08,884 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-04 15:27:08,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:27:08,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:27:08,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:08,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:08,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:08,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:08,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789553980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:08,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:27:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678469390] [2025-03-04 15:27:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:09,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:09,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:09,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-03-04 15:27:09,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-04 15:27:09,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:09,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-03-04 15:27:09,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:11,238 INFO L124 PetriNetUnfolderBase]: 31319/42069 cut-off events. [2025-03-04 15:27:11,238 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2025-03-04 15:27:11,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85281 conditions, 42069 events. 31319/42069 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 1476. Compared 236583 event pairs, 28618 based on Foata normal form. 1/27815 useless extension candidates. Maximal degree in co-relation 85272. Up to 42036 conditions per place. [2025-03-04 15:27:11,387 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 56 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-03-04 15:27:11,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 295 flow [2025-03-04 15:27:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-04 15:27:11,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2025-03-04 15:27:11,388 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 173 flow. Second operand 6 states and 130 transitions. [2025-03-04 15:27:11,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 295 flow [2025-03-04 15:27:11,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:11,390 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 180 flow [2025-03-04 15:27:11,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-03-04 15:27:11,390 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2025-03-04 15:27:11,390 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 180 flow [2025-03-04 15:27:11,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-04 15:27:11,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:11,391 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:27:11,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:11,591 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-04 15:27:11,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:11,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1135447997, now seen corresponding path program 1 times [2025-03-04 15:27:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255956896] [2025-03-04 15:27:11,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:11,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:27:11,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:27:11,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:11,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:11,682 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-04 15:27:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255956896] [2025-03-04 15:27:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255956896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789362183] [2025-03-04 15:27:11,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:11,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:11,685 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-04 15:27:11,686 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-04 15:27:11,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:27:11,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:27:11,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:11,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:11,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:11,772 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-04 15:27:11,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:11,804 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-04 15:27:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789362183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:11,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:11,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:27:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586366808] [2025-03-04 15:27:11,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:11,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:11,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:11,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-03-04 15:27:11,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 180 flow. Second operand has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 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-04 15:27:11,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:11,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-03-04 15:27:11,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:14,232 INFO L124 PetriNetUnfolderBase]: 31322/42081 cut-off events. [2025-03-04 15:27:14,233 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-04 15:27:14,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85325 conditions, 42081 events. 31322/42081 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 1476. Compared 236758 event pairs, 28618 based on Foata normal form. 3/27827 useless extension candidates. Maximal degree in co-relation 85316. Up to 42043 conditions per place. [2025-03-04 15:27:14,457 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 59 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2025-03-04 15:27:14,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 378 flow [2025-03-04 15:27:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2025-03-04 15:27:14,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2032967032967033 [2025-03-04 15:27:14,459 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 180 flow. Second operand 10 states and 185 transitions. [2025-03-04 15:27:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 378 flow [2025-03-04 15:27:14,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 332 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:14,462 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 232 flow [2025-03-04 15:27:14,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2025-03-04 15:27:14,463 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-03-04 15:27:14,463 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 232 flow [2025-03-04 15:27:14,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.166666666666666) internal successors, (146), 12 states have internal predecessors, (146), 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-04 15:27:14,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:14,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:14,469 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-04 15:27:14,663 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-04 15:27:14,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:14,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash 59704799, now seen corresponding path program 1 times [2025-03-04 15:27:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:14,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990390322] [2025-03-04 15:27:14,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:14,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:14,712 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-04 15:27:14,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990390322] [2025-03-04 15:27:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990390322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520394404] [2025-03-04 15:27:14,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:14,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:14,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:14,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-03-04 15:27:14,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-04 15:27:14,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:14,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-03-04 15:27:14,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:18,258 INFO L124 PetriNetUnfolderBase]: 44938/60299 cut-off events. [2025-03-04 15:27:18,259 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2025-03-04 15:27:18,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121933 conditions, 60299 events. 44938/60299 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 1968. Compared 353875 event pairs, 28644 based on Foata normal form. 0/41180 useless extension candidates. Maximal degree in co-relation 121922. Up to 42056 conditions per place. [2025-03-04 15:27:18,538 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 113 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-03-04 15:27:18,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 121 transitions, 557 flow [2025-03-04 15:27:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-03-04 15:27:18,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 15:27:18,540 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 232 flow. Second operand 3 states and 143 transitions. [2025-03-04 15:27:18,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 121 transitions, 557 flow [2025-03-04 15:27:18,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 546 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:18,541 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 233 flow [2025-03-04 15:27:18,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-03-04 15:27:18,542 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2025-03-04 15:27:18,542 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 233 flow [2025-03-04 15:27:18,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-04 15:27:18,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:18,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:18,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:27:18,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:18,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2042094274, now seen corresponding path program 1 times [2025-03-04 15:27:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789156365] [2025-03-04 15:27:18,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:18,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:18,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:18,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:18,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789156365] [2025-03-04 15:27:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789156365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088360403] [2025-03-04 15:27:18,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:18,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:18,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:18,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:18,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:18,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 91 [2025-03-04 15:27:18,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04 15:27:18,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:18,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 91 [2025-03-04 15:27:18,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:22,829 INFO L124 PetriNetUnfolderBase]: 55353/74399 cut-off events. [2025-03-04 15:27:22,829 INFO L125 PetriNetUnfolderBase]: For 4987/4987 co-relation queries the response was YES. [2025-03-04 15:27:23,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155104 conditions, 74399 events. 55353/74399 cut-off events. For 4987/4987 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 444940 event pairs, 29188 based on Foata normal form. 0/52550 useless extension candidates. Maximal degree in co-relation 155091. Up to 60620 conditions per place. [2025-03-04 15:27:23,208 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 107 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-03-04 15:27:23,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 547 flow [2025-03-04 15:27:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-04 15:27:23,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5018315018315018 [2025-03-04 15:27:23,210 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 233 flow. Second operand 3 states and 137 transitions. [2025-03-04 15:27:23,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 547 flow [2025-03-04 15:27:23,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 116 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:23,223 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 252 flow [2025-03-04 15:27:23,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-03-04 15:27:23,223 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 2 predicate places. [2025-03-04 15:27:23,223 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 252 flow [2025-03-04 15:27:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04 15:27:23,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:23,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:27:23,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-04 15:27:23,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1850849795, now seen corresponding path program 1 times [2025-03-04 15:27:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833850799] [2025-03-04 15:27:23,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:23,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:23,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833850799] [2025-03-04 15:27:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833850799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:23,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:27:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487540470] [2025-03-04 15:27:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:23,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:23,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:23,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:23,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 91 [2025-03-04 15:27:23,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-04 15:27:23,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:23,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 91 [2025-03-04 15:27:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand