./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/chl-node-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:41:39,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:41:39,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:41:39,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:41:39,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:41:39,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:41:39,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:41:39,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:41:39,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:41:39,080 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:41:39,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:41:39,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:41:39,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:41:39,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:41:39,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:41:39,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:41:39,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:41:39,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:41:39,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:41:39,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:41:39,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:41:39,083 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-17 19:41:39,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:41:39,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:41:39,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:41:39,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:41:39,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:41:39,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-17 19:41:40,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0693a581/258582d6d9c64a278715507de2a906a0/FLAG0d4556d50 [2025-03-17 19:41:40,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:41:40,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-17 19:41:40,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0693a581/258582d6d9c64a278715507de2a906a0/FLAG0d4556d50 [2025-03-17 19:41:40,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0693a581/258582d6d9c64a278715507de2a906a0 [2025-03-17 19:41:40,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:41:40,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:41:40,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:41:40,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:41:40,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:41:41,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:41:40" (1/1) ... [2025-03-17 19:41:41,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41, skipping insertion in model container [2025-03-17 19:41:41,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:41:40" (1/1) ... [2025-03-17 19:41:41,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:41:41,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:41:41,138 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:41:41,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:41:41,175 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:41:41,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41 WrapperNode [2025-03-17 19:41:41,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:41:41,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:41:41,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:41:41,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:41:41,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,224 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-03-17 19:41:41,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:41:41,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:41:41,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:41:41,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:41:41,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,255 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-17 19:41:41,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:41:41,277 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:41:41,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:41:41,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:41:41,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:41:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:41,308 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-17 19:41:41,309 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-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 19:41:41,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 19:41:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 19:41:41,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 19:41:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 19:41:41,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 19:41:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:41:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:41:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:41:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:41:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:41:41,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:41:41,327 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:41:41,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:41:41,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:41:42,016 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:41:42,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:41:42,328 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:41:42,328 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:41:42,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:41:42 BoogieIcfgContainer [2025-03-17 19:41:42,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:41:42,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:41:42,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:41:42,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:41:42,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:41:40" (1/3) ... [2025-03-17 19:41:42,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12befd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:41:42, skipping insertion in model container [2025-03-17 19:41:42,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (2/3) ... [2025-03-17 19:41:42,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12befd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:41:42, skipping insertion in model container [2025-03-17 19:41:42,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:41:42" (3/3) ... [2025-03-17 19:41:42,337 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-17 19:41:42,349 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:41:42,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 126 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-03-17 19:41:42,350 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:41:42,418 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 19:41:42,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 140 transitions, 301 flow [2025-03-17 19:41:42,536 INFO L124 PetriNetUnfolderBase]: 15/137 cut-off events. [2025-03-17 19:41:42,538 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 19:41:42,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 15/137 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 417 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2025-03-17 19:41:42,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 140 transitions, 301 flow [2025-03-17 19:41:42,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 135 transitions, 285 flow [2025-03-17 19:41:42,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:41:42,568 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;@1453aaaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:41:42,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-17 19:41:42,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:41:42,572 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 19:41:42,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:41:42,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:42,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 19:41:42,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:42,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash 43026, now seen corresponding path program 1 times [2025-03-17 19:41:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:42,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560322705] [2025-03-17 19:41:42,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:42,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:41:42,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:41:42,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:42,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:42,741 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-17 19:41:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560322705] [2025-03-17 19:41:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560322705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361690138] [2025-03-17 19:41:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:42,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:42,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:42,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:42,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:42,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-17 19:41:42,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:42,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:42,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:43,574 INFO L124 PetriNetUnfolderBase]: 4133/8026 cut-off events. [2025-03-17 19:41:43,575 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-03-17 19:41:43,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13743 conditions, 8026 events. 4133/8026 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 65963 event pairs, 2732 based on Foata normal form. 2/6384 useless extension candidates. Maximal degree in co-relation 13014. Up to 5498 conditions per place. [2025-03-17 19:41:43,636 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 61 selfloop transitions, 1 changer transitions 0/133 dead transitions. [2025-03-17 19:41:43,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 133 transitions, 405 flow [2025-03-17 19:41:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-17 19:41:43,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-17 19:41:43,648 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 285 flow. Second operand 3 states and 286 transitions. [2025-03-17 19:41:43,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 133 transitions, 405 flow [2025-03-17 19:41:43,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 19:41:43,659 INFO L231 Difference]: Finished difference. Result has 125 places, 133 transitions, 274 flow [2025-03-17 19:41:43,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=125, PETRI_TRANSITIONS=133} [2025-03-17 19:41:43,665 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-17 19:41:43,666 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 274 flow [2025-03-17 19:41:43,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-17 19:41:43,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:43,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:41:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:41:43,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1335095, now seen corresponding path program 1 times [2025-03-17 19:41:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-03-17 19:41:43,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:41:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:41:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:43,730 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-17 19:41:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-03-17 19:41:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936300342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875330879] [2025-03-17 19:41:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:43,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:43,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:43,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:43,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-17 19:41:43,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:43,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:43,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:44,342 INFO L124 PetriNetUnfolderBase]: 4133/8024 cut-off events. [2025-03-17 19:41:44,343 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-17 19:41:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13658 conditions, 8024 events. 4133/8024 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66148 event pairs, 2732 based on Foata normal form. 0/6382 useless extension candidates. Maximal degree in co-relation 13652. Up to 5496 conditions per place. [2025-03-17 19:41:44,382 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 59 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-03-17 19:41:44,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 131 transitions, 390 flow [2025-03-17 19:41:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-17 19:41:44,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-17 19:41:44,384 INFO L175 Difference]: Start difference. First operand has 125 places, 133 transitions, 274 flow. Second operand 3 states and 284 transitions. [2025-03-17 19:41:44,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 131 transitions, 390 flow [2025-03-17 19:41:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 131 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:44,386 INFO L231 Difference]: Finished difference. Result has 124 places, 131 transitions, 271 flow [2025-03-17 19:41:44,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=124, PETRI_TRANSITIONS=131} [2025-03-17 19:41:44,387 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-03-17 19:41:44,387 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 131 transitions, 271 flow [2025-03-17 19:41:44,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-17 19:41:44,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:44,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:41:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:41:44,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1283066016, now seen corresponding path program 1 times [2025-03-17 19:41:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046626591] [2025-03-17 19:41:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:44,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:41:44,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:41:44,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:44,505 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-17 19:41:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046626591] [2025-03-17 19:41:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046626591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:44,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751560620] [2025-03-17 19:41:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:44,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:44,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:44,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:41:44,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 131 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-17 19:41:44,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:44,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:41:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:45,148 INFO L124 PetriNetUnfolderBase]: 4136/8036 cut-off events. [2025-03-17 19:41:45,148 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-17 19:41:45,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13686 conditions, 8036 events. 4136/8036 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66160 event pairs, 2732 based on Foata normal form. 3/6394 useless extension candidates. Maximal degree in co-relation 13679. Up to 5506 conditions per place. [2025-03-17 19:41:45,187 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 63 selfloop transitions, 12 changer transitions 0/140 dead transitions. [2025-03-17 19:41:45,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 140 transitions, 439 flow [2025-03-17 19:41:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-17 19:41:45,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-03-17 19:41:45,189 INFO L175 Difference]: Start difference. First operand has 124 places, 131 transitions, 271 flow. Second operand 4 states and 369 transitions. [2025-03-17 19:41:45,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 140 transitions, 439 flow [2025-03-17 19:41:45,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 140 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:45,192 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 357 flow [2025-03-17 19:41:45,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2025-03-17 19:41:45,193 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-03-17 19:41:45,193 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 357 flow [2025-03-17 19:41:45,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-17 19:41:45,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:45,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:41:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:41:45,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1283065982, now seen corresponding path program 1 times [2025-03-17 19:41:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-03-17 19:41:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:45,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:41:45,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:41:45,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:45,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:45,261 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-17 19:41:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-03-17 19:41:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122397617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:45,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99604356] [2025-03-17 19:41:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:45,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:45,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:45,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:45,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 140 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-17 19:41:45,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:45,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:45,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:45,915 INFO L124 PetriNetUnfolderBase]: 4136/8034 cut-off events. [2025-03-17 19:41:45,915 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-17 19:41:45,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 8034 events. 4136/8034 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66122 event pairs, 2732 based on Foata normal form. 2/6398 useless extension candidates. Maximal degree in co-relation 13709. Up to 5507 conditions per place. [2025-03-17 19:41:45,943 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-03-17 19:41:45,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 495 flow [2025-03-17 19:41:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-17 19:41:45,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-17 19:41:45,945 INFO L175 Difference]: Start difference. First operand has 128 places, 140 transitions, 357 flow. Second operand 3 states and 286 transitions. [2025-03-17 19:41:45,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 495 flow [2025-03-17 19:41:45,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:45,947 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 346 flow [2025-03-17 19:41:45,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2025-03-17 19:41:45,950 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-17 19:41:45,950 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 346 flow [2025-03-17 19:41:45,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-17 19:41:45,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:45,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:41:45,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:41:45,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:45,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1120341025, now seen corresponding path program 1 times [2025-03-17 19:41:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:45,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-03-17 19:41:45,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:45,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:41:45,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:41:45,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:45,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:46,000 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-17 19:41:46,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-03-17 19:41:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042274354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:46,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:46,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447620612] [2025-03-17 19:41:46,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:46,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:46,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:46,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:46,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:46,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-17 19:41:46,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:46,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:46,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:46,472 INFO L124 PetriNetUnfolderBase]: 4136/8032 cut-off events. [2025-03-17 19:41:46,473 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-17 19:41:46,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 8032 events. 4136/8032 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66075 event pairs, 2732 based on Foata normal form. 1/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5505 conditions per place. [2025-03-17 19:41:46,500 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2025-03-17 19:41:46,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 480 flow [2025-03-17 19:41:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-17 19:41:46,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-17 19:41:46,502 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 346 flow. Second operand 3 states and 284 transitions. [2025-03-17 19:41:46,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 480 flow [2025-03-17 19:41:46,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:46,505 INFO L231 Difference]: Finished difference. Result has 126 places, 136 transitions, 343 flow [2025-03-17 19:41:46,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=126, PETRI_TRANSITIONS=136} [2025-03-17 19:41:46,506 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-17 19:41:46,507 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 136 transitions, 343 flow [2025-03-17 19:41:46,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-17 19:41:46,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:46,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:46,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:41:46,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:46,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1389023707, now seen corresponding path program 1 times [2025-03-17 19:41:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:46,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533685110] [2025-03-17 19:41:46,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:46,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:46,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:41:46,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:41:46,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:46,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:46,557 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-17 19:41:46,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533685110] [2025-03-17 19:41:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533685110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:46,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:46,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884630139] [2025-03-17 19:41:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:46,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:46,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:46,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:46,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:46,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:46,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 136 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-17 19:41:46,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:46,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:46,975 INFO L124 PetriNetUnfolderBase]: 4136/8030 cut-off events. [2025-03-17 19:41:46,975 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-17 19:41:46,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 8030 events. 4136/8030 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66111 event pairs, 2732 based on Foata normal form. 2/6396 useless extension candidates. Maximal degree in co-relation 13699. Up to 5507 conditions per place. [2025-03-17 19:41:47,006 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 70 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2025-03-17 19:41:47,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 481 flow [2025-03-17 19:41:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-17 19:41:47,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-17 19:41:47,008 INFO L175 Difference]: Start difference. First operand has 126 places, 136 transitions, 343 flow. Second operand 3 states and 286 transitions. [2025-03-17 19:41:47,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 481 flow [2025-03-17 19:41:47,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 134 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:47,011 INFO L231 Difference]: Finished difference. Result has 125 places, 134 transitions, 340 flow [2025-03-17 19:41:47,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=125, PETRI_TRANSITIONS=134} [2025-03-17 19:41:47,012 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-17 19:41:47,013 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 134 transitions, 340 flow [2025-03-17 19:41:47,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-17 19:41:47,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:47,014 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:41:47,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1388069394, now seen corresponding path program 1 times [2025-03-17 19:41:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232748311] [2025-03-17 19:41:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:47,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:41:47,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:41:47,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:47,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:47,079 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-17 19:41:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232748311] [2025-03-17 19:41:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232748311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888151088] [2025-03-17 19:41:47,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:47,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:47,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:47,082 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-17 19:41:47,083 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-17 19:41:47,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:41:47,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:41:47,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:47,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:47,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:47,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:47,194 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-17 19:41:47,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:41:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888151088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:41:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 19:41:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436671340] [2025-03-17 19:41:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:47,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:41:47,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:47,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:41:47,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:41:47,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:41:47,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 134 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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-17 19:41:47,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:47,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:41:47,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:47,767 INFO L124 PetriNetUnfolderBase]: 4136/8027 cut-off events. [2025-03-17 19:41:47,767 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-17 19:41:47,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 8027 events. 4136/8027 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66022 event pairs, 2732 based on Foata normal form. 3/6392 useless extension candidates. Maximal degree in co-relation 13694. Up to 5491 conditions per place. [2025-03-17 19:41:47,801 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 51 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2025-03-17 19:41:47,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 472 flow [2025-03-17 19:41:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:41:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:41:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-03-17 19:41:47,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-03-17 19:41:47,804 INFO L175 Difference]: Start difference. First operand has 125 places, 134 transitions, 340 flow. Second operand 6 states and 507 transitions. [2025-03-17 19:41:47,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 472 flow [2025-03-17 19:41:47,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 131 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:47,806 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 369 flow [2025-03-17 19:41:47,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2025-03-17 19:41:47,810 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-17 19:41:47,810 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 369 flow [2025-03-17 19:41:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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-17 19:41:47,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:47,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:47,819 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-17 19:41:48,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:48,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash -110060785, now seen corresponding path program 1 times [2025-03-17 19:41:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918796432] [2025-03-17 19:41:48,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:41:48,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:41:48,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:48,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,063 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-17 19:41:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:48,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918796432] [2025-03-17 19:41:48,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918796432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:48,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6250364] [2025-03-17 19:41:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:48,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:48,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:48,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:48,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-17 19:41:48,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:48,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:48,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:48,633 INFO L124 PetriNetUnfolderBase]: 4136/8025 cut-off events. [2025-03-17 19:41:48,634 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-17 19:41:48,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13722 conditions, 8025 events. 4136/8025 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66005 event pairs, 2732 based on Foata normal form. 1/6391 useless extension candidates. Maximal degree in co-relation 13710. Up to 5505 conditions per place. [2025-03-17 19:41:48,672 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 68 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2025-03-17 19:41:48,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 129 transitions, 503 flow [2025-03-17 19:41:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-03-17 19:41:48,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-17 19:41:48,674 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 369 flow. Second operand 3 states and 284 transitions. [2025-03-17 19:41:48,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 129 transitions, 503 flow [2025-03-17 19:41:48,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 458 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:48,677 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 322 flow [2025-03-17 19:41:48,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-03-17 19:41:48,678 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-03-17 19:41:48,678 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 322 flow [2025-03-17 19:41:48,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-17 19:41:48,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:48,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:41:48,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:41:48,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -80477065, now seen corresponding path program 1 times [2025-03-17 19:41:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:48,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-03-17 19:41:48,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:48,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:41:48,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:41:48,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,756 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-17 19:41:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-03-17 19:41:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986934271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006939517] [2025-03-17 19:41:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:48,759 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-17 19:41:48,761 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-17 19:41:48,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:41:48,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:41:48,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:48,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:48,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:48,847 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-17 19:41:48,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:48,879 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-17 19:41:48,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006939517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:48,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:48,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 19:41:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615719949] [2025-03-17 19:41:48,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:48,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:41:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:48,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:41:48,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:41:48,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:41:48,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 322 flow. Second operand has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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-17 19:41:48,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:48,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:41:48,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:49,572 INFO L124 PetriNetUnfolderBase]: 4145/8061 cut-off events. [2025-03-17 19:41:49,572 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 19:41:49,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13791 conditions, 8061 events. 4145/8061 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66192 event pairs, 2732 based on Foata normal form. 9/6426 useless extension candidates. Maximal degree in co-relation 13779. Up to 5512 conditions per place. [2025-03-17 19:41:49,602 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 60 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2025-03-17 19:41:49,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 637 flow [2025-03-17 19:41:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:41:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:41:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-03-17 19:41:49,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-17 19:41:49,605 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 322 flow. Second operand 10 states and 828 transitions. [2025-03-17 19:41:49,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 637 flow [2025-03-17 19:41:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 156 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:49,607 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 570 flow [2025-03-17 19:41:49,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=570, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2025-03-17 19:41:49,608 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-17 19:41:49,608 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 570 flow [2025-03-17 19:41:49,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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-17 19:41:49,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:49,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:49,616 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-17 19:41:49,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 19:41:49,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:49,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1371880530, now seen corresponding path program 1 times [2025-03-17 19:41:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225302223] [2025-03-17 19:41:49,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:49,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:41:49,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:41:49,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:49,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:49,878 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-17 19:41:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225302223] [2025-03-17 19:41:49,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225302223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:49,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216807317] [2025-03-17 19:41:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:49,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:49,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:49,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:49,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:49,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:41:49,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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-17 19:41:49,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:49,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:41:49,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:50,319 INFO L124 PetriNetUnfolderBase]: 4148/8073 cut-off events. [2025-03-17 19:41:50,320 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-17 19:41:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 8073 events. 4148/8073 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66326 event pairs, 2732 based on Foata normal form. 3/6438 useless extension candidates. Maximal degree in co-relation 13869. Up to 5542 conditions per place. [2025-03-17 19:41:50,355 INFO L140 encePairwiseOnDemand]: 122/140 looper letters, 99 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2025-03-17 19:41:50,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 165 transitions, 810 flow [2025-03-17 19:41:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-17 19:41:50,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6589285714285714 [2025-03-17 19:41:50,357 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 570 flow. Second operand 4 states and 369 transitions. [2025-03-17 19:41:50,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 165 transitions, 810 flow [2025-03-17 19:41:50,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 165 transitions, 777 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:50,360 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 624 flow [2025-03-17 19:41:50,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=136, PETRI_TRANSITIONS=165} [2025-03-17 19:41:50,361 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-03-17 19:41:50,361 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 624 flow [2025-03-17 19:41:50,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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-17 19:41:50,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:50,361 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:50,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:41:50,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1214638003, now seen corresponding path program 1 times [2025-03-17 19:41:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:50,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081276170] [2025-03-17 19:41:50,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:50,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:41:50,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:41:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:50,452 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-17 19:41:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081276170] [2025-03-17 19:41:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081276170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24296940] [2025-03-17 19:41:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:50,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:50,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:50,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:50,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:50,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 165 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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-17 19:41:50,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:50,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:50,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:50,952 INFO L124 PetriNetUnfolderBase]: 4147/8072 cut-off events. [2025-03-17 19:41:50,952 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-03-17 19:41:50,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13899 conditions, 8072 events. 4147/8072 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66253 event pairs, 2732 based on Foata normal form. 1/6441 useless extension candidates. Maximal degree in co-relation 13881. Up to 5538 conditions per place. [2025-03-17 19:41:50,982 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 101 selfloop transitions, 3 changer transitions 0/164 dead transitions. [2025-03-17 19:41:50,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 164 transitions, 828 flow [2025-03-17 19:41:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 19:41:50,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-17 19:41:50,984 INFO L175 Difference]: Start difference. First operand has 136 places, 165 transitions, 624 flow. Second operand 4 states and 359 transitions. [2025-03-17 19:41:50,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 164 transitions, 828 flow [2025-03-17 19:41:50,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:50,987 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 617 flow [2025-03-17 19:41:50,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=138, PETRI_TRANSITIONS=164} [2025-03-17 19:41:50,987 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places. [2025-03-17 19:41:50,987 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 617 flow [2025-03-17 19:41:50,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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-17 19:41:50,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:50,988 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-17 19:41:50,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:41:50,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:50,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1248634245, now seen corresponding path program 2 times [2025-03-17 19:41:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661003697] [2025-03-17 19:41:50,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:50,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:41:50,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 19:41:50,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:41:50,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:41:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661003697] [2025-03-17 19:41:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661003697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880717709] [2025-03-17 19:41:51,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:51,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:51,047 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-17 19:41:51,049 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-17 19:41:51,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:41:51,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 19:41:51,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:41:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:51,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:41:51,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:41:51,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 19:41:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880717709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:51,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 19:41:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862964142] [2025-03-17 19:41:51,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:51,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:41:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:51,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:41:51,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:41:51,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-03-17 19:41:51,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 164 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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-17 19:41:51,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:51,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-03-17 19:41:51,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:51,642 INFO L124 PetriNetUnfolderBase]: 4147/8069 cut-off events. [2025-03-17 19:41:51,642 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-03-17 19:41:51,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13881 conditions, 8069 events. 4147/8069 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 66207 event pairs, 2732 based on Foata normal form. 3/6440 useless extension candidates. Maximal degree in co-relation 13862. Up to 5507 conditions per place. [2025-03-17 19:41:51,679 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 56 selfloop transitions, 48 changer transitions 0/161 dead transitions. [2025-03-17 19:41:51,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 795 flow [2025-03-17 19:41:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:41:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:41:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-03-17 19:41:51,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-03-17 19:41:51,680 INFO L175 Difference]: Start difference. First operand has 138 places, 164 transitions, 617 flow. Second operand 5 states and 403 transitions. [2025-03-17 19:41:51,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 795 flow [2025-03-17 19:41:51,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 161 transitions, 761 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 19:41:51,683 INFO L231 Difference]: Finished difference. Result has 133 places, 161 transitions, 649 flow [2025-03-17 19:41:51,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=649, PETRI_PLACES=133, PETRI_TRANSITIONS=161} [2025-03-17 19:41:51,684 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-17 19:41:51,684 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 161 transitions, 649 flow [2025-03-17 19:41:51,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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-17 19:41:51,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:51,684 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:51,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 19:41:51,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:51,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:51,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:51,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2107094885, now seen corresponding path program 1 times [2025-03-17 19:41:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:51,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559068497] [2025-03-17 19:41:51,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:51,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:41:51,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:41:51,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:51,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:51,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:51,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559068497] [2025-03-17 19:41:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559068497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:51,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730728388] [2025-03-17 19:41:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:51,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:51,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:51,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:51,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:51,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:51,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 161 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-17 19:41:51,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:51,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:51,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:52,430 INFO L124 PetriNetUnfolderBase]: 4146/8068 cut-off events. [2025-03-17 19:41:52,430 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-17 19:41:52,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13904 conditions, 8068 events. 4146/8068 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66134 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13889. Up to 5537 conditions per place. [2025-03-17 19:41:52,463 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 100 selfloop transitions, 3 changer transitions 0/160 dead transitions. [2025-03-17 19:41:52,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 849 flow [2025-03-17 19:41:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 19:41:52,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-17 19:41:52,464 INFO L175 Difference]: Start difference. First operand has 133 places, 161 transitions, 649 flow. Second operand 4 states and 359 transitions. [2025-03-17 19:41:52,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 849 flow [2025-03-17 19:41:52,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 755 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:52,466 INFO L231 Difference]: Finished difference. Result has 132 places, 160 transitions, 555 flow [2025-03-17 19:41:52,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=132, PETRI_TRANSITIONS=160} [2025-03-17 19:41:52,467 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-17 19:41:52,467 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 160 transitions, 555 flow [2025-03-17 19:41:52,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-17 19:41:52,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:52,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:52,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:41:52,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:52,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1072652687, now seen corresponding path program 1 times [2025-03-17 19:41:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972420996] [2025-03-17 19:41:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:52,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:41:52,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:41:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:41:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972420996] [2025-03-17 19:41:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972420996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129006] [2025-03-17 19:41:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:52,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:52,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:52,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 160 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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-17 19:41:52,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:52,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:52,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:53,007 INFO L124 PetriNetUnfolderBase]: 4145/8067 cut-off events. [2025-03-17 19:41:53,008 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-17 19:41:53,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13857 conditions, 8067 events. 4145/8067 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66125 event pairs, 2732 based on Foata normal form. 0/6426 useless extension candidates. Maximal degree in co-relation 13842. Up to 5536 conditions per place. [2025-03-17 19:41:53,040 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 99 selfloop transitions, 3 changer transitions 0/159 dead transitions. [2025-03-17 19:41:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 159 transitions, 755 flow [2025-03-17 19:41:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 19:41:53,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-17 19:41:53,042 INFO L175 Difference]: Start difference. First operand has 132 places, 160 transitions, 555 flow. Second operand 4 states and 359 transitions. [2025-03-17 19:41:53,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 159 transitions, 755 flow [2025-03-17 19:41:53,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 159 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:53,044 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 553 flow [2025-03-17 19:41:53,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2025-03-17 19:41:53,046 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-17 19:41:53,046 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 553 flow [2025-03-17 19:41:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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-17 19:41:53,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:53,047 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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-17 19:41:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:41:53,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -913724934, now seen corresponding path program 1 times [2025-03-17 19:41:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666727145] [2025-03-17 19:41:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:53,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:41:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:41:53,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:53,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:53,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666727145] [2025-03-17 19:41:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666727145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350260470] [2025-03-17 19:41:53,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:53,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:53,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:53,132 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-17 19:41:53,133 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-17 19:41:53,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:41:53,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:41:53,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:53,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:53,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:41:53,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:53,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350260470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:53,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:53,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 19:41:53,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424449470] [2025-03-17 19:41:53,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:53,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:41:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:53,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:41:53,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:41:53,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 140 [2025-03-17 19:41:53,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 553 flow. Second operand has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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-17 19:41:53,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:53,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 140 [2025-03-17 19:41:53,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:55,084 INFO L124 PetriNetUnfolderBase]: 8284/16102 cut-off events. [2025-03-17 19:41:55,085 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-03-17 19:41:55,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 16102 events. 8284/16102 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 146598 event pairs, 5464 based on Foata normal form. 5/12948 useless extension candidates. Maximal degree in co-relation 27609. Up to 5508 conditions per place. [2025-03-17 19:41:55,195 INFO L140 encePairwiseOnDemand]: 117/140 looper letters, 120 selfloop transitions, 71 changer transitions 0/242 dead transitions. [2025-03-17 19:41:55,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 242 transitions, 1257 flow [2025-03-17 19:41:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:41:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 19:41:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1263 transitions. [2025-03-17 19:41:55,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5011904761904762 [2025-03-17 19:41:55,198 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 553 flow. Second operand 18 states and 1263 transitions. [2025-03-17 19:41:55,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 242 transitions, 1257 flow [2025-03-17 19:41:55,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 242 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:55,201 INFO L231 Difference]: Finished difference. Result has 147 places, 195 transitions, 980 flow [2025-03-17 19:41:55,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=980, PETRI_PLACES=147, PETRI_TRANSITIONS=195} [2025-03-17 19:41:55,202 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2025-03-17 19:41:55,202 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 195 transitions, 980 flow [2025-03-17 19:41:55,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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-17 19:41:55,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:55,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:55,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:41:55,404 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:55,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash -936623841, now seen corresponding path program 1 times [2025-03-17 19:41:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148006725] [2025-03-17 19:41:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:55,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:41:55,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:41:55,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:55,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:41:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148006725] [2025-03-17 19:41:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148006725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347111961] [2025-03-17 19:41:55,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:55,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:55,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:55,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:55,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:41:55,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 19:41:55,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 19:41:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:55,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:55,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:41:55,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 19:41:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347111961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:55,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 19:41:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130342628] [2025-03-17 19:41:55,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:41:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:55,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:41:55,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:41:55,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:41:55,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 195 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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-17 19:41:55,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:55,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:41:55,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:56,573 INFO L124 PetriNetUnfolderBase]: 8299/16162 cut-off events. [2025-03-17 19:41:56,574 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-03-17 19:41:56,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27938 conditions, 16162 events. 8299/16162 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 147292 event pairs, 5464 based on Foata normal form. 15/12917 useless extension candidates. Maximal degree in co-relation 27923. Up to 11066 conditions per place. [2025-03-17 19:41:56,671 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 119 selfloop transitions, 70 changer transitions 0/240 dead transitions. [2025-03-17 19:41:56,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 240 transitions, 1637 flow [2025-03-17 19:41:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:41:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:41:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 828 transitions. [2025-03-17 19:41:56,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-17 19:41:56,673 INFO L175 Difference]: Start difference. First operand has 147 places, 195 transitions, 980 flow. Second operand 10 states and 828 transitions. [2025-03-17 19:41:56,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 240 transitions, 1637 flow [2025-03-17 19:41:56,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 240 transitions, 1505 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:56,678 INFO L231 Difference]: Finished difference. Result has 155 places, 240 transitions, 1345 flow [2025-03-17 19:41:56,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1345, PETRI_PLACES=155, PETRI_TRANSITIONS=240} [2025-03-17 19:41:56,679 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 25 predicate places. [2025-03-17 19:41:56,679 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 240 transitions, 1345 flow [2025-03-17 19:41:56,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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-17 19:41:56,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:56,679 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, 1, 1, 1, 1, 1] [2025-03-17 19:41:56,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 19:41:56,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 19:41:56,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1252211590, now seen corresponding path program 1 times [2025-03-17 19:41:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714064740] [2025-03-17 19:41:56,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:41:56,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:41:56,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:56,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714064740] [2025-03-17 19:41:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714064740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009756322] [2025-03-17 19:41:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:56,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:56,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:56,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:56,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:41:56,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 240 transitions, 1345 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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-17 19:41:56,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:56,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:41:56,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:58,495 INFO L124 PetriNetUnfolderBase]: 16161/28622 cut-off events. [2025-03-17 19:41:58,495 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2025-03-17 19:41:58,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51221 conditions, 28622 events. 16161/28622 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 259040 event pairs, 4946 based on Foata normal form. 728/24000 useless extension candidates. Maximal degree in co-relation 51203. Up to 10192 conditions per place. [2025-03-17 19:41:58,742 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 236 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-03-17 19:41:58,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 289 transitions, 1931 flow [2025-03-17 19:41:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2025-03-17 19:41:58,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-17 19:41:58,744 INFO L175 Difference]: Start difference. First operand has 155 places, 240 transitions, 1345 flow. Second operand 4 states and 406 transitions. [2025-03-17 19:41:58,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 289 transitions, 1931 flow [2025-03-17 19:41:58,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 289 transitions, 1871 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:58,749 INFO L231 Difference]: Finished difference. Result has 158 places, 242 transitions, 1319 flow [2025-03-17 19:41:58,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1319, PETRI_PLACES=158, PETRI_TRANSITIONS=242} [2025-03-17 19:41:58,750 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 28 predicate places. [2025-03-17 19:41:58,750 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 242 transitions, 1319 flow [2025-03-17 19:41:58,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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-17 19:41:58,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:58,750 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, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:58,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:41:58,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:41:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash 163854936, now seen corresponding path program 1 times [2025-03-17 19:41:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247563220] [2025-03-17 19:41:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:58,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:41:58,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:41:58,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:58,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:58,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247563220] [2025-03-17 19:41:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247563220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:58,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80037049] [2025-03-17 19:41:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:58,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:58,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:58,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:58,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:58,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:41:58,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 242 transitions, 1319 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-17 19:41:58,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:58,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:41:58,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:00,144 INFO L124 PetriNetUnfolderBase]: 10387/20680 cut-off events. [2025-03-17 19:42:00,144 INFO L125 PetriNetUnfolderBase]: For 4063/4595 co-relation queries the response was YES. [2025-03-17 19:42:00,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38331 conditions, 20680 events. 10387/20680 cut-off events. For 4063/4595 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 200097 event pairs, 7008 based on Foata normal form. 272/17108 useless extension candidates. Maximal degree in co-relation 38310. Up to 13915 conditions per place. [2025-03-17 19:42:00,238 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 181 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2025-03-17 19:42:00,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 240 transitions, 1680 flow [2025-03-17 19:42:00,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:42:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:42:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 19:42:00,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-17 19:42:00,243 INFO L175 Difference]: Start difference. First operand has 158 places, 242 transitions, 1319 flow. Second operand 4 states and 359 transitions. [2025-03-17 19:42:00,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 240 transitions, 1680 flow [2025-03-17 19:42:00,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 240 transitions, 1680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:42:00,255 INFO L231 Difference]: Finished difference. Result has 161 places, 240 transitions, 1318 flow [2025-03-17 19:42:00,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1318, PETRI_PLACES=161, PETRI_TRANSITIONS=240} [2025-03-17 19:42:00,256 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 31 predicate places. [2025-03-17 19:42:00,256 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 240 transitions, 1318 flow [2025-03-17 19:42:00,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-17 19:42:00,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:00,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:42:00,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:42:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -680485117, now seen corresponding path program 1 times [2025-03-17 19:42:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895168969] [2025-03-17 19:42:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:00,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 19:42:00,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 19:42:00,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:00,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895168969] [2025-03-17 19:42:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895168969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:42:00,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:42:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365832504] [2025-03-17 19:42:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:42:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:00,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:42:00,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:42:00,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:42:00,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 240 transitions, 1318 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:42:00,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:00,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:42:00,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:01,670 INFO L124 PetriNetUnfolderBase]: 10385/20678 cut-off events. [2025-03-17 19:42:01,670 INFO L125 PetriNetUnfolderBase]: For 4073/4605 co-relation queries the response was YES. [2025-03-17 19:42:01,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38329 conditions, 20678 events. 10385/20678 cut-off events. For 4073/4605 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 199854 event pairs, 7008 based on Foata normal form. 272/17106 useless extension candidates. Maximal degree in co-relation 38306. Up to 13913 conditions per place. [2025-03-17 19:42:01,786 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 179 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2025-03-17 19:42:01,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 238 transitions, 1675 flow [2025-03-17 19:42:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:42:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:42:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 19:42:01,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-17 19:42:01,787 INFO L175 Difference]: Start difference. First operand has 161 places, 240 transitions, 1318 flow. Second operand 4 states and 359 transitions. [2025-03-17 19:42:01,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 238 transitions, 1675 flow [2025-03-17 19:42:01,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 238 transitions, 1669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:42:01,799 INFO L231 Difference]: Finished difference. Result has 162 places, 238 transitions, 1311 flow [2025-03-17 19:42:01,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1311, PETRI_PLACES=162, PETRI_TRANSITIONS=238} [2025-03-17 19:42:01,800 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 32 predicate places. [2025-03-17 19:42:01,800 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 238 transitions, 1311 flow [2025-03-17 19:42:01,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:42:01,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:01,800 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:01,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:42:01,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:42:01,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1562885400, now seen corresponding path program 2 times [2025-03-17 19:42:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:01,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555228730] [2025-03-17 19:42:01,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:01,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 19:42:01,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-03-17 19:42:01,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:42:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 19:42:01,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555228730] [2025-03-17 19:42:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555228730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136831006] [2025-03-17 19:42:01,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:01,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:42:01,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 19:42:01,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-03-17 19:42:01,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:42:01,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:01,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:42:01,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 19:42:01,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 19:42:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136831006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:02,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-03-17 19:42:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666407497] [2025-03-17 19:42:02,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:42:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:02,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:42:02,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:42:02,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2025-03-17 19:42:02,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 238 transitions, 1311 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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-17 19:42:02,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:02,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2025-03-17 19:42:02,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:03,210 INFO L124 PetriNetUnfolderBase]: 10385/20673 cut-off events. [2025-03-17 19:42:03,210 INFO L125 PetriNetUnfolderBase]: For 4097/4629 co-relation queries the response was YES. [2025-03-17 19:42:03,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38306 conditions, 20673 events. 10385/20673 cut-off events. For 4097/4629 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 199884 event pairs, 7008 based on Foata normal form. 275/17104 useless extension candidates. Maximal degree in co-relation 38283. Up to 13859 conditions per place. [2025-03-17 19:42:03,339 INFO L140 encePairwiseOnDemand]: 124/140 looper letters, 102 selfloop transitions, 82 changer transitions 0/235 dead transitions. [2025-03-17 19:42:03,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 235 transitions, 1649 flow [2025-03-17 19:42:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:42:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:42:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 403 transitions. [2025-03-17 19:42:03,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757142857142857 [2025-03-17 19:42:03,340 INFO L175 Difference]: Start difference. First operand has 162 places, 238 transitions, 1311 flow. Second operand 5 states and 403 transitions. [2025-03-17 19:42:03,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 235 transitions, 1649 flow [2025-03-17 19:42:03,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 235 transitions, 1591 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-17 19:42:03,361 INFO L231 Difference]: Finished difference. Result has 157 places, 235 transitions, 1387 flow [2025-03-17 19:42:03,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1387, PETRI_PLACES=157, PETRI_TRANSITIONS=235} [2025-03-17 19:42:03,361 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 27 predicate places. [2025-03-17 19:42:03,361 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 235 transitions, 1387 flow [2025-03-17 19:42:03,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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-17 19:42:03,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:03,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:03,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:42:03,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:03,562 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:42:03,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1973229692, now seen corresponding path program 1 times [2025-03-17 19:42:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193325670] [2025-03-17 19:42:03,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:03,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 19:42:03,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:42:03,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:03,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:42:03,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:03,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193325670] [2025-03-17 19:42:03,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193325670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:03,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:42:03,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:42:03,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244088520] [2025-03-17 19:42:03,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:03,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:42:03,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:03,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:42:03,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:42:03,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2025-03-17 19:42:03,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 235 transitions, 1387 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-17 19:42:03,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:03,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2025-03-17 19:42:03,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:05,195 INFO L124 PetriNetUnfolderBase]: 10383/20671 cut-off events. [2025-03-17 19:42:05,196 INFO L125 PetriNetUnfolderBase]: For 4120/4652 co-relation queries the response was YES. [2025-03-17 19:42:05,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38345 conditions, 20671 events. 10383/20671 cut-off events. For 4120/4652 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 199697 event pairs, 7008 based on Foata normal form. 271/17092 useless extension candidates. Maximal degree in co-relation 38326. Up to 13911 conditions per place. [2025-03-17 19:42:05,342 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 177 selfloop transitions, 5 changer transitions 0/233 dead transitions. [2025-03-17 19:42:05,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 233 transitions, 1736 flow [2025-03-17 19:42:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:42:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:42:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 19:42:05,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410714285714286 [2025-03-17 19:42:05,345 INFO L175 Difference]: Start difference. First operand has 157 places, 235 transitions, 1387 flow. Second operand 4 states and 359 transitions. [2025-03-17 19:42:05,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 233 transitions, 1736 flow [2025-03-17 19:42:05,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 1576 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:42:05,368 INFO L231 Difference]: Finished difference. Result has 156 places, 233 transitions, 1222 flow [2025-03-17 19:42:05,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1222, PETRI_PLACES=156, PETRI_TRANSITIONS=233} [2025-03-17 19:42:05,369 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 26 predicate places. [2025-03-17 19:42:05,369 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 233 transitions, 1222 flow [2025-03-17 19:42:05,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-17 19:42:05,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:05,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:05,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 19:42:05,370 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:42:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1867679789, now seen corresponding path program 1 times [2025-03-17 19:42:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-03-17 19:42:05,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:05,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 19:42:05,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 19:42:05,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:06,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:06,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-03-17 19:42:06,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543253786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:06,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102918581] [2025-03-17 19:42:06,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:06,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:06,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:06,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:06,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:42:06,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 19:42:06,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 19:42:06,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:06,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:06,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 19:42:06,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:06,295 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-17 19:42:06,323 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-17 19:42:06,428 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:06,428 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-17 19:42:06,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:42:06,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:42:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:06,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:06,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:06,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:42:06,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:06,759 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 41 treesize of output 33 [2025-03-17 19:42:06,763 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 13 treesize of output 7 [2025-03-17 19:42:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102918581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:06,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 19:42:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036386674] [2025-03-17 19:42:06,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:06,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:42:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:42:06,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2025-03-17 19:42:07,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-03-17 19:42:07,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 233 transitions, 1222 flow. Second operand has 19 states, 19 states have (on average 57.578947368421055) internal successors, (1094), 19 states have internal predecessors, (1094), 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-17 19:42:07,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:07,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-03-17 19:42:07,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:08,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_159| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_159|) 0)) (forall ((v_ArrVal_373 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_159| v_ArrVal_373) c_~get_5~0.base) .cse0) 9223372039002259456)))) (forall ((v_ArrVal_373 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_373) c_~get_5~0.base) .cse0) 9223372039002259456)) (<= 0 c_~id_3~0))) is different from false [2025-03-17 19:42:17,186 INFO L124 PetriNetUnfolderBase]: 77793/118511 cut-off events. [2025-03-17 19:42:17,186 INFO L125 PetriNetUnfolderBase]: For 11864/12306 co-relation queries the response was YES. [2025-03-17 19:42:17,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241689 conditions, 118511 events. 77793/118511 cut-off events. For 11864/12306 co-relation queries the response was YES. Maximal size of possible extension queue 5052. Compared 1015797 event pairs, 17482 based on Foata normal form. 442/104225 useless extension candidates. Maximal degree in co-relation 241670. Up to 24786 conditions per place. [2025-03-17 19:42:18,048 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 524 selfloop transitions, 108 changer transitions 0/669 dead transitions. [2025-03-17 19:42:18,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 669 transitions, 4389 flow [2025-03-17 19:42:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:42:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 19:42:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1533 transitions. [2025-03-17 19:42:18,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2025-03-17 19:42:18,050 INFO L175 Difference]: Start difference. First operand has 156 places, 233 transitions, 1222 flow. Second operand 22 states and 1533 transitions. [2025-03-17 19:42:18,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 669 transitions, 4389 flow [2025-03-17 19:42:18,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 669 transitions, 4375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:42:18,615 INFO L231 Difference]: Finished difference. Result has 180 places, 292 transitions, 1993 flow [2025-03-17 19:42:18,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1993, PETRI_PLACES=180, PETRI_TRANSITIONS=292} [2025-03-17 19:42:18,616 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 50 predicate places. [2025-03-17 19:42:18,616 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 292 transitions, 1993 flow [2025-03-17 19:42:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 57.578947368421055) internal successors, (1094), 19 states have internal predecessors, (1094), 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-17 19:42:18,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:18,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:18,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:42:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:18,817 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:42:18,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1143475930, now seen corresponding path program 1 times [2025-03-17 19:42:18,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:18,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449927632] [2025-03-17 19:42:18,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:18,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:42:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:42:18,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:18,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:42:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449927632] [2025-03-17 19:42:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449927632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:42:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:42:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504159106] [2025-03-17 19:42:18,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:18,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:42:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:18,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:42:18,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:42:18,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-17 19:42:18,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 292 transitions, 1993 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:42:18,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:18,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-17 19:42:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:27,706 INFO L124 PetriNetUnfolderBase]: 65461/115971 cut-off events. [2025-03-17 19:42:27,706 INFO L125 PetriNetUnfolderBase]: For 57032/60388 co-relation queries the response was YES. [2025-03-17 19:42:28,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242470 conditions, 115971 events. 65461/115971 cut-off events. For 57032/60388 co-relation queries the response was YES. Maximal size of possible extension queue 5694. Compared 1228042 event pairs, 22082 based on Foata normal form. 4402/102177 useless extension candidates. Maximal degree in co-relation 242446. Up to 42378 conditions per place. [2025-03-17 19:42:28,689 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 313 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-03-17 19:42:28,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 365 transitions, 2959 flow [2025-03-17 19:42:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:42:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:42:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-03-17 19:42:28,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-03-17 19:42:28,690 INFO L175 Difference]: Start difference. First operand has 180 places, 292 transitions, 1993 flow. Second operand 4 states and 404 transitions. [2025-03-17 19:42:28,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 365 transitions, 2959 flow [2025-03-17 19:42:28,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 365 transitions, 2943 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 19:42:28,966 INFO L231 Difference]: Finished difference. Result has 183 places, 294 transitions, 2019 flow [2025-03-17 19:42:28,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2019, PETRI_PLACES=183, PETRI_TRANSITIONS=294} [2025-03-17 19:42:28,966 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 53 predicate places. [2025-03-17 19:42:28,967 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 294 transitions, 2019 flow [2025-03-17 19:42:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:42:28,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:28,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:28,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 19:42:28,967 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-17 19:42:28,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:28,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2063528049, now seen corresponding path program 1 times [2025-03-17 19:42:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316396252] [2025-03-17 19:42:28,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:28,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:42:29,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:42:29,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316396252] [2025-03-17 19:42:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316396252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732620100] [2025-03-17 19:42:29,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:29,622 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:29,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:42:29,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 19:42:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:42:29,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:29,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:29,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 19:42:29,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:29,997 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-17 19:42:30,019 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-17 19:42:30,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:30,099 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-17 19:42:30,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:42:30,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:42:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:30,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:30,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:30,374 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-17 19:42:30,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:30,383 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 47 treesize of output 39 [2025-03-17 19:42:30,386 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 15 treesize of output 9 [2025-03-17 19:42:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:42:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732620100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:30,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:30,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 19:42:30,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527279194] [2025-03-17 19:42:30,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:30,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:42:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:30,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:42:30,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2025-03-17 19:42:30,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 140 [2025-03-17 19:42:30,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 294 transitions, 2019 flow. Second operand has 19 states, 19 states have (on average 57.578947368421055) internal successors, (1094), 19 states have internal predecessors, (1094), 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-17 19:42:30,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:30,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 140 [2025-03-17 19:42:30,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:35,640 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]